Possibilistic Networks for Aggregated Search in XML Documents

Simple item page
dc.contributor.authorBessai, Fatma-Zohra
dc.date.accessioned2013-11-25T08:25:40Z
dc.date.available2013-11-25T08:25:40Z
dc.date.issued2011-04
dc.description.abstractIn this paper, we are interested in aggregated search in conten-based XML information retrieval. Our goal is to revisit the granularity of the unit to be returned. More precisely, instead of returning the whole document or a list of disjoint elements of a document, we attempt to build the best element aggregation (set of non redundant elements) which is likely to be relevant to a query. For this, we present a model for XML information retrieval, based on possibilistic networks. The network structure provides a natural manner to represent the links between, a document, its elements and its content, and allows automatically selecting relevant and complementary elements. Experiments carried out on a sub-collection of INEX (INitiative for the Evaluation of XML retrieval), showed the effectiveness of the approach.fr_FR
dc.identifier.isrnCERIST-DTISI/RR--11-000000006--dzfr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/328
dc.publisherCERIST
dc.relation.ispartofRapports de recherche internes
dc.relation.ispartofseriesRapports de recherche internes
dc.relation.placeAlger
dc.subjectXML Information Retrievalfr_FR
dc.subjectPossibilistic networkfr_FR
dc.subjectAggregated searchfr_FR
dc.subjectComplementary elementsfr_FR
dc.titlePossibilistic Networks for Aggregated Search in XML Documentsfr_FR
dc.typeTechnical Report
Files
Collections
Research Reports