ACM Home Page
Please provide us with feedback. Feedback
Learn from web search logs to organize search results
Full text PdfPdf (200 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Amsterdam, The Netherlands
SESSION: Classification and clustering table of contents
Pages: 87 - 94  
Year of Publication: 2007
ISBN:978-1-59593-597-7
Authors
Xuanhui Wang  University of Illinois at Urbana-Champaign
ChengXiang Zhai  University of Illinois at Urbana-Champaign
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): ,   Downloads (12 Months): ,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1277741.1277759
What is a DOI?

ABSTRACT

Effective organization of search results is critical for improving the utility of any search engine. Clustering search results is an effective way to organize search results, which allows a user to navigate into relevant documents quickly. However, two deficiencies of this approach make it not always work well: (1) the clusters discovered do not necessarily correspond to the interesting aspects of a topic from the user's perspective; and (2) the cluster labels generated are not informative enough to allow a user to identify the right cluster. In this paper, we propose to address these two deficiencies by (1) learning "interesting aspects" of a topic from Web search logs and organizing search results accordingly; and (2) generating more meaningful cluster labels using past query words entered by users. We evaluate our proposed method on a commercial search engine log data. Compared with the traditional methods of clustering search results, our method can give better result organization and more meaningful labels.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
J. A. Aslam, E. Pelekov, and D. Rus. The star clustering algorithm for static and dynamic information organization. Journal of Graph Algorithms and Applications, 8(1):95--129, 2004.
 
3
R. A. Baeza-Yates. Applications of web query mining. In ECIR, pages 7--22, 2005.
4
5
6
7
8
9
10
 
11
T. Joachims. Evaluating Retrieval Performance Using Clickthrough Data., pages 79--96. Physica/Springer Verlag, 2003. in J. Franke and G. Nakhaeizadeh and I. Renz, "Text Mining".
12
13
 
14
Microsoft Live Labs. Accelerating search in academic research, 2006. http://research.microsoft.com/ur/us/fundingopps/RFPs/Search 2006 RFP.aspx.
15
16
 
17
18
19
 
20
 
21
 
22
Vivisimo. http://vivisimo.com/.
23
24
25
26
 
27
28

CITED BY  15

Collaborative Colleagues:
Xuanhui Wang: colleagues
ChengXiang Zhai: colleagues