Detecting near-replicas on the Web by content and hyperlink analysis

Proceedings - IEEE/WIC International Conference on Web Intelligence, WI 2003

Volumn , Issue , 2003, Pages 249-255

  Di Iorio, E ^a   Diligenti, M ^a   Gori, M ^a   Maggini, M ^a   Pucci, A ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

Algorithm design and analysis; Equations; Filtering algorithms; Information filtering; Information filters; Mirrors; Network servers; Search engines; Uniform resource locators; Web pages

Indexed keywords

HYPERTEXT SYSTEMS; MIRRORS; NETWORK SECURITY; SEARCH ENGINES; WEBSITES;

ALGORITHM DESIGN AND ANALYSIS; EQUATIONS; FILTERING ALGORITHM; HYPERLINK ANALYSIS; INFORMATION ACCESSIBILITY; NETWORK SERVER; RANDOM PROJECTIONS; RECURSIVE EQUATIONS;

INFORMATION FILTERING;

EID: 54549126001     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI.2003.1241201     Document Type: Conference Paper

References (12)

1. K. Bharat and A. Z. Broder. Mirror, mirror on the web: A study of host pairs with replicated content. In Proceedings of the 8th World Wide Web Conference (WWW8), 1999.
2. K. Bharat, A. Z. Broder, J. Dean, and M. R. Henzinger. A comparison of techniques to find mirrored hosts on the WWW. Journal of the American Society of Information Science, 51(12):1114-1122, 2000.
3. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In Proceedings of the 7th World Wide Web Conference (WWW7), 14-18 Apr. 1998.
4. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. In Selected papers from the sixth international conference on World Wide Web, pages 1157-1166. Elsevier Science Publishers Ltd., 1997.
5. J. Cho, N. Shivakumar, and H. Garcia-Molina. Finding replicated Web collections. In Proceedings of the International Conference on Management of Data, pages 355-366, 2000.
6. S. Dasgupta. Learning mixtures of gaussians. In 40th Annual Symposium on Foundations of Computer Science, pages 634-644, 1999.
7. S. Dasgupta. Experiments with random projection. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence, pages 143-151, 2000.
8. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
9. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD Conference, pages 47-57, 1984.
10. N. Shivakumar and H. Garcia-Molina. Finding near-replicas of documents on the web. In International Workshop on the World Wide Web and Databases (WebDB), 1999.
11. S. Vempala and R. I. Arriaga. An algorithmic theory of learning: robust concepts and random projection. In 40th Annual Symposium on Foundations of Computer Science, pages 616-623, 1999.
12. P. Zezula, P. Savino, G. Amato, , and F. Rabitti. Approximate similarity retrieval with m-trees. The VLDB Journal, 7(4):275-293, 1998.