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 clustering engine, including acquisition and preprocessing of search results, their clustering and visualization. Search results clustering, the core of the system, has specific requirements that cannot be addressed by classical clustering algorithms. We emphasize the role played by the quality of the cluster labels as opposed to optimizing only the clustering structure. We highlight the main characteristics of a number of existing Web clustering engines and also discuss how to evaluate their retrieval performance. Some directions for future research are finally presented.

@article{Carpineto:2009:SWC:1541880.1541884, author = {Carpineto, Claudio and Osiński, Stanislaw and Romano, Giovanni and Weiss, Dawid}, title = {A survey of Web clustering engines}, journal = {ACM Comput. Surv.}, publisher = {ACM}, address = {New York, NY, USA}, year = {2009}, volume = {41}, pages = {17:1--17:38}, url = {http://doi.acm.org/10.1145/1541880.1541884}, doi = {10.1145/1541880.1541884}, issn = {0360-0300}, keywords = {clustering, bachelor:2011:bachmann, web}, abstract = {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 clustering engine, including acquisition and preprocessing of search results, their clustering and visualization. Search results clustering, the core of the system, has specific requirements that cannot be addressed by classical clustering algorithms. We emphasize the role played by the quality of the cluster labels as opposed to optimizing only the clustering structure. We highlight the main characteristics of a number of existing Web clustering engines and also discuss how to evaluate their retrieval performance. Some directions for future research are finally presented.} }

%0 = article %A = Carpineto, Claudio and Osiński, Stanislaw and Romano, Giovanni and Weiss, Dawid %C = New York, NY, USA %D = 2009 %I = ACM %T = A survey of Web clustering engines %U = http://doi.acm.org/10.1145/1541880.1541884

@book{carpineto2004concept, author = {Carpineto, Claudio and Romano, Giovanni}, title = {Concept Data Analysis: Theory and Applications}, publisher = {John Wiley & Sons}, address = {Chichester, England; Hoboken, NJ}, year = {2004}, isbn = {0470850558}, keywords = {icfca, fca, carpineto} }

%0 = book %A = Carpineto, Claudio and Romano, Giovanni %C = Chichester, England; Hoboken, NJ %D = 2004 %I = John Wiley & Sons %T = Concept Data Analysis: Theory and Applications

@book{carpineto04concept, author = {Carpineto, Claudio and Romano, Giovanni}, title = {Concept Data Analysis: Theory and Applications}, publisher = {John Wiley & Sons}, year = {2004}, url = {http://portal.acm.org/citation.cfm?id=975252&dl=acm&coll=&CFID=15151515&CFTOKEN=6184618}, isbn = {0470850558}, keywords = {concept, formal, analysis, fca} }

%0 = book %A = Carpineto, Claudio and Romano, Giovanni %D = 2004 %I = John Wiley & Sons %T = Concept Data Analysis: Theory and Applications %U = http://portal.acm.org/citation.cfm?id=975252&dl=acm&coll=&CFID=15151515&CFTOKEN=6184618

The theory of concept (or Galois) lattices provides a simple and formal approach to conceptual clustering. In this paper we present GALOIS, a system that automates and applies this theory. The algorithm utilized by GALOIS to build a concept lattice is incremental and efficient, each update being done in time at most quadratic in the number of objects in the lattice. Also, the algorithm may incorporate background information into the lattice, and through clustering, extend the scope of the theory. The application we present is concerned with information retrieval via browsing, for which we argue that concept lattices may represent major support structures. We describe a prototype user interface for browsing through the concept lattice of a document-term relation, possibly enriched with a thesaurus of terms. An experimental evaluation of the system performed on a medium-sized bibliographic database shows good retrieval performance and a significant improvement after the introduction of background knowledge.
-

@article{keyhere, author = {Carpineto, Claudio and Romano, Giovanni}, title = {A lattice conceptual clustering system and its application to browsing retrieval}, journal = {Machine Learning}, year = {1996}, volume = {24}, number = {2}, pages = {95--122}, url = {http://dx.doi.org/10.1007/BF00058654}, keywords = {information, concept, formal, clustering, ir, analysis, fca, carpineto, retrieval}, abstract = {The theory of concept (or Galois) lattices provides a simple and formal approach to conceptual clustering. In this paper we present GALOIS, a system that automates and applies this theory. The algorithm utilized by GALOIS to build a concept lattice is incremental and efficient, each update being done in time at most quadratic in the number of objects in the lattice. Also, the algorithm may incorporate background information into the lattice, and through clustering, extend the scope of the theory. The application we present is concerned with information retrieval via browsing, for which we argue that concept lattices may represent major support structures. We describe a prototype user interface for browsing through the concept lattice of a document-term relation, possibly enriched with a thesaurus of terms. An experimental evaluation of the system performed on a medium-sized bibliographic database shows good retrieval performance and a significant improvement after the introduction of background knowledge. ER -} }

%0 = article %A = Carpineto, Claudio and Romano, Giovanni %D = 1996 %T = A lattice conceptual clustering system and its application to browsing retrieval %U = http://dx.doi.org/10.1007/BF00058654