A Complex Network Approach for Evaluating Query Similarity Metrics

Rushed Kanawati

Abstract

Query similarity is a core function in many information retrieval applications. A wide variety of similarity metrics can be defined, varying from simple term-based similarities to complex document (result) based similarities. However, no clear evaluation measurement of these different query similarity functions is yet provided. In this paper we show that effective similarity functions induce scale-free -similarity graphs.

References

  1. Baeza-Yates, R. (2007). Graphs from search engine queries. SOFSEM 2007: Theory and Practice of Computer Science, pages 1-8.
  2. Baeza-Yates, R. A. (2005). Applications of Web Query Mining. In ECIR, pages 7-22.
  3. Baeza-Yates, R. A. and Ribeiro-Neto, B. A. (1999). Modern Information Retrieval. ACM Press / Addison-Wesley.
  4. Balfe, E. and Smyth, B. (2005b). An Analysis of Query Similarity in Collaborative Web Search. In ECIR, pages 330-344.
  5. Boldi, P., Bonchi, F., Castillo, C., Donato, D., Gionis, A., and Vigna, S. (2008). The queryflow graph: model and applications. In Proceeding of the 17th ACM conference on Information and knowledge management, pages 609-618. ACM.
  6. Boldi, P., Bonchi, F., Castillo, C., Donato, D., and Vigna, S. (2009). Query suggestions using query-flow graphs. Proceedings of the 2009 workshop on Web Search Click Data - WSCD 7809, pages 56-63.
  7. Borda, J. C. (1781). Mémoire sur les élections au scrutin. Comptes rendus de l'Académie des sciences, traduit par Alfred de Grazia comme Mathematical Derivation of a election system , Isis, vol 44, pp 42-51.
  8. Dong, W., Charikar, M., and Li, K. (2011). Efficient k-nearest neighbor graph construction for generic similarity measures. In WWW, pages 577-586.
  9. Dwork, C., Kumar, R., Naor, M., and Sivakumar, D. (2001). Rank aggregation methods for the Web. In WWW, pages 613-622.
  10. Guillaume, J.-L. and Latapy, M. (2006). Bipartite graphs as models of complex networks. 371, pages, 2006. Physica A, 37(1):795-813.
  11. Hosseini, M. and Abolhassani, H. (2009). Clustering Search Engine Log for Query Recommendation. Advances in Computer Science and Engineering, pages 380-387.
  12. Jiang, Q. and Sun, M. (2011). Fast query recommendation by search. In Burgard, W. and Roth, D., editors, AAAI. AAAI Press.
  13. Kanawati, R. (2008). A CBR framework for implementing community-aware web search engine. In proceedings of second international workshop on adaptive information retrieval (AIR'08), London, UK.
  14. Kanawati, R., Jaczynski, M., Trousse, B., and Anderloi, J.-M. (1999). Applying the broadway recommendation computation approach for implementing a query refinement service in the CBKB meta-search engine. In Trousse, B. and Mille, A., editors, Conférence franc¸ais sur le raisonnement à partir de cas (RàPC'99), pages 17-26, Palaiseau, France. AFIA.
  15. Krömer, P., Snásel, V., and Platos, J. (2008). Investigating Query Similarity Measures for Collaborative Web Search. In Snásel, V., Abraham, A., Saeed, K., and PokornÉ , J., editors, CISIM, pages 27-32. IEEE Computer Society.
  16. Li, L., Alderson, D., Tanaka, R., Doyle, J. C., and Willinger, W. (2005). Towards a theory of scale-free graphs: Definition, properties, and implications (extended version). CoRR, abs/cond-mat/0501169.
  17. Li, L., Gu, B.-Y., and Chen, L. (2009). The Topological Characteristics and Community Structure in Consumer-Service Bipartite Graph. In Zhou, J., editor, Complex (1), volume 4 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, pages 640-650. Springer.
  18. Rohini, U. and Varma, V. (2007). A Novel Approach for Re-Ranking of Search Results Using Collaborative Filtering. In ICCTA, pages 491-496. IEEE Computer Society.
  19. Tan, B., Shen, X., and Zhai, C. (2006). Mining long-term search history to improve search accuracy. In Eliassi-Rad, T., Ungar, L. H., Craven, M., and Gunopulos, D., editors, KDD, pages 718-723. ACM.
  20. Toussaint, G. T. (1980). The relative neighbourhood graph of a finite planar set. Pattern Recognition, 12(4):261-268.
  21. Xue, Y., Liu, Y., Zhu, T., Zhang, M., Ma, S., and Ru, L. (2010). Query recommendation considering search performance of related queries. In Cheng, P.-J., Kan, M.-Y., Lam, W., and Nakov, P., editors, AAIRS, volume 6458 of Lecture Notes in Computer Science, pages 410-419. Springer.
  22. Zezula, P., Amato, G., Dohnal, V., and Batko, M. (2006). Similarity Search: The metric Space Approach. Advanced Database Systems. Springer.
  23. Zhang, C., Wang, Y.-J., Cui, B., and Cong, G. (2008). Semantic similarity based on compact concept ontology. In Proceeding of the 17th international conference on World Wide Web - WWW 7808, page 1125, New York, New York, USA. ACM Press.
Download


Paper Citation


in Harvard Style

Kanawati R. (2013). A Complex Network Approach for Evaluating Query Similarity Metrics . In Proceedings of the 2nd International Workshop on Web Intelligence - Volume 1: WEBI, (ICEIS 2013) ISBN 978-989-8565-63-1, pages 32-41. DOI: 10.5220/0004603200320041


in Bibtex Style

@conference{webi13,
author={Rushed Kanawati},
title={A Complex Network Approach for Evaluating Query Similarity Metrics},
booktitle={Proceedings of the 2nd International Workshop on Web Intelligence - Volume 1: WEBI, (ICEIS 2013)},
year={2013},
pages={32-41},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004603200320041},
isbn={978-989-8565-63-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Workshop on Web Intelligence - Volume 1: WEBI, (ICEIS 2013)
TI - A Complex Network Approach for Evaluating Query Similarity Metrics
SN - 978-989-8565-63-1
AU - Kanawati R.
PY - 2013
SP - 32
EP - 41
DO - 10.5220/0004603200320041