FANMOD: a tool for fast network motif detection
Bioinformatics
A content-driven reputation system for the wikipedia
Proceedings of the 16th international conference on World Wide Web
Machine Learning Techniques for Multimedia: Case Studies on Organization and Retrieval (Cognitive Technologies)
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Local Topology of Social Network Based on Motif Analysis
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Network analysis of collaboration structure in Wikipedia
Proceedings of the 18th international conference on World wide web
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Identifying featured articles in wikipedia: writing style matters
Proceedings of the 19th international conference on World wide web
Using network motifs to identify application protocols
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Measuring author contributions to the Wikipedia
WikiSym '08 Proceedings of the 4th International Symposium on Wikis
Co-authorship 2.0: patterns of collaboration in Wikipedia
Proceedings of the 22nd ACM conference on Hypertext and hypermedia
Proceedings of the 7th International Symposium on Wikis and Open Collaboration
Characterizing Wikipedia pages using edit network motif profiles
Proceedings of the 3rd international workshop on Search and mining user-generated contents
Tell me more: an actionable quality model for Wikipedia
Proceedings of the 9th International Symposium on Open Collaboration
| Hi-index | 0.00 |
Because the production of Wikipedia articles is a collaborative process, the edit network around a article can tell us something about the quality of that article. Articles that have received little attention will have sparse networks; at the other end of the spectrum, articles that are Wikipedia battle grounds will have very crowded networks. In this paper we evaluate the idea of characterizing edit networks as a vector of motif counts that can be used in clustering and classification. Our objective is not immediately to develop a powerful classifier but to assess what is the signal in network motifs. We show that this motif count vector representation is effective for classifying articles on the Wikipedia quality scale. We further show that ratios of motif counts can effectively overcome normalization problems when comparing networks of radically different sizes.