Abstract
Currently, commercial search engines have implemented methods to suggest alternative Web queries to users, which helps them specify alternative related queries in pursuit of finding needed Web pages. In this paper, we address the Web search problem on related queries to improve retrieval quality by devising a novel search rank aggregation mechanism. Given an initial query and the suggested related queries, our search system concurrently processes their search result lists from an existing search engine and then forms a single list aggregated by all the retrieved lists. In particular we propose a generic rank aggregation framework which considers not only the number of wins that an item won in a competition, but also the quality of its competitor items in calculating the ranking of Web items. The framework combines the traditional and random walk based rank aggregation methods to produce a more reasonable list to users. Experimental results show that the proposed approach can clearly improve the retrieval quality in a parallel manner over the traditional search strategy that serially returns result lists. Moreover, we also empirically investigate how different rank aggregation methods affect the retrieval performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aslam, J.A., Montague, M.H.: Models for metasearch. In: Proc. of SIGIR, pp. 275–284 (2001)
Baeza-Yates, R.A., Hurtado, C.A., Mendoza, M.: Improving search engines by query clustering. JASIST 58(12), 1793–1804 (2007)
Beeferman, D., Berger, A.L.: Agglomerative clustering of a search engine query log. In: Proc. of KDD, pp. 407–416 (2000)
Bianchini, M., Gori, M., Scarselli, F.: Inside pagerank. ACM Trans. Interet Technol. 5(1), 92–128 (2005)
Borda, J.: Mémoire sur les élections au scrutin. Comptes rendus de l’Académie des sciences 44, 42–51 (1781)
Chirita, P.-A., Firan, C.S., Nejdl, W.: Personalized query expansion for the web. In: Proc. of SIGIR, pp. 7–14 (2007)
Collins-Thompson, K., Callan, J.: Query expansion using random walk models. In: Proc. of CIKM, pp. 704–711 (2005)
Copeland, A.: A reasonable social welfare function. Mimeo, University of Michigan (1951)
Cui, H., Wen, J.-R., Nie, J.-Y., Ma, W.-Y.: Query expansion by mining user logs. IEEE Trans. Knowl. Data Eng. 15(4), 829–839 (2003)
Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proc. of WWW, pp. 613–622 (2001)
Farah, M., Vanderpooten, D.: An outranking approach for rank aggregation in information retrieval. In: Proc. of SIGIR, pp. 591–598 (2007)
Fujii, A.: Modeling anchor text and classifying queries to enhance web document retrieval. In: Proceedings of WWW, pp. 337–346 (2008)
Lebanon, G., Lafferty, J.D.: Cranking: Combining rankings using conditional probability models on permutations. In: Proc. of ICML, pp. 363–370 (2002)
Li, L., Yang, Z., Liu, L., Kitsuregawa, M.: Query-url bipartite based approach to personalized query recommendation. In: Proc. of AAAI, pp. 1189–1194 (2008)
Manning, C.D., Raghavan, P., Schutze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)
Montague, M.H., Aslam, J.A.: Relevance score normalization for metasearch. In: Proc. of CIKM, pp. 427–433 (2001)
Montague, M.H., Aslam, J.A.: Condorcet fusion for improved retrieval. In: Proc. of CIKM, pp. 538–548 (2002)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)
Renda, M.E., Straccia, U.: Web metasearch: Rank vs. score based rank aggregation methods. In: Proc. of the 2003 ACM Symposium on Applied Computing (SAC 2003), pp. 841–846 (2003)
Shen, X., Tan, B., Zhai, C.: Context-sensitive information retrieval using implicit feedback. In: Proc. of SIGIR, pp. 43–50 (2005)
Shokouhi, M.: Segmentation of search engine results for effective data-fusion. In: Amati, G., Carpineto, C., Romano, G. (eds.) ECIR 2007. LNCS, vol. 4425, pp. 185–197. Springer, Heidelberg (2007)
Sun, R., Ong, C.-H., Chua, T.-S.: Mining dependency relations for query expansion in passage retrieval. In: Proc. of SIGIR, pp. 382–389 (2006)
Wen, J.-R., Nie, J.-Y., Zhang, H.: Query clustering using user logs. ACM Trans. Inf. Syst. 20(1), 59–81 (2002)
Yang, Z., Li, L., Kitsuregawa, M.: Efficient querying relaxed dominant relationship between product items based on rank aggregation. In: Proc. of AAAI, pp. 1261–1266 (2008)
Young, H.P.: Condorcet’s theory of voting. American Political Science Review 82(4), 1231–1244 (1988)
Zhang, Z., Nasraoui, O.: Mining search engine query logs for query recommendation. In: Proc. of WWW, pp. 1039–1040 (2006)
Zhu, S., Fang, Q., Deng, X., Zheng, W.: Metasearch via voting. In: Liu, J., Cheung, Y.-m., Yin, H. (eds.) IDEAL 2003. LNCS, vol. 2690, pp. 734–741. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, L., Xu, G., Zhang, Y., Kitsuregawa, M. (2009). Enhancing Web Search by Aggregating Results of Related Web Queries. In: Vossen, G., Long, D.D.E., Yu, J.X. (eds) Web Information Systems Engineering - WISE 2009. WISE 2009. Lecture Notes in Computer Science, vol 5802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04409-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-04409-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04408-3
Online ISBN: 978-3-642-04409-0
eBook Packages: Computer ScienceComputer Science (R0)