2011
DOI: 10.1007/978-3-642-25631-8_26
|View full text |Cite
|
Sign up to set email alerts
|

A New Approach to Search Result Clustering and Labeling

Abstract: Abstract. Search engines present query results as a long ordered list of web snippets divided into several pages. Post-processing of retrieval results for easier access of desired information is an important research problem. In this paper, we present a novel search result clustering approach to split the long list of documents returned by search engines into meaningfully grouped and labeled clusters. Our method emphasizes clustering quality by using cover coefficient-based and sequential k-means clustering al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…We provide experimental results by systematically evaluating the performance of our method in the AMBIENT [7] and ODP-239 [8] test collections. We show that our method can successfully achieve both clustering and labeling tasks [19].…”
Section: Introductionmentioning
confidence: 87%
See 2 more Smart Citations
“…We provide experimental results by systematically evaluating the performance of our method in the AMBIENT [7] and ODP-239 [8] test collections. We show that our method can successfully achieve both clustering and labeling tasks [19].…”
Section: Introductionmentioning
confidence: 87%
“…Before passing to the clustering phase, we index each document using its terms that appear in the term list. The term weights are computed by using the log entropy formula [10] [19]. Entropy based term weighting considers the distribution of term over documents.…”
Section: Preprocessingmentioning
confidence: 99%
See 1 more Smart Citation
“…Authors propose a method where search result clustering is performed using cover coefficient and sequential k-means method 13 . The clusters are then labeled using term weighting.…”
Section: Related Workmentioning
confidence: 99%
“…The empirical result on various datasets used in their work like sunflower, wine, iris, ring, etc., shows the efficiency of their approach. Turel and Can (2011) introduced the cluster labelling method using cover coefficient-based and sequential k-means algorithm. Cluster labelling is done based on term weighting.…”
Section: Literature Surveymentioning
confidence: 99%