Adeyanju, Ibrahim; Song, Dawei; Albakour, M-Dyaa; Kruschwitz, Udo; De Roeck, Anne and Fasli, Maria
Due to copyright restrictions, this file is not available for public download
Click here to request a copy from the OU Author.
|DOI (Digital Object Identifier) Link:||http://dx.doi.org/10.1145/2348283.2348288|
|Google Scholar:||Look up in Google Scholar|
A concept hierarchy created from a document collection can be used for query recommendation on Intranets by ranking terms according to the strength of their links to the query within the hierarchy. A major limitation is that this model produces the same recommendations for identical queries and rebuilding it from scratch periodically can be extremely inefficient due to the high computational costs. We propose to adapt the model by incorporating query refinements from search logs. Our intuition is that the concept hierarchy built from the collection and the search logs provide complementary conceptual views on the same search domain, and their integration should continually improve the effectiveness of recommended terms. Two adaptation approaches using query logs with and without click information are compared. We evaluate the concept hierarchy models (static and adapted versions) built from the Intranet collections of two academic institutions and compare them with a state-of-the-art log-based query recommender, the Query Flow Graph, built from the same logs. Our adaptive model significantly outperforms its static version and the query flow graph when tested over a period of time on data (documents and search logs) from two institutions’ Intranets.
|Item Type:||Conference Item|
|Copyright Holders:||2012 ACM|
August 12–16, 2012, Portland, Oregon, USA.
|Keywords:||log analysis; query suggestions; concept hierarchy|
|Academic Unit/Department:||Mathematics, Computing and Technology > Computing & Communications
Mathematics, Computing and Technology
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Dawei Song|
|Date Deposited:||21 Jun 2012 08:12|
|Last Modified:||31 Jul 2013 09:27|
|Share this page:|