Skip to main content

Efficient Implementation of Web Search Query Reformulation Using Ant Colony Optimization

  • Conference paper
Big Data Analytics (BDA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8883))

Included in the following conference series:

Abstract

Typically, web search users submit short and ambiguous queries to search engines. As a result, users spent much time in formulating query in order to retrieve relevant information in the top ranked results. In this paper, term association graph is employed in order to provide query suggestion by assessing the linkage structure of the text graph constructed over a collection of documents. In addition to that, a biologically inspired model based on Ant Colony Optimisation (ACO) has been explored and applied over term association graph as learning process that addresses the problem of deriving optimal query suggestions. The user interactions with the search engine is treated as an individual ant’s navigation and the collective navigations of all ants over the time result in strengthening more significant paths in a term association graph which in turn used to provide query modification suggestions. We present an algorithm that attempts to select the best related keyword among all possible suggestions for an input search query and discuss its implementation based on a ternary search tree and graph data structure. We experimentally study the performance of the proposed method in comparing with different techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albakour, M.-D., Kruschwitz, U., Nanas, N., Song, D., Fasli, M., De Roeck, A.: Exploring Ant Colony Optimisation for Adaptive Interactive Search. In: Amati, G., Crestani, F. (eds.) ICTIR 2011. LNCS, vol. 6931, pp. 213–224. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Martins, B., Silva, M.J.: Spelling Correction for Search Engine Queries. In: Vicedo, J.L., MartĂ­nez-Barco, P., MuÅ„oz, R., Saiz Noeda, M. (eds.) EsTAL 2004. LNCS (LNAI), vol. 3230, pp. 372–383. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Manning, C.D., Raghavan, P., Schutze, H.: Introduction to Informa-tion Retrieval. Cambridge University Press (2008)

    Google Scholar 

  4. Carpineto, C., Romano, G.: ODP239 dataset (2009), http://credo.fub.it/odp239/

  5. Cui, H., Wen, J.-R., Nie, J.-Y., Ma, W.-Y.: Probabilistic query expansion using query logs. In: Proc. 11th Intl. Conf. on World Wide Web, pp. 325–332. ACM (2002)

    Google Scholar 

  6. Cui, H., Wen, J.-R., Nie, J.-Y., Ma, W.-Y.: Query expansion by mining user logs. IEEE Trans. Knowledge and Data Engineering 15(4), 829–839 (2003)

    Article  Google Scholar 

  7. Dignum, S., Kruschwitz, U., Fasli, M., Kim, Y., Song, D., Cervino, U., De Roeck, A.: In-corporating Seasonality into Search Suggestions Derived from Intranet Query Logs. In: Proc. IEEE/ACM Intl. Conf. Web Intelligence and Intelligent Agent Technology, pp. 425–430 (2010)

    Google Scholar 

  8. Marco, D., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  9. Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Computational Intel-ligence Magazine 1(4), 28–39 (2006)

    Article  Google Scholar 

  10. Efthimiadis, E.N.: Query Expansion. In: Williams Martha, E. (ed.) Annual Review of In-formation Systems and Technology, vol. 31, pp. 121–187. Information Today (1996)

    Google Scholar 

  11. Agichtein, E., Brill, E., Dumais, S.: Improving Web Search Ranking by In-corporating User Behavior Information. In: Proc. 29th ACM SIGIR Intl. Conf. Research and Development in Information Retrieval, pp. 19–26 (2006)

    Google Scholar 

  12. Fonseca, B.M., Golgher, P.B., de Moura, E.S., Possas, B., Ziviani, N.: Discovering search engine related queries using association rules. Journal of Web Engineering 2(4), 215–227 (2003)

    Google Scholar 

  13. Jeh, G., Widom, J.: Simrank: A Measure of Structural-Context Similarity. In: Proc. 8th ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining, pp. 538–543 (2002)

    Google Scholar 

  14. Pass, G., Chowdhury, A., Torgeson, C.: A Picture of Search. In: Proc. 1st Intl. Conf. on Scalable Information Systems (2006)

    Google Scholar 

  15. Cui, H., Wen, J.-R., Nie, J.-Y., Ma, W.-Y.: Query Expansion by Mining User Logs. IEEE Trans. Knowledge and Data Engineering 15(4), 829–839 (2003)

    Article  Google Scholar 

  16. Ma, H., King, I., Lyu, M.R.-T.: Mining Web Graphs for Recommen-dations. IEEE Trans. Knowledge and Data Engineering 24(6), 1051–1064 (2012)

    Article  Google Scholar 

  17. Jansen, B.J., Spink, A., Saracevic, T.: Real life, real users, and real needs: a study and analysis of user queries on the web. Information Processing and Management 36(2), 207–227 (2000)

    Article  Google Scholar 

  18. Kelly, D., Gyllstrom, K., Bailey, E.W.: A comparison of query and term suggestion features for interactive searching. In: Proc. SIGIR, pp. 371–378. ACM (2009)

    Google Scholar 

  19. Craswell, N., Szummer, M.: Random Walks on the Click Graph. In: Proc. 30th Annual Intl. ACM SIGIR Conf. Research and Development in Information Retrieval, pp. 239–246 (2007)

    Google Scholar 

  20. Chirita, P.-A., Firan, C.S., Nejdl, W.: Personalized Query Ex-pansion for the Web. In: Proc. 30th Intl. ACM SIGIR Conf. Research and Development in Information Retrieval, pp. 7–14 (2007)

    Google Scholar 

  21. Kraft, R., Zien, J.: Mining Anchor Text for Query Refinement. In: Proc 13th ACM Intl. Conf. World Wide Web, pp. 666–674 (2004)

    Google Scholar 

  22. Baeza-Yates, R., Tiberi, A.: Extracting Semantic Relations from Query Logs. In: Proc. 13th ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining, pp. 76–85 (2007)

    Google Scholar 

  23. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley (1999)

    Google Scholar 

  24. Jones, R., Rey, B., Madani, O., Greiner, W.: Generating Query Substi-tutions. In: Proc. 15th Intl. ACM Conf. World Wide Web, pp. 387–396 (2006)

    Google Scholar 

  25. Wang, X., Zhai, C.: Learn from Web Search Logs to Organize Search Results. In: Proc. 30th ACM SIGIR Intl. Conf. Research and Development in Information Retrieval, pp. 87–94 (2007)

    Google Scholar 

  26. Yin, Z., Shokouhi, M., Craswell, N.: Query Expansion Using External Evidence. In: Boughanem, M., Berrut, C., Mothe, J., Soule-Dupuy, C. (eds.) ECIR 2009. LNCS, vol. 5478, pp. 362–374. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Veningston, K., Shanmugalakshmi, R. (2014). Efficient Implementation of Web Search Query Reformulation Using Ant Colony Optimization. In: Srinivasa, S., Mehta, S. (eds) Big Data Analytics. BDA 2014. Lecture Notes in Computer Science, vol 8883. Springer, Cham. https://doi.org/10.1007/978-3-319-13820-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13820-6_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13819-0

  • Online ISBN: 978-3-319-13820-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics