Editing Classifying Wikipedia Articles Using Network Motif Counts and Ratios

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 5: Line 5:
 
|publishedin=WikiSym
 
|publishedin=WikiSym
 
|date=2012-08
 
|date=2012-08
|keywords=Wikipedia Quality, Edit Networks
 
 
|peer-reviewed=Yes
 
|peer-reviewed=Yes
 
|language=English
 
|language=English
 
|remotemirror=http://www.wikisym.org/ws2012/bin/download/Main/Program/p2awikisym2012.PDF
 
|remotemirror=http://www.wikisym.org/ws2012/bin/download/Main/Program/p2awikisym2012.PDF
|abstract=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.
 
 
 
}}
 
}}
 
{{talk}}
 
{{talk}}

Please note that all contributions to WikiPapers are considered to be released under the Creative Commons CC-BY-SA 3.0 license (see WikiPapers:Copyrights for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource. Do not submit copyrighted work without permission!

Cancel | Editing help (opens in new window)