Article

A scalable algorithm for high-quality clustering of web snippets

Authors:

Filippo Geraci,

Marco Pellegrini,

Fabrizio SebastianiAuthors Info & Claims

SAC '06: Proceedings of the 2006 ACM symposium on Applied computing

Pages 1058 - 1062

https://doi.org/10.1145/1141277.1141527

Published: 23 April 2006 Publication History

Abstract

We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment the well-known furthest-point-first algorithm for k-center clustering in metric spaces with a filtering scheme based on the triangular inequality. We apply this algorithm to Web snippet clustering, comparing it against strong baselines consisting of recent, fast variants of the classical k-means iterative algorithm. Our main conclusion is that our method attains solutions of better or comparable accuracy, and does this within a fraction of the time required by the baselines. Our algorithm is thus valuable when, as in Web snippet clustering, either the real-time nature of the task or the large amount of data make the poorly scalable, traditional clustering methods unsuitable.

References

[1]

D. Cheng, R. Kannan, S. Vempala, and G. Wang. On a recursive spectral algorithm for clustering from pairwise similarities. Technical Report MIT-LCS-TR-906, Massachusetts Institute of Technology, Cambridge, US, 2003.

[2]

E. Di Giacomo, W. Didimo, L. Grilli, and G. Liotta. A topology-driven approach to the design of Web meta-search clustering engines. In Proceedings of SOFSEM-05, 31st Annual Conference on Current Trends in Theory and Practice of Informatics, Liptovský Ján, SK, 2005.

Digital Library

[3]

T. Feder and D. Greene. Optimal algorithms for approximate clustering. In Proceedings of STOC-88, 20th ACM Symposium on Theory of Computing, pages 434--444, Chicago, US, 1988.

Digital Library

[4]

P. Ferragina and A. Gulli. A personalized search engine based on Web-snippet hierarchical clustering. In Special Interest Tracks and Poster Proceedings of WWW-05, International Conference on the World Wide Web, pages 801--810, 2005.

Digital Library

[5]

T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38(2/3):293--306, 1985.

[6]

M. A. Hearst and J. O. Pedersen. Reexamining the cluster hypothesis: Scatter/Gather on retrieval results. In Proceedings of SIGIR-96, 19th ACM International Conference on Research and Development in Information Retrieval, pages 76--84, Zürich, CH, 1996.

Digital Library

[7]

Y. Maarek, R. Fagin, I. Ben-Shaul, and D. Pelleg. Ephemeral document clustering for Web applications. Technical Report RJ 10186, IBM, San Jose, US, 2000.

[8]

J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281--297, 1967.

[9]

S. Osinski and D. Weiss. Conceptual clustering using Lingo algorithm: Evaluation on Open Directory Project data. In Proceedings of IIPWM-04, 5th Conference on Intelligent Information Processing and Web Mining, pages 369--377, Zakopane, PL, 2004.

[10]

J. M. Peña, J. A. Lozano, and P. Larrañaga. An empirical comparison of four initialization methods for the k-means algorithm. Pattern Recognition Letters, 20(10):1027--1040, 1999.

Digital Library

[11]

S. J. Phillips. Acceleration of k-means and related clustering algorithms. In Proceedings of ALENEX-02, 4th International Workshop on Algorithm Engineering and Experiments, pages 166--177, San Francisco, US, 2002.

Digital Library

[12]

S. Selim and M. Ismail. K-means type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(1):81--87, 1984.

Digital Library

[13]

M. Steinbach, G. Karypis, and V. Kumar. A comparison of document clustering techniques. In Proceedings of the ACM KDD-00 Workshop on Text Mining, Boston, US, 2000.

[14]

A. Strehl, J. Ghosh, and R. J. Mooney. Impact of similarity measures on Web-page clustering. In Proceedings of the AAAI Workshop on AI for Web Search, pages 58--64, Austin, US, 2000.

[15]

O. Zamir and O. Etzioni. Web document clustering: A feasibility demonstration. In Proceedings of SIGIR-98, 21st ACM International Conference on Research and Development in Information Retrieval, pages 46--54, Melbourne, AU, 1998.

Digital Library

[16]

P. Zezula, G. Amato, V. Dohnal, and M. Batko. Similarity search: The metric space approach. Springer-Verlag, Heidelberg, DE, 2006. Forthcoming.

Digital Library

[17]

D. Zhang and Y. Dong. Semantic, hierarchical, online clustering of Web search results. In Proceedings of APWEB-04, 6th Asia-Pacific Web Conference, pages 69--78, Hangzhou, CN, 2004.

Cited By

Qumsiyeh RNg Y(2016)Enhancing web search by using query-based clusters and multi-document summariesKnowledge and Information Systems10.1007/s10115-015-0852-547:2(355-380)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1007/s10115-015-0852-5
Geraci FGangemi ALeonardi SPanconesi A(2015)Identification of Web Spam through Clustering of Website StructuresProceedings of the 24th International Conference on World Wide Web10.1145/2740908.2742127(1447-1452)Online publication date: 18-May-2015
https://dl.acm.org/doi/10.1145/2740908.2742127
Qumsiyeh RNg Y(2015)Clustering Retrieved Web Documents to Speed Up Web SearchesComputational Science and Its Applications -- ICCSA 201510.1007/978-3-319-21404-7_35(472-488)Online publication date: 19-Jun-2015
https://doi.org/10.1007/978-3-319-21404-7_35
Show More Cited By

Index Terms

A scalable algorithm for high-quality clustering of web snippets
1. Information systems
  1. Information retrieval

Recommendations

Web searcher interaction with the Dogpile.com metasearch engine

Metasearch engines are an intuitive method for improving the performance of Web search by increasing coverage, returning large numbers of results with a focus on relevance, and presenting alternative views of information needs. However, the use of ...
A survey of Web clustering engines

Web clustering engines organize search results by topic, thus offering a complementary view to the flat-ranked list returned by conventional search engines. In this survey, we discuss the issues that must be addressed in the development of a Web ...
Improving Web Search by Categorization, Clustering, and Personalization
ADMA '08: Proceedings of the 4th international conference on Advanced Data Mining and Applications

This research combines Web snippet categorization, clustering and personalization techniques to recommend relevant results to users. RIB --- Recommender Intelligent Browser which categorizes Web snippets using socially constructed Web directory such as ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '06: Proceedings of the 2006 ACM symposium on Applied computing

April 2006

1967 pages

ISBN:1595931082

DOI:10.1145/1141277

Conference Chair:
Hisham M. Haddad
Kennesaw State University, Kennesaw, Georgia

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 April 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC06

Sponsor:

SIGAPP

SAC06: The 2006 ACM Symposium on Applied Computing

April 23 - 27, 2006

Dijon, France

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
377
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Qumsiyeh RNg Y(2016)Enhancing web search by using query-based clusters and multi-document summariesKnowledge and Information Systems10.1007/s10115-015-0852-547:2(355-380)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1007/s10115-015-0852-5
Geraci FGangemi ALeonardi SPanconesi A(2015)Identification of Web Spam through Clustering of Website StructuresProceedings of the 24th International Conference on World Wide Web10.1145/2740908.2742127(1447-1452)Online publication date: 18-May-2015
https://dl.acm.org/doi/10.1145/2740908.2742127
Qumsiyeh RNg Y(2015)Clustering Retrieved Web Documents to Speed Up Web SearchesComputational Science and Its Applications -- ICCSA 201510.1007/978-3-319-21404-7_35(472-488)Online publication date: 19-Jun-2015
https://doi.org/10.1007/978-3-319-21404-7_35
Qumsiyeh RNg Y(2013)Enhancing Web Search Using Query-Based Clusters and LabelsProceedings of the 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 0110.1109/WI-IAT.2013.24(159-164)Online publication date: 17-Nov-2013
https://dl.acm.org/doi/10.1109/WI-IAT.2013.24
Wang QQian YSong RDou ZZhang FSakai TZheng Q(2013)Mining subtopics from text fragments for a web queryInformation Retrieval10.1007/s10791-013-9221-816:4(484-503)Online publication date: 27-Feb-2013
https://doi.org/10.1007/s10791-013-9221-8
Hanumanthappa MPrakash B(2013)Implementation of Web Search Result Clustering SystemProceedings of International Conference on Advances in Computing10.1007/978-81-322-0740-5_94(795-800)Online publication date: 2013
https://doi.org/10.1007/978-81-322-0740-5_94
Hanumanthappa MPrakash BMamatha M(2012)Improving the Efficiency of Document Clustering and Labeling Using Modified FPF AlgorithmProceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 201110.1007/978-81-322-0491-6_88(957-966)Online publication date: 2012
https://doi.org/10.1007/978-81-322-0491-6_88
Berendsen RKovachev BNastou Ede Rijke MWeerkamp W(2012)Result disambiguation in web people searchProceedings of the 34th European conference on Advances in Information Retrieval10.1007/978-3-642-28997-2_13(146-157)Online publication date: 1-Apr-2012
https://dl.acm.org/doi/10.1007/978-3-642-28997-2_13
Budinich MCodenotti BGeraci FPellegrini M(2010)On the Benefits of Keyword Spreading in Sponsored Search Auctions: An Experimental AnalysisE-Commerce and Web Technologies10.1007/978-3-642-15208-5_15(158-171)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15208-5_15
Shibata TBamba YShinzato KKurohashi S(2009)Web Information Organization Using Keyword Distillation Based ClusteringProceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 0110.1109/WI-IAT.2009.57(325-330)Online publication date: 15-Sep-2009
https://dl.acm.org/doi/10.1109/WI-IAT.2009.57
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten