Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1963405.1963415acmotherconferencesArticle/Chapter ViewAbstractPublication PageswebconfConference Proceedingsconference-collections
research-article

A unified framework for recommending diverse and relevant queries

Published: 28 March 2011 Publication History
  • Get Citation Alerts
  • Abstract

    Query recommendation has been considered as an effective way to help search users in their information seeking activities. Traditional approaches mainly focused on recommending alternative queries with close search intent to the original query. However, to only take relevance into account may generate redundant recommendations to users. It is better to provide diverse as well as relevant query recommendations, so that we can cover multiple potential search intents of users and minimize the risk that users will not be satisfied. Besides, previous query recommendation approaches mostly relied on measuring the relevance or similarity between queries in the Euclidean space. However, there is no convincing evidence that the query space is Euclidean. It is more natural and reasonable to assume that the query space is a manifold. In this paper, therefore, we aim to recommend diverse and relevant queries based on the intrinsic query manifold. We propose a unified model, named manifold ranking with stop points, for query recommendation. By turning ranked queries into stop points on the query manifold, our approach can generate query recommendations by simultaneously considering both diversity and relevance in a unified way. Empirical experimental results on a large scale query log of a commercial search engine show that our approach can effectively generate highly diverse as well as closely related query recommendations.

    References

    [1]
    R. Baeza-Yates and A. Tiberi. Extracting semantic relations from query logs. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 76--85, 2007.
    [2]
    D. Beeferman and A. Berger. Agglomerative clustering of a search engine query log. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 407--416, 2000.
    [3]
    P. Boldi, F. Bonchi, C. Castillo, D. Donato, and S. Vigna. Query suggestions using query-flow graphs. In Proceedings of the 2009 workshop on Web Search Click Data, pages 56--63, 2009.
    [4]
    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 Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 875--883, 2008.
    [5]
    J. Carbonell and J. Goldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, pages 335--336, 1998.
    [6]
    C. L. Clarke, M. Kolla, G. V. Cormack, O. Vechtomova, A. Ashkan, S. Büttcher, and I. MacKinnon. Novelty and diversity in information retrieval evaluation. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pages 659--666, 2008.
    [7]
    H. Cui, J.-R. Wen, J.-Y. Nie, and W.-Y. Ma. Probabilistic query expansion using query logs. In Proceedings of the 11th international conference on World Wide Web, pages 325--332, 2002.
    [8]
    H. Deng, I. King, and M. R. Lyu. Entropy-biased models for query representation on the click graph. In Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, pages 339--346, 2009.
    [9]
    J. Guo, G. Xu, H. Li, and X. Cheng. A unified and discriminative model for query refinement. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pages 379--386, 2008.
    [10]
    J. He, M. Li, H.-J. Zhang, H. Tong, and C. Zhang. Manifold-ranking based image retrieval. In Proceedings of the 12th annual ACM international conference on Multimedia, pages 9--16, 2004.
    [11]
    K. Järvelin and J. Kekäläinen. Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst., 20(4):422--446, 2002.
    [12]
    R. Jones, B. Rey, O. Madani, and W. Greiner. Generating query substitutions. In Proceedings of the 15th international conference on World Wide Web, pages 387--396, 2006.
    [13]
    J. P. Kelly and D. Bridge. Enhancing the diversity of conversational collaborative recommendations: a comparison. Artif. Intell. Rev., 25:79--95, April 2006.
    [14]
    R. Kraft and J. Zien. Mining anchor text for query refinement. In Proceedings of the 13th international conference on World Wide Web, pages 666--674, 2004.
    [15]
    L. Li, Z. Yang, L. Liu, and M. Kitsuregawa. Query-url bipartite based approach to personalized query recommendation. In Proceedings of the 23rd national conference on Artificial intelligence, pages 1189--1194, 2008.
    [16]
    H. Ma, H. Yang, I. King, and M. R. Lyu. Learning latent semantic relations from clickthrough data for query suggestion. In Proceeding of the 17th ACM conference on Information and knowledge management, pages 709--718, 2008.
    [17]
    Q. Mei, J. Guo, and D. Radev. Divrank: the interplay of prestige and diversity in information networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1009--1018, 2010.
    [18]
    Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In Proceeding of the 17th ACM conference on Information and knowledge management, pages 469--477, 2008.
    [19]
    R. Ohbuchi and T. Shimizu. Ranking on semantic manifold for shape-based 3d model retrieval. In Proceeding of the 1st ACM international conference on Multimedia information retrieval, pages 411--418, 2008.
    [20]
    F. Radlinski, P. N. Bennett, B. Carterette, and T. Joachims. Redundancy, diversity and interdependent document relevance. SIGIR Forum, 43(2):46--52, 2009.
    [21]
    M. Theobald, R. Schenkel, and G. Weikum. Efficient and self-tuning incremental query expansion for top-k query processing. In Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, pages 242--249, 2005.
    [22]
    X. Wan, J. Yang, and J. Xiao. Manifold-ranking based topic-focused multi-document summarization. In Proceedings of the 20th international joint conference on Artifical intelligence, pages 2903--2908, 2007.
    [23]
    J.-R. Wen, J.-Y. Nie, and H.-J. Zhang. Clustering user queries of a search engine. In Proceedings of the 10th international conference on World Wide Web, pages 162--168, 2001.
    [24]
    J. Xu and W. B. Croft. Query expansion using local and global document analysis. In Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval, pages 4--11, 1996.
    [25]
    M. Zhang. Enhancing diversity in top-n recommendation. In Proceedings of the third ACM conference on Recommender systems, pages 397--400, 2009.
    [26]
    D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf. Learning with local and global consistency. In Proceedings of the 17th Annual Conference on Neural Information Processing Systems, 2003.
    [27]
    D. Zhou, J. Weston, A. Gretton, O. Bousquet, and B. Schölkopf. Ranking on data manifolds. In Proceedings of the 17th Annual Conference on Neural Information Processing Systems, 2003.
    [28]
    X. Zhu, A. B. Goldberg, J. V. Gael, and D. Andrzejewski. Improving diversity in ranking using absorbing random walks. In Proceedings North American Chapter of the Association for Computational Linguistics - Human Language Technologies (NAACL HLT), pages 97--104, 2007.

    Cited By

    View all
    • (2022)Maximum and top-k diversified biclique search at scaleThe VLDB Journal10.1007/s00778-021-00681-631:6(1365-1389)Online publication date: 18-Apr-2022
    • (2021)Diversified and Scalable Service Recommendation With Accuracy GuaranteeIEEE Transactions on Computational Social Systems10.1109/TCSS.2020.30078128:5(1182-1193)Online publication date: Oct-2021
    • (2021)Location‐Aware Keyword Query Suggestion Techniques With Artificial Intelligence PerspectiveComputational Analysis and Deep Learning for Medical Care10.1002/9781119785750.ch2(35-51)Online publication date: 13-Aug-2021
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    WWW '11: Proceedings of the 20th international conference on World wide web
    March 2011
    840 pages
    ISBN:9781450306324
    DOI:10.1145/1963405
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 28 March 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. diversity
    2. manifold ranking with stop points
    3. query recommendation

    Qualifiers

    • Research-article

    Conference

    WWW '11
    WWW '11: 20th International World Wide Web Conference
    March 28 - April 1, 2011
    Hyderabad, India

    Acceptance Rates

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

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)4
    • Downloads (Last 6 weeks)2

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Maximum and top-k diversified biclique search at scaleThe VLDB Journal10.1007/s00778-021-00681-631:6(1365-1389)Online publication date: 18-Apr-2022
    • (2021)Diversified and Scalable Service Recommendation With Accuracy GuaranteeIEEE Transactions on Computational Social Systems10.1109/TCSS.2020.30078128:5(1182-1193)Online publication date: Oct-2021
    • (2021)Location‐Aware Keyword Query Suggestion Techniques With Artificial Intelligence PerspectiveComputational Analysis and Deep Learning for Medical Care10.1002/9781119785750.ch2(35-51)Online publication date: 13-Aug-2021
    • (2020)Serendipity-based Points-of-Interest NavigationACM Transactions on Internet Technology10.1145/339119720:4(1-32)Online publication date: 1-Oct-2020
    • (2020)Research On Tag Recommendation Based on Multiple Keywords2020 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS)10.1109/ICITBS49701.2020.00204(921-926)Online publication date: Jan-2020
    • (2019)Diversity in Machine LearningIEEE Access10.1109/ACCESS.2019.29176207(64323-64350)Online publication date: 2019
    • (2018)An Approach to Effective Recommendation Considering User Preference and Diversity SimultaneouslyIEICE Transactions on Information and Systems10.1587/transinf.2017EDL8039E101.D:1(244-248)Online publication date: 2018
    • (2017)Pattern Recommendation in Task-oriented Applications: A Multi-Objective Perspective [Application Notes]IEEE Computational Intelligence Magazine10.1109/MCI.2017.270857812:3(43-53)Online publication date: Aug-2017
    • (2016)ReadMeProceedings of the 24th ACM international conference on Multimedia10.1145/2964284.2967233(312-316)Online publication date: 1-Oct-2016
    • (2016)Multi-Word Generative Query Recommendation Using Topic ModelingProceedings of the 10th ACM Conference on Recommender Systems10.1145/2959100.2959154(27-30)Online publication date: 7-Sep-2016
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media