Wikipedia Page Social Network - Revision history

AndreaBonarini at 16:07, 28 April 2011

2011-04-28T16:07:15Z

DavidLaniado at 08:29, 27 May 2010

2010-05-27T08:29:17Z

DavidLaniado at 18:46, 10 October 2009

2009-10-10T18:46:47Z

DavidLaniado: New page: {{ProjectProposal |title=Wikipedia Page Social Network |image= |description=Goal of this project is to study the social network of Wikipedia pages, where two pages are connected if they sh...

2009-09-11T15:49:26Z

New page: {{ProjectProposal |title=Wikipedia Page Social Network |image= |description=Goal of this project is to study the social network of Wikipedia pages, where two pages are connected if they sh...

New page

{{ProjectProposal
|title=Wikipedia Page Social Network
|image=
|description=Goal of this project is to study the social network of Wikipedia pages, where two pages are connected if they share at least one main contributor. This social network can be studied to reveal interesting information; for example, it is possible to extract clusters of pages which apparently have nothing in common. A metric of distance between pages in the network can be defined, and compared with other metrics, such as the distance in the category tree or in the hyperlink graph.
|tutor=DavidLaniado;RiccardoTasso;MarcoColombetti
|cfumin=5
|cfumax=20
|studmin=1
|studmax=2
|resarea=Social Software and Semantic Web
|restopic=Social Network Analysis
|level=Bs;Ms
|type=Course;Thesis
|status=Proposal
}}

Goal of this project is to study the social network of Wikipedia pages, where two pages are connected if they share at least one main contributor. This social network can be studied to reveal interesting information; for example, it is possible to extract clusters of pages which apparently have nothing in common. A metric of distance between pages in the network can be defined, and compared with other metrics, such as the distance in the [[Wikipedia Category Map|category tree]] or in the hyperlink graph.

;Tools and instruments
:the software can be implemented in any programming language.

;Related projects
:[[Wikipedia Social Network]]
:[[Mining the Network of Coordination Interactions in Wikipedia]]

@@ Line 11: / Line 11: @@
 |level=Bs; Ms
 |type=Course; Thesis
-|status=Active
+|status=Closed
 }}
 Goal of this project is to study the social network of Wikipedia pages, where two pages are connected if they share at least one main contributor. This social network can be studied to reveal interesting information; for example, it is possible to extract clusters of pages which apparently have nothing in common. A metric of distance between pages in the network can be defined, and compared with other metrics, such as the distance in the [[Wikipedia Category Map|category tree]] or in the hyperlink graph.

@@ Line 1: / Line 1: @@
 {{ProjectProposal
 |title=Wikipedia Page Social Network
 |description=Goal of this project is to study the social network of Wikipedia pages, where two pages are connected if they share at least one main contributor. This social network can be studied to reveal interesting information; for example, it is possible to extract clusters of pages which apparently have nothing in common. A metric of distance between pages in the network can be defined, and compared with other metrics, such as the distance in the category tree or in the hyperlink graph.
 |tutor=DavidLaniado;RiccardoTasso;MarcoColombetti
 |studmin=1
 |studmax=2
 |resarea=Social Software and Semantic Web
 |restopic=Social Network Analysis
-|level=Bs;Ms
+|level=Bs; Ms
-|type=Course;Thesis
+|type=Course; Thesis
 }}
 Goal of this project is to study the social network of Wikipedia pages, where two pages are connected if they share at least one main contributor. This social network can be studied to reveal interesting information; for example, it is possible to extract clusters of pages which apparently have nothing in common. A metric of distance between pages in the network can be defined, and compared with other metrics, such as the distance in the [[Wikipedia Category Map|category tree]] or in the hyperlink graph.