Copy detection mechanisms for digital documents
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
Collection statistics for fast duplicate document detection
ACM Transactions on Information Systems (TOIS)
The Weblog Handbook: Practical Advice on Creating and Maintaining Your Blog
The Weblog Handbook: Practical Advice on Creating and Maintaining Your Blog
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Approximate String Joins in a Database (Almost) for Free
Proceedings of the 27th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Finding Near-Replicas of Documents and Servers on the Web
WebDB '98 Selected papers from the International Workshop on The World Wide Web and Databases
On the Resemblance and Containment of Documents
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Winnowing: local algorithms for document fingerprinting
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient set joins on similarity predicates
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Tracking Information Epidemics in Blogspace
WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
Similarity measures for tracking information flow
Proceedings of the 14th ACM international conference on Information and knowledge management
A Primitive Operator for Similarity Joins in Data Cleaning
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Near-duplicate detection by instance-level constrained clustering
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient exact set-similarity joins
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Scaling up all pairs similarity search
Proceedings of the 16th international conference on World Wide Web
Detecting near-duplicates for web crawling
Proceedings of the 16th international conference on World Wide Web
Finding similar files in a large file system
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Structural and temporal analysis of the blogosphere through community factorization
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
CDIP: Collection-Driven, yet Individuality-Preserving Automated Blog Tagging
ICSC '07 Proceedings of the International Conference on Semantic Computing
Efficient similarity joins for near duplicate detection
Proceedings of the 17th international conference on World Wide Web
Generating links by mining quotations
Proceedings of the nineteenth ACM conference on Hypertext and hypermedia
Probabilistic latent semantic analysis
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Shared information and program plagiarism detection
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Policy-Aware Content Reuse on the Web
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Organization and Tagging of Blog and News Entries Based on Content Reuse
Journal of Signal Processing Systems
Highlighting disputed claims on the web
Proceedings of the 19th international conference on World wide web
Automatic detection of local reuse
EC-TEL'10 Proceedings of the 5th European conference on Technology enhanced learning conference on Sustaining TEL: from innovation to learning and practice
Hypergeometric language models for republished article finding
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Automatic Moderation of Online Discussion Sites
International Journal of Electronic Commerce
: Helping in the legal use of open images
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Learning hash codes for efficient content reuse detection
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Hive open research network platform
Proceedings of the 16th International Conference on Extending Database Technology
Hi-index | 0.00 |
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.