IDEAS home Printed from https://ideas.repec.org/a/bla/jamist/v58y2007i12p1871-1883.html
   My bibliography  Save this article

Mining related queries from Web search engine query logs using an improved association rule mining model

Author

Listed:
  • Xiaodong Shi
  • Christopher C. Yang

Abstract

With the overwhelming volume of information, the task of finding relevant information on a given topic on the Web is becoming increasingly difficult. Web search engines hence become one of the most popular solutions available on the Web. However, it has never been easy for novice users to organize and represent their information needs using simple queries. Users have to keep modifying their input queries until they get expected results. Therefore, it is often desirable for search engines to give suggestions on related queries to users. Besides, by identifying those related queries, search engines can potentially perform optimizations on their systems, such as query expansion and file indexing. In this work we propose a method that suggests a list of related queries given an initial input query. The related queries are based in the query log of previously submitted queries by human users, which can be identified using an enhanced model of association rules. Users can utilize the suggested related queries to tune or redirect the search process. Our method not only discovers the related queries, but also ranks them according to the degree of their relatedness. Unlike many other rival techniques, it also performs reasonably well on less frequent input queries.

Suggested Citation

  • Xiaodong Shi & Christopher C. Yang, 2007. "Mining related queries from Web search engine query logs using an improved association rule mining model," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 58(12), pages 1871-1883, October.
  • Handle: RePEc:bla:jamist:v:58:y:2007:i:12:p:1871-1883
    DOI: 10.1002/asi.20632
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asi.20632
    Download Restriction: no

    File URL: https://libkey.io/10.1002/asi.20632?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jamist:v:58:y:2007:i:12:p:1871-1883. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.