In this work we propose a method that retrieves a list of related queries given an initial input query. The related queries are based on the query log of previously issued queries by human users, which can be discovered using our improved association rule mining model. Users can use 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 exploits only limited query log information and performs relatively better on queries in all frequency divisions.
Описание
Mining related queries from search engine query logs
%0 Conference Paper
%1 Shi2006
%A Shi, Xiaodong
%A Yang, Christopher C.
%B WWW '06: Proceedings of the 15th international conference on World Wide Web
%C New York, NY, USA
%D 2006
%I ACM
%K IUI09 queries relation
%P 943--944
%R http://doi.acm.org/10.1145/1135777.1135956
%T Mining related queries from search engine query logs
%U http://portal.acm.org/citation.cfm?id=1135777.1135956&coll=Portal&dl=GUIDE&CFID=2151709&CFTOKEN=27458124
%X In this work we propose a method that retrieves a list of related queries given an initial input query. The related queries are based on the query log of previously issued queries by human users, which can be discovered using our improved association rule mining model. Users can use 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 exploits only limited query log information and performs relatively better on queries in all frequency divisions.
%@ 1-59593-323-9
@inproceedings{Shi2006,
abstract = {In this work we propose a method that retrieves a list of related queries given an initial input query. The related queries are based on the query log of previously issued queries by human users, which can be discovered using our improved association rule mining model. Users can use 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 exploits only limited query log information and performs relatively better on queries in all frequency divisions.},
added-at = {2008-09-09T12:56:45.000+0200},
address = {New York, NY, USA},
author = {Shi, Xiaodong and Yang, Christopher C.},
biburl = {https://www.bibsonomy.org/bibtex/26a1344d46a4f2ea27ffd0d8d19d943ec/chriskoerner},
booktitle = {WWW '06: Proceedings of the 15th international conference on World Wide Web},
description = {Mining related queries from search engine query logs},
doi = {http://doi.acm.org/10.1145/1135777.1135956},
interhash = {9a9ca2e207f2c5f8a800bdcc34368bbf},
intrahash = {6a1344d46a4f2ea27ffd0d8d19d943ec},
isbn = {1-59593-323-9},
keywords = {IUI09 queries relation},
location = {Edinburgh, Scotland},
pages = {943--944},
publisher = {ACM},
timestamp = {2008-09-09T12:56:45.000+0200},
title = {Mining related queries from search engine query logs},
url = {http://portal.acm.org/citation.cfm?id=1135777.1135956&coll=Portal&dl=GUIDE&CFID=2151709&CFTOKEN=27458124},
year = 2006
}