Learning Query Expansion from Association Rules Between Terms

Ahlem Bouziri, Chiraz Latiri, Eric Gaussier, Yassin Belhareth

2015

Abstract

Query expansion technique offers an interesting solution for obtaining a complete answer to a user query while preserving the quality of retained documents. This mainly relies on an accurate choice of the added terms to an initial query. In this paper, we attempt to use data mining methods to extract dependencies between terms, namely a generic basis of association rules between terms. Face to the huge number of derived association rules and in order to select the optimal combination of query terms from the generic basis, we propose to model the problem as a classification problem and solve it using a supervised learning algorithm. For this purpose, we first generate a training set using a genetic algorithm based approach that explores the association rules space in order to find an optimal set of expansion terms, improving the MAP of the search results, we then build a model able to predict which association rules are to be used when expanding a query. The experiments were performed on SDA 95 collection, a data collection for information retrieval. The main observation is that the hybridization of textmining techniques and query expansion in an intelligent way allows us to incorporate the good features of all of them. As this is a preliminary attempt in this direction, there is a large scope for enhancing the proposed method.

References

  1. Agrawal, R. and Skirant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases, VLDB 1994, pages 478-499, Santiago, Chile.
  2. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., and Lakhal, L. (2000). Mining minimal non-redundant association rules using frequent closed itemsets. In Proceedings of the 1st International Conference on Computational Logic, volume 1861 of LNAI, pages 972- 986, London, UK. Springer-Verlag.
  3. Boughanem, M. and Tamine, L. (2000). Query optimization using an improved genetic algorithm. In Proceedings of the 2000 ACM CIKM International Conference on Information and Knowledge Management, McLean, VA, USA, November 6-11, 2000, pages 368-373.
  4. Buckley, C., Salton, G., Allan, J., and Singhal, A. (1994). Automatic Query Expansion Using SMART: TREC3. In Proceedings of the 3rd Text REtrieval Conference.
  5. Carpineto, C. and Romano, G. (2012). A survey of automatic query expansion in information retrieval. ACM Computing Surveys (CSUR), 44(1):1.
  6. Chifu, A. and Mothe, J. (2014). Expansion sélective de requeˆtes par apprentissage. In Moens, M., ViardGaudin, C., Zargayouna, H., and Terrades, O. R., editors, CORIA 2014 - Conférence en Recherche d'Infomations et Applications- 11th French Information Retrieval Conference. CIFED 2014 Colloque International Francophone sur l'Ecrit et le Document, Nancy, France, March 19-23, 2014., pages 257-272. ARIA-GRCE.
  7. Fonseca, B. M., Golgher, P. B., P oˆssas, B., Ribeiro-Neto, B. A., and Ziviani, N. (2005). Concept-based interactive query expansion. In Proceedings of the 14th International Conference on Information and Knowledge Management, CIKM 2005, pages 696-703, Bremen, Germany. ACM Press.
  8. Ganter, B. and Wille, R. (1999). Formal Concept Analysis. Springer-Verlag.
  9. Haddad, H., Chevallet, J. P., and Bruandet, M. F. (2000). Relations between terms discovered by association rules. In Proceedings of the Workshop on Machine Learning and Textual Information Access in conjunction with the 4th European Conference on Principles and Practices of Knowledge Discovery in Databases, PKDD 2000, Lyon, France.
  10. Jones, K. S., Walker, S., and Robertson, S. E. (2000). A probabilistic model of information retrieval: development and comparative experiments. Information Processing and Management, 36(6):779-840.
  11. Latiri, C., Haddad, H., and Hamrouni, T. (2012). Towards an effective automatic query expansion process using an association rule mining approach. Journal of Intelligent Information Systems, 39(1):209-247.
  12. Lin, H. C., Wang, L. H., and Chen, S. M. (2008). Query expansion for document retrieval by mining additional query terms. Information and Management Sciences, 19(1):17-30.
  13. Mitra, M., Singhal, A., and Buckley, C. (1998). Improving automatic query expansion. In Proceedings of the 21th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'98, pages 206-214, Melbourne, Australia. ACM Press.
  14. Pasquier, N., Bastide, Y., Taouil, R., Stumme, G., and Lakhal, L. (2005). Generating a condensed representation for association rules. Journal of Intelligent Information Systems, 24(1):25-60.
  15. Pragati Bhatnagar, N. P. (2015). Genetic algorithm-based query expansion for improved information retrieval. In Intelligent Computing, Communication and Devices, Advances in Intelligent Systems and Computing, volume 308, pages 47-55.
  16. Rungsawang, A., Tangpong, A., Laohawee, P., and Khampachua, T. (1999). Novel query expansion technique using apriori algorithm. In Proceedings of the 8th Text REtrieval Conference, TREC 8, pages 453-456, Gaithersburg, Maryland.
  17. Ruthven, I. and Lalmas, M. (2003). A survey on the use of relevance feedback for information access systems. Knowledge Engineering Review, 18(2):95-145.
  18. Tangpong, A. and Rungsawang, A. (2000). Applying association rules discovery in query expansion process. In Proceedings of the 4th World Multi-Conference on Systemics, Cybernetics and Informatics, SCI 2000, Orlando, Florida, USA.
  19. Xu, J. and Croft, W. B. (1996). Query expansion using local and global document analysis. In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1996, pages 4-11, Zurich, Switzerland. ACM Press.
Download


Paper Citation


in Harvard Style

Bouziri A., Latiri C., Gaussier E. and Belhareth Y. (2015). Learning Query Expansion from Association Rules Between Terms . In Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015) ISBN 978-989-758-158-8, pages 525-530. DOI: 10.5220/0005642705250530


in Bibtex Style

@conference{kdir15,
author={Ahlem Bouziri and Chiraz Latiri and Eric Gaussier and Yassin Belhareth},
title={Learning Query Expansion from Association Rules Between Terms},
booktitle={Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015)},
year={2015},
pages={525-530},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005642705250530},
isbn={978-989-758-158-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015)
TI - Learning Query Expansion from Association Rules Between Terms
SN - 978-989-758-158-8
AU - Bouziri A.
AU - Latiri C.
AU - Gaussier E.
AU - Belhareth Y.
PY - 2015
SP - 525
EP - 530
DO - 10.5220/0005642705250530