A Concept-Driven Algorithm for Clustering Search Results
IEEE Intelligent SystemsPublished 1 May 2005
Stanisław Osiński, Dawid Weiss
Citations253
SJR quartileQ1
SJR score1.33
SNIP2.01
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The Lingo algorithm combines common phrase discovery and latent semantic indexing techniques to separate search results into meaningful groups.
Abstract
Without search engines, the Internet would be an enormous amount of disorganized information that would certainly be interesting but perhaps not very useful. Search engines help us in all kinds of tasks and are constantly improving result relevance. The Lingo algorithm combines common phrase discovery and latent semantic indexing techniques to separate search results into meaningful groups. It looks for meaningful phrases to use as cluster labels and then assigns documents to the labels to form groups.
Keywords
Computer Science
Document clustering based on non-negative matrix factorization
1,847 Citations2003Wei Xu, Xin Liu +1 more
This paper proposes a novel document clustering method based on the non-negative factorization of the term-document matrix of the given document corpus that surpasses the latent semantic indexing and the spectral clustering methods not only in the easy and reliable derivation of document clustered results, but also in document clusters accuracies.
SIAM ReviewUsing Linear Algebra for Intelligent Information Retrieval
1,484 Citations1995Michael W. Berry, Susan Dumais +1 more
A lexical match between words in users’ requests and those in or assigned to documents in a database helps retrieve textual materials from scientific databases.
Reexamining the cluster hypothesis
828 Citations1996Marti A. Hearst, Jan Pedersen
This work systematically evaluates Scatter/Gather in this context and finds significant improvements over similarity search ranking alone and provides evidence validating the cluster hypothesis which states that relevant documents tend to be more similar to each other than to non-relevant documents.
Computer NetworksGrouper: a dynamic clustering interface to Web search results
716 Citations1999Oren Zamir, Oren Etzioni
This paper introduces Grouper, an interface to the results of the HuskySearch meta-search engine, which dynamically groups the search results into clusters labeled by phrases extracted from the snippets, and reports on the first empirical comparison of user Web search behavior on a standard ranked-list presentation versus a clustered presentation.
An information-theoretic external cluster-validity measure
145 Citations2002Byron Dom
A measure of clustering quality or accuracy that is appropriate in situations where it is desirable to evaluate a clustering algorithm by somehow comparing the clusters it produces with ``ground truth' consisting of classes assigned to the patterns by manual means or some other means in whose veracity there is confidence is proposed.
Lecture notes in computer scienceCarrot2 and Language Properties in Web Search Results Clustering
89 Citations2007Jerzy Stefanowski, Dawid Weiss
An open extensible research system for examination and development of search results clustering algorithms - Carrot2 is introduced and attempts to measuring quality of discovered clusters are discussed.
Conceptual Clustering Using Lingo Algorithm: Evaluation on Open Directory Project Data
73 Citations2004Stanisław Osiński, Dawid Weiss
The MiningMart system presented in this chapter focuses on setting up and re-using best practice cases of preprocessing data stored in very large databases using a metadata model named M4, which allows reuse of best practice cases published on the Internet.
Ephemeral Document Clustering for Web Applications
68 Citations2001Yoelle Maarek, Ronald Fagin +2 more
The utility of ephemeral clustering for interactive use is demonstrated through a search assistance utility that embodies these ideas, and an optimal complete-link Hierarchical Agglomerative Clustering algorithm is given, with O(n) time complexity.
MSEEC – A Multi Search Engine with Multiple Clustering
21 Citations2000Peter Hannappel, Reinhold Klapsing +2 more
A novel clustering technique that is based on the LZW compression method is presented that allows to process information with multiple cluster algorithms to present alternative clusters and the related cluster title to the user.