Wikipedia revision graph extraction based on n-gram cover

Jianmin Wu, Mizuho Iwaihara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

During the past decade, mass collaboration systems have emerged and thrived on the World-Wide Web, with numerous user contents generated. As one of such systems, Wikipedia allows users to add and edit articles in this encyclopedic knowledge base and piles of revisions have been contributed. Wikipedia maintains a linear record of edit history with timestamp for each article, which includes precious information on how each article has evolved. However, meaningful revision evolution features like branching and revert are implicit and needed to be reconstructed. Also, existence of merges from multiple ancestors indicates that the edit history shall be modeled as a directed acyclic graph. To address these issues, we propose a revision graph extraction method based on n-gram cover that effectively find branching and revert. We evaluate the accuracy of our method by comparing with manually constructed revision graphs.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages29-38
Number of pages10
Volume7419 LNCS
DOIs
Publication statusPublished - 2012
EventInt. Workshops on Web-Age Information Management, WAIM 2012: 1st Int. Workshop on GDMM 2012, 2nd Int. Wireless Sensor Networks Workshop, IWSN 2012, 1st Int. Workshop on MDSP 2012, 3rd Int. Workshop on USDM 2012, 4th Int. Workshop on XMLDM 2012 - Harbin
Duration: 2012 Aug 182012 Aug 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7419 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInt. Workshops on Web-Age Information Management, WAIM 2012: 1st Int. Workshop on GDMM 2012, 2nd Int. Wireless Sensor Networks Workshop, IWSN 2012, 1st Int. Workshop on MDSP 2012, 3rd Int. Workshop on USDM 2012, 4th Int. Workshop on XMLDM 2012
CityHarbin
Period12/8/1812/8/20

Fingerprint

N-gram
Wikipedia
World Wide Web
Piles
Cover
Graph in graph theory
Branching
Timestamp
Directed Acyclic Graph
Knowledge Base
Evaluate
History

Keywords

  • Mass collaboration
  • Wikipedia revision graph

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Wu, J., & Iwaihara, M. (2012). Wikipedia revision graph extraction based on n-gram cover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7419 LNCS, pp. 29-38). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7419 LNCS). https://doi.org/10.1007/978-3-642-33050-6_4

Wikipedia revision graph extraction based on n-gram cover. / Wu, Jianmin; Iwaihara, Mizuho.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7419 LNCS 2012. p. 29-38 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7419 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wu, J & Iwaihara, M 2012, Wikipedia revision graph extraction based on n-gram cover. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7419 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7419 LNCS, pp. 29-38, Int. Workshops on Web-Age Information Management, WAIM 2012: 1st Int. Workshop on GDMM 2012, 2nd Int. Wireless Sensor Networks Workshop, IWSN 2012, 1st Int. Workshop on MDSP 2012, 3rd Int. Workshop on USDM 2012, 4th Int. Workshop on XMLDM 2012, Harbin, 12/8/18. https://doi.org/10.1007/978-3-642-33050-6_4
Wu J, Iwaihara M. Wikipedia revision graph extraction based on n-gram cover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7419 LNCS. 2012. p. 29-38. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-33050-6_4
Wu, Jianmin ; Iwaihara, Mizuho. / Wikipedia revision graph extraction based on n-gram cover. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7419 LNCS 2012. pp. 29-38 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{917dd531b77d438780271c3521de96af,
title = "Wikipedia revision graph extraction based on n-gram cover",
abstract = "During the past decade, mass collaboration systems have emerged and thrived on the World-Wide Web, with numerous user contents generated. As one of such systems, Wikipedia allows users to add and edit articles in this encyclopedic knowledge base and piles of revisions have been contributed. Wikipedia maintains a linear record of edit history with timestamp for each article, which includes precious information on how each article has evolved. However, meaningful revision evolution features like branching and revert are implicit and needed to be reconstructed. Also, existence of merges from multiple ancestors indicates that the edit history shall be modeled as a directed acyclic graph. To address these issues, we propose a revision graph extraction method based on n-gram cover that effectively find branching and revert. We evaluate the accuracy of our method by comparing with manually constructed revision graphs.",
keywords = "Mass collaboration, Wikipedia revision graph",
author = "Jianmin Wu and Mizuho Iwaihara",
year = "2012",
doi = "10.1007/978-3-642-33050-6_4",
language = "English",
isbn = "9783642330490",
volume = "7419 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "29--38",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Wikipedia revision graph extraction based on n-gram cover

AU - Wu, Jianmin

AU - Iwaihara, Mizuho

PY - 2012

Y1 - 2012

N2 - During the past decade, mass collaboration systems have emerged and thrived on the World-Wide Web, with numerous user contents generated. As one of such systems, Wikipedia allows users to add and edit articles in this encyclopedic knowledge base and piles of revisions have been contributed. Wikipedia maintains a linear record of edit history with timestamp for each article, which includes precious information on how each article has evolved. However, meaningful revision evolution features like branching and revert are implicit and needed to be reconstructed. Also, existence of merges from multiple ancestors indicates that the edit history shall be modeled as a directed acyclic graph. To address these issues, we propose a revision graph extraction method based on n-gram cover that effectively find branching and revert. We evaluate the accuracy of our method by comparing with manually constructed revision graphs.

AB - During the past decade, mass collaboration systems have emerged and thrived on the World-Wide Web, with numerous user contents generated. As one of such systems, Wikipedia allows users to add and edit articles in this encyclopedic knowledge base and piles of revisions have been contributed. Wikipedia maintains a linear record of edit history with timestamp for each article, which includes precious information on how each article has evolved. However, meaningful revision evolution features like branching and revert are implicit and needed to be reconstructed. Also, existence of merges from multiple ancestors indicates that the edit history shall be modeled as a directed acyclic graph. To address these issues, we propose a revision graph extraction method based on n-gram cover that effectively find branching and revert. We evaluate the accuracy of our method by comparing with manually constructed revision graphs.

KW - Mass collaboration

KW - Wikipedia revision graph

UR - http://www.scopus.com/inward/record.url?scp=84865646189&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865646189&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-33050-6_4

DO - 10.1007/978-3-642-33050-6_4

M3 - Conference contribution

AN - SCOPUS:84865646189

SN - 9783642330490

VL - 7419 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 29

EP - 38

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -