Dempster-Shafer's theory of evidence applied to structured documents: modelling uncertainty
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Measures of relative relevance and ranked half-life: performance indicators for interactive IR
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Modern Information Retrieval
The Accessibility Dimension for Structured Document Retrieval
Proceedings of the 24th BCS-IRSG European Colloquium on IR Research: Advances in Information Retrieval
User Studies: Why, How, and When?
IEEE Computer Graphics and Applications
XML retrieval: what to retrieve?
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Qualitative pattern matching with linguistic terms
AI Communications - STAIRS 2002
XCluster Synopses for Structured XML Content
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Query biased snippet generation in XML search
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Novelty and diversity in information retrieval evaluation
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Possibilistic networks for information retrieval
International Journal of Approximate Reasoning
Learning to aggregate vertical results into web search results
Proceedings of the 20th ACM international conference on Information and knowledge management
Possibilistic logic bases and possibilistic graphs
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
A model for information retrieval based on possibilistic networks
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
In this paper, we are interested in content-oriented XML information retrieval which aims to retrieve not a set of relevant documents but a number of elements (parts of document) relevant to a query. 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, as it is usually done in the most XML information retrieval systems, we attempt to build the best elements aggregation (set of non-redundant elements) which is likely to be relevant to a query composed of keywords. Our approach is based on possibilistic networks. The network structure provides a natural representation of links between a document, its elements and its content, and allows an automatic selection of a combination of independent elements (i.e., set of non-redundant elements from different parts of the document tree) that better answers the user's query. Experiments carried out on a sub-collection of INEX INitiative for the evaluation of XML (INEX) retrieval, showed the effectiveness of the approach.