The use of phrases and structured queries in information retrieval
SIGIR '91 Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval
WordNet: a lexical database for English
Communications of the ACM
Semantics of quotient operators in fuzzy relational databases
Fuzzy Sets and Systems
A language modeling approach to information retrieval
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Information Retrieval
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Generating, integrating, and activating thesauri for concept-based document retrieval
IEEE Expert: Intelligent Systems and Their Applications
OntoSeek: Content-Based Access to the Web
IEEE Intelligent Systems
Information Retrieval with Conceptual Graph Matching
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Semantic cores for representing documents in IR
Proceedings of the 2005 ACM symposium on Applied computing
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
An ontological representation of documents and queries for information retrieval systems
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The paper proposes an approach to information retrieval based on the use of a structure (ontology) both for document (resp. query) indexing and query evaluating. The conceptual structure is hierarchical and it encodes the knowledge of the topical domain of the considered documents. It is formally represented as a tree. In this approach, the query evaluation is based on the comparison of minimal sub-trees containing the two sets of nodes corresponding to the concepts expressed in the document and the query respectively. The comparison is based on the computation of a degree of inclusion of the query tree in the document tree. Experiments undertaken on MuchMore benchmark showed the effectiveness of the approach.