skip to main content
10.1145/1772690.1772776acmotherconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Clustering query refinements by user intent

Published: 26 April 2010 Publication History

Abstract

We address the problem of clustering the refinements of a user search query. The clusters computed by our proposed algorithm can be used to improve the selection and placement of the query suggestions proposed by a search engine, and can also serve to summarize the different aspects of information relevant to the original user query. Our algorithm clusters refinements based on their likely underlying user intents by combining document click and session co-occurrence information. At its core, our algorithm operates by performing multiple random walks on a Markov graph that approximates user search behavior. A user study performed on top search engine queries shows that our clusters are rated better than corresponding clusters computed using approaches that use only document click or only sessions co-occurrence information.

References

[1]
N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In STOC '05.
[2]
P. Anick. Using terminological feedback for web search refinement: a log-based study. In SIGIR '03.
[3]
R. Baeza-Yates, C. Hurtado, and M. Mendoza. Query recommendation using query logs in search engines. In International Workshop on Clustering Information over the Web - EDBT 2004.
[4]
N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56(1-3), 2004.
[5]
D. Beeferman and A. Berger. Agglomerative clustering of a search engine query log. In KDD '00.
[6]
B. Billerbeck, F. Scholer, H. E. Williams, and J. Zobel. Query expansion using associated queries. In CIKM '03.
[7]
P. Boldi, F. Bonchi, C. Castillo, D. Donato, A. Gionis, and S. Vigna. The query-flow graph: model and applications. In CIKM '08.
[8]
H. Cao, D. Jiang, J. Pei, Q. He, Z. Liao, E. Chen, and H. Li. Context-aware query suggestion by mining click-through and session data. In KDD '08.
[9]
S. Chien and N. Immorlica. Semantic similarity between search engine queries using temporal correlation. In WWW '05.
[10]
N. Craswell and M. Szummer. Random walks on the click graph. In SIGIR '07.
[11]
S. Cucerzan and E. Brill. Extracting semantically related queries by exploiting user session information. Technical report, Microsoft Research, 2005.
[12]
H. Cui, J.-R. Wen, J.-Y. Nie, and W.-Y. Ma. Probabilistic query expansion using query logs. In WWW '02.
[13]
B. M. Fonseca, P. Golgher, B. Possas, B. Ribeiro-Neto, and N. Ziviani. Concept-based interactive query expansion. In CIKM '05.
[14]
O. Goldschmidt and D. S. Hochbaum. Polynomial algorithm for the k-cut problem. In SFCS '88.
[15]
Q. He, D. Jiang, Z. Liao, S. C. H. Hoi, K. Chang, E.-P. Lim, and H. Li. Web query recommendation via sequential query prediction. In ICDE '09.
[16]
C.-K. Huang, L.-F. Chien, and Y.-J. Oyang. Relevant term suggestion in interactive web search based on contextual information in query session logs. J. Am. Soc. Inf. Sci. Technol., 54(7), 2003.
[17]
A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Comput. Surv., 31(3), 1999.
[18]
Kosmix. http://kosmix.com.
[19]
C. D. Manning, P. Raghavan, and H. Schtze. Introduction to Information Retrieval. Cambridge University Press, 2008.
[20]
Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In CIKM '08.
[21]
H. Saran and V. V. Vazirani. Finding k-cuts within twice the optimal. In SFCS '91.
[22]
Search evaluation at Google. http://googleblog.blogspot.com/2008/09/search-evaluation-at-google.html.
[23]
M. Steyvers and T. Griffiths. Handbook of Latent Semantic Analysis. Lawrence Erlbaum Associates, 2007.
[24]
H. Taylor and S. Karlin. An introduction to stochastic modeling. Academic Press, 3rd ed edition, 1994.
[25]
X. Wang, D. Chakrabarti, and K. Punera. Mining broad latent query aspects from search sessions. In KDD '09.
[26]
J.-R. Wen, J.-Y. Nie, and H.-J. Zhang. Clustering user queries of a search engine. In WWW '01.
[27]
Z. Zhang and O. Nasraoui. Mining search engine query logs for query recommendation. In WWW '06.

Cited By

View all
  • (2023)Predictive Behavior Modeling Through Web Graphs: Enhancing Next Page Prediction Using Dynamic Link Repository2023 IEEE International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)10.1109/WI-IAT59888.2023.00068(415-420)Online publication date: 26-Oct-2023
  • (2023)trie-nlg: trie context augmentation to improve personalized query auto-completion for short and unseen prefixesData Mining and Knowledge Discovery10.1007/s10618-023-00966-037:6(2306-2329)Online publication date: 7-Aug-2023
  • (2022)Personalized Query Suggestion with Searching Dynamic Flow for Online RecruitmentProceedings of the 31st ACM International Conference on Information & Knowledge Management10.1145/3511808.3557416(2773-2783)Online publication date: 17-Oct-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
WWW '10: Proceedings of the 19th international conference on World wide web
April 2010
1407 pages
ISBN:9781605587998
DOI:10.1145/1772690

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 April 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. clustering
  2. query refinements
  3. random walks

Qualifiers

  • Research-article

Conference

WWW '10
WWW '10: The 19th International World Wide Web Conference
April 26 - 30, 2010
North Carolina, Raleigh, USA

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)11
  • Downloads (Last 6 weeks)2
Reflects downloads up to 01 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Predictive Behavior Modeling Through Web Graphs: Enhancing Next Page Prediction Using Dynamic Link Repository2023 IEEE International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)10.1109/WI-IAT59888.2023.00068(415-420)Online publication date: 26-Oct-2023
  • (2023)trie-nlg: trie context augmentation to improve personalized query auto-completion for short and unseen prefixesData Mining and Knowledge Discovery10.1007/s10618-023-00966-037:6(2306-2329)Online publication date: 7-Aug-2023
  • (2022)Personalized Query Suggestion with Searching Dynamic Flow for Online RecruitmentProceedings of the 31st ACM International Conference on Information & Knowledge Management10.1145/3511808.3557416(2773-2783)Online publication date: 17-Oct-2022
  • (2021)On the Study of Transformers for Query SuggestionACM Transactions on Information Systems10.1145/347056240:1(1-27)Online publication date: 15-Oct-2021
  • (2021)To Reuse or Not To Reuse?Proceedings of the ACM on Human-Computer Interaction10.1145/34492405:CSCW1(1-35)Online publication date: 22-Apr-2021
  • (2021)Dataset of Natural Language Queries for E-CommerceProceedings of the 2021 Conference on Human Information Interaction and Retrieval10.1145/3406522.3446043(307-311)Online publication date: 14-Mar-2021
  • (2021)Burstiness-Aware Web Search Analysis on Different Levels of EvidencesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2021.3109304(1-1)Online publication date: 2021
  • (2021)A Framework for Comparative Analysis of Intention Mining ApproachesResearch Challenges in Information Science10.1007/978-3-030-75018-3_2(20-37)Online publication date: 8-May-2021
  • (2020)A New Approach of a List of Items for Search Retrieval SystemsAdvanced Intelligent Systems for Sustainable Development (AI2SD’2019)10.1007/978-3-030-36674-2_6(53-66)Online publication date: 6-Feb-2020
  • (2020)Interactive faceted query suggestion for exploratory searchJournal of the Association for Information Science and Technology10.1002/asi.2430471:7(742-756)Online publication date: 8-Jun-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

EPUB

View this article in ePub.

ePub

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media