| Efficient overlap and content reuse detection in blogs and online news articles |
| Full text |
Pdf
(2.27 MB)
|
Source
|
International World Wide Web Conference
archive
Proceedings of the 18th international conference on World wide web
table of contents
Madrid, Spain
SESSION: Data mining/session: text mining
table of contents
Pages 81-90
Year of Publication: 2009
ISBN:978-1-60558-487-4
|
|
Authors
|
|
Jong Wook Kim
|
Arizona State University, Tempe, AZ, USA
|
|
K. Selçuk Candan
|
Arizona State University, Tempe, AZ, USA
|
|
Junichi Tatemura
|
NEC Labs, America, Cupertino, CA, USA
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 47, Downloads (12 Months): 257, Citation Count: 0
|
|
|
ABSTRACT
The use of blogs to track and comment on real world (political, news, entertainment) events is growing. Similarly, as more individuals start relying on the Web as their primary information source and as more traditional media outlets try reaching consumers through alternative venues, the number of news sites on the Web is also continuously increasing. Content-reuse, whether in the form of extensive quotations or content borrowing across media outlets, is very common in blogs and news entries outlets tracking the same real-world event. Knowledge about which web entries re-use content from which others can be an effective asset when organizing these entries for presentation. On the other hand, this knowledge is not cheap to acquire: considering the size of the related space web entries, it is essential that the techniques developed for identifying re-use are fast and scalable. Furthermore, the dynamic nature of blog and news entries necessitates incremental processing for reuse detection. In this paper, we develop a novel qSign algorithm that efficiently and effectively analyze the blogosphere for quotation and reuse identification. Experiment results show that with qSign processing time gains from 10X to 100X are possible while maintaining reuse detection rates of upto 90%. Furthermore, processing time gains can be pushed multiple orders of magnitude (from 100X to 1000X) for 70% recall.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
David Sifry's Blog. http://www.sifry.com/alerts/.
|
| |
2
|
Google Blog Search. http://blogsearch.google.com blogsearch.
|
| |
3
|
Google News. http://news.google.com.
|
| |
4
|
Google Book Search. http://books.google.com/.
|
| |
5
|
Yahoo News. http://news.yahoo.com.
|
| |
6
|
The MD5 Message-Digest Algorithm. http://tools.ietf.org/html/rfc1321.
|
| |
7
|
WWW'06 Workshop on the Weblogging Ecosystem: Aggregation, Analysis and Dynamics. 2006.
|
| |
8
|
|
| |
9
|
|
 |
10
|
|
| |
11
|
|
| |
12
|
Y. Bernstein and J. Zobel. A Scalable System for Identifying Co-derivative Documents. In Proceedings of String Processing and Information Retrieval Symp, 2004.
|
| |
13
|
|
| |
14
|
|
 |
15
|
Sergey Brin , James Davis , Héctor García-Molina, Copy detection mechanisms for digital documents, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.398-409, May 22-25, 1995, San Jose, California, United States
|
| |
16
|
K. Chakrabarti, and S. Mehrotra. The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces. In ICDE, 1999.
|
| |
17
|
|
| |
18
|
X. Chen, B. Francia, M. Li, and B. Mckinnon. Shared Information and Program Plagiarism Detection. IEEE Transactions on Information Theory, 50 (7), 1545--1551, 2004.
|
 |
19
|
Yun Chi , Shenghuo Zhu , Xiaodan Song , Junichi Tatemura , Belle L. Tseng, Structural and temporal analysis of the blogosphere through community factorization, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, August 12-15, 2007, San Jose, California, USA
[doi> 10.1145/1281192.1281213]
|
| |
20
|
R. Cilibrasi, and P. Vitanyi. Clustering by compression. IEEE Transactions on Information Theory, 51(4), 1523--1545, 2005.
|
 |
21
|
|
| |
22
|
|
| |
23
|
Luis Gravano , Panagiotis G. Ipeirotis , H. V. Jagadish , Nick Koudas , S. Muthukrishnan , Divesh Srivastava, Approximate String Joins in a Database (Almost) for Free, Proceedings of the 27th International Conference on Very Large Data Bases, p.491-500, September 11-14, 2001
|
| |
24
|
N. Heintze. Scalable document fingerprinting. In USENIX Workshop on Electronic Commerce, 1996.
|
| |
25
|
T. Hofmann. Probabilistic latent semantic analysis. In Proceedings of Uncertainty in Artificial Intelligence, 1999.
|
 |
26
|
Piotr Indyk , Rajeev Motwani , Prabhakar Raghavan , Santosh Vempala, Locality-preserving hashing in multidimensional spaces, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.618-625, May 04-06, 1997, El Paso, Texas, United States
[doi> 10.1145/258533.258656]
|
 |
27
|
|
| |
28
|
|
| |
29
|
J.W. Kim, K.S. Candan, and J.Tatemura. Organization and Tagging of Blog Entries based on Content Reuse. submitted.
|
 |
30
|
|
| |
31
|
|
 |
32
|
|
 |
33
|
Donald Metzler , Yaniv Bernstein , W. Bruce Croft , Alistair Moffat , Justin Zobel, Similarity measures for tracking information flow, Proceedings of the 14th ACM international conference on Information and knowledge management, October 31-November 05, 2005, Bremen, Germany
[doi> 10.1145/1099554.1099695]
|
 |
34
|
|
 |
35
|
|
| |
36
|
N. Shivakumar and H. Garcia-Molina. SCAM: A Copy Detection Mechanism for Digital Documents. Second Annual Conference on the Theory and Practice of Digital Libraries, 1995.
|
| |
37
|
|
 |
38
|
|
 |
39
|
|
 |
40
|
|
|