Difference between revisions of "Wikipedia Tripartite Graph"
From AIRWiki
DavidLaniado (Talk | contribs) m |
DavidLaniado (Talk | contribs) |
||
| Line 1: | Line 1: | ||
{{ProjectProposal | {{ProjectProposal | ||
|title=Wikipedia Tripartite Graph | |title=Wikipedia Tripartite Graph | ||
| − | |||
|description=When a user edits a Wikipedia page, we can establish a link among her, the page and the categories to which the page belongs. A model to represent this information is a tripartite graph. Aim of this project is to build a tripartite graph from Wikipedia users, pages and categories, and mine the outcome network to extract emergent semantics. | |description=When a user edits a Wikipedia page, we can establish a link among her, the page and the categories to which the page belongs. A model to represent this information is a tripartite graph. Aim of this project is to build a tripartite graph from Wikipedia users, pages and categories, and mine the outcome network to extract emergent semantics. | ||
|tutor=DavidLaniado;RiccardoTasso;MarcoColombetti | |tutor=DavidLaniado;RiccardoTasso;MarcoColombetti | ||
| − | |||
| − | |||
|studmin=1 | |studmin=1 | ||
|studmax=2 | |studmax=2 | ||
| + | |cfumin=20 | ||
| + | |cfumax=20 | ||
|resarea=Social Software and Semantic Web | |resarea=Social Software and Semantic Web | ||
|restopic=Social Network Analysis;Semantic Tagging | |restopic=Social Network Analysis;Semantic Tagging | ||
|level=Ms | |level=Ms | ||
|type=Thesis | |type=Thesis | ||
| + | |status=Active | ||
}} | }} | ||
| − | |||
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. | 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. | ||
Revision as of 09:28, 27 May 2010
| Title: | Wikipedia Tripartite Graph | |
| Description: | When a user edits a Wikipedia page, we can establish a link among her, the page and the categories to which the page belongs. A model to represent this information is a tripartite graph. Aim of this project is to build a tripartite graph from Wikipedia users, pages and categories, and mine the outcome network to extract emergent semantics. | |
| Tutor: | DavidLaniado (david.laniado@gmail.com), RiccardoTasso (tasso@elet.polimi.it), MarcoColombetti (colombet@elet.polimi.it) | |
| Start: | Nowwarning.pngThe date "Now" was not understood. | |
| Students: | 1 - 2 | |
| CFU: | 20 - 20 | |
| Research Area: | Social Software and Semantic Web | |
| Research Topic: | Social Network Analysis, Semantic Tagging | |
| Level: | Ms | |
| Type: | Thesis | |
| Status: | Active |
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.
- Tools and instruments
- the software can be implemented in any programming language.
