RUBRIC: A System for Rule-Based Information Retrieval
IEEE Transactions on Software Engineering - Special issue on COMPSAC 1982 and 1983
On modeling of information retrieval concepts in vector spaces
ACM Transactions on Database Systems (TODS)
Approaches to intelligent information retrieval
Information Processing and Management: an International Journal - Artificial Intelligence and Information Retrieval
Extended Boolean query processing in the generalized vector space model
Information Systems
Generalized vector spaces model in information retrieval
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Enhancing Concept-Based Retrieval Based onMinimal Term Sets
Journal of Intelligent Information Systems - Special issue on methodologies for intelligent information systems
Extended Boolean information retrieval
Communications of the ACM
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Concept Based Retrieval by Minimal Term Sets
ISMIS '99 Proceedings of the 11th International Symposium on Foundations of Intelligent Systems
Automatic Construction of Rule-Based Trees for Conceptual Retrieval
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Using information content to evaluate semantic similarity in a taxonomy
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
One of the essential goals in information retrieval is to bridge the gap between the way users would prefer to specify their information needs and the way queries are required to be expressed. Rule Based Information Retrieval by Computer (RUBRIC) is one of the approaches proposed to achieve this goal. This approach involves the use of production rules to capture user-query concepts (or topics). In RUBRIC, a set of related production rules is represented as an AND/OR tree, or alternatively by a disjunction of Minimal Term Sets (MTSs). The retrieval output is determined by the evaluation of the weighted Boolean expressions of the AND/OR tree, and processing efficiency can be enhanced by employing MTSs. However, since the weighted Boolean expression ignores the term-term association unless it is explicitly represented in the tree, the terminological gap between users' queries and their information needs may still remain. To solve this problem, we adopt the generalized vector space model (GVSM) and the p-norm based extended Boolean model. Experiments are performed for two variations of the RUBRIC model, extended with GVSM, as well as for the integrated use of RUBRIC with the p-norm based extended Boolean model. The results are compared to the original RUBRIC model based on recall-precision.