Randomized algorithms
Copy detection mechanisms for digital documents
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Building a scalable and accurate copy detection mechanism
Proceedings of the first ACM international conference on Digital libraries
Min-wise independent permutations (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Syntactic clustering of the Web
Selected papers from the sixth international conference on World Wide Web
A technique for measuring the relative size and overlap of public Web search engines
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Automatic web search query generation to create minority language corpora
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Concrete Math
Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
On the Resemblance and Containment of Documents
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Finding near-duplicate web pages: a large-scale evaluation of algorithms
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Estimating corpus size via queries
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Detecting near-duplicates for web crawling
Proceedings of the 16th international conference on World Wide Web
Designing efficient sampling techniques to detect webpage updates
Proceedings of the 16th international conference on World Wide Web
Random sampling from a search engine's index
Journal of the ACM (JACM)
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Retrieving similar documents from the web
Journal of Web Engineering
An algorithmic treatment of strong queries
Proceedings of the fourth ACM international conference on Web search and data mining
A source independent framework for research paper recommendation
Proceedings of the 11th annual international ACM/IEEE joint conference on Digital libraries
Normal distribution re-weighting for personalized web search
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
Candidate document retrieval for web-scale text reuse detection
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
A Luhn-Inspired Vector Re-weighting Approach for Improving Personalized Web Search
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
| Hi-index | 0.00 |
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of the document. This problem has applications in search engines for competitive coverage testing. To solve this problem, we propose approaches that work in three main steps: generate a query signature from the document, query the corpus using the query signature and scrape the returned results, and validate the similarity between the input document and the returned results. We discuss techniques to control and bound the performance of these methods. We perform large-scale experimental validation and show that these methods perform well across different search engine corpora and documents in multiple languages. They also are robust against performance parameter variations.