loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ahlem Bouziri 1 ; Chiraz Latiri 2 ; Eric Gaussier 3 and Yassin Belhareth 4

Affiliations: 1 ENSI - Manouba University and LIPAH-FST, Tunisia ; 2 ISAMM-Manouba University andLIPAH, Tunisia ; 3 Université Joseph Fourrier-Laboratoire d’Informatique de Grenoble, France ; 4 ISAMM- Manouba University, Tunisia

Keyword(s): Query Expansion, Association Rules, Classification.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Information Extraction ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Mining Text and Semi-Structured Data ; Symbolic Systems

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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.229.124.236

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 (IC3K 2015) - KDIR; ISBN 978-989-758-158-8; ISSN 2184-3228, SciTePress, pages 525-530. DOI: 10.5220/0005642705250530

@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 (IC3K 2015) - KDIR},
year={2015},
pages={525-530},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005642705250530},
isbn={978-989-758-158-8},
issn={2184-3228},
}

TY - CONF

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