IEICE TRANSACTIONS on Information
Open Access
Revision Graph Extraction in Wikipedia Based on Supergram Decomposition and Sliding Update
-
Full Text Views
11
- Cite this
- Free PDF (1.7MB)
Summary :
As one of the popular social media that many people turn to in recent years, collaborative encyclopedia Wikipedia provides information in a more “Neutral Point of View” way than others. Towards this core principle, plenty of efforts have been put into collaborative contribution and editing. The trajectories of how such collaboration appears by revisions are valuable for group dynamics and social media research, which suggest that we should extract the underlying derivation relationships among revisions from chronologically-sorted revision history in a precise way. In this paper, we propose a revision graph extraction method based on supergram decomposition in the document collection of near-duplicates. The plain text of revisions would be measured by its frequency distribution of supergram, which is the variable-length token sequence that keeps the same through revisions. We show that this method can effectively perform the task than existing methods.
- Publication
- IEICE TRANSACTIONS on Information Vol.E97-D No.4 pp.770-778
- Publication Date
- 2014/04/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E97.D.770
- Type of Manuscript
- Special Section PAPER (Special Section on Data Engineering and Information Management)
- Category
Authors
Jianmin WU
Waseda University
Mizuho IWAIHARA
Waseda University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jianmin WU, Mizuho IWAIHARA, "Revision Graph Extraction in Wikipedia Based on Supergram Decomposition and Sliding Update" in IEICE TRANSACTIONS on Information,
vol. E97-D, no. 4, pp. 770-778, April 2014, doi: 10.1587/transinf.E97.D.770.
Abstract: As one of the popular social media that many people turn to in recent years, collaborative encyclopedia Wikipedia provides information in a more “Neutral Point of View” way than others. Towards this core principle, plenty of efforts have been put into collaborative contribution and editing. The trajectories of how such collaboration appears by revisions are valuable for group dynamics and social media research, which suggest that we should extract the underlying derivation relationships among revisions from chronologically-sorted revision history in a precise way. In this paper, we propose a revision graph extraction method based on supergram decomposition in the document collection of near-duplicates. The plain text of revisions would be measured by its frequency distribution of supergram, which is the variable-length token sequence that keeps the same through revisions. We show that this method can effectively perform the task than existing methods.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E97.D.770/_p
Copy
@ARTICLE{e97-d_4_770,
author={Jianmin WU, Mizuho IWAIHARA, },
journal={IEICE TRANSACTIONS on Information},
title={Revision Graph Extraction in Wikipedia Based on Supergram Decomposition and Sliding Update},
year={2014},
volume={E97-D},
number={4},
pages={770-778},
abstract={As one of the popular social media that many people turn to in recent years, collaborative encyclopedia Wikipedia provides information in a more “Neutral Point of View” way than others. Towards this core principle, plenty of efforts have been put into collaborative contribution and editing. The trajectories of how such collaboration appears by revisions are valuable for group dynamics and social media research, which suggest that we should extract the underlying derivation relationships among revisions from chronologically-sorted revision history in a precise way. In this paper, we propose a revision graph extraction method based on supergram decomposition in the document collection of near-duplicates. The plain text of revisions would be measured by its frequency distribution of supergram, which is the variable-length token sequence that keeps the same through revisions. We show that this method can effectively perform the task than existing methods.},
keywords={},
doi={10.1587/transinf.E97.D.770},
ISSN={1745-1361},
month={April},}
Copy
TY - JOUR
TI - Revision Graph Extraction in Wikipedia Based on Supergram Decomposition and Sliding Update
T2 - IEICE TRANSACTIONS on Information
SP - 770
EP - 778
AU - Jianmin WU
AU - Mizuho IWAIHARA
PY - 2014
DO - 10.1587/transinf.E97.D.770
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2014
AB - As one of the popular social media that many people turn to in recent years, collaborative encyclopedia Wikipedia provides information in a more “Neutral Point of View” way than others. Towards this core principle, plenty of efforts have been put into collaborative contribution and editing. The trajectories of how such collaboration appears by revisions are valuable for group dynamics and social media research, which suggest that we should extract the underlying derivation relationships among revisions from chronologically-sorted revision history in a precise way. In this paper, we propose a revision graph extraction method based on supergram decomposition in the document collection of near-duplicates. The plain text of revisions would be measured by its frequency distribution of supergram, which is the variable-length token sequence that keeps the same through revisions. We show that this method can effectively perform the task than existing methods.
ER -
English
