Concept based retrieval by minimal term sets

Ali H. Alsaffar, Jitender S. Deogun, Vijay V. Raghavan, Hayri Sever

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The problem of bridging the terminological gap between the way users prefer to specify their information needs and the way queries are formulated in terms of words or text expressions is of considerable interest. The central ideas of existing approaches based on expert systems technology were introduced in the context of a system called RUBRIC. In RUBRIC, user query topics (or concepts) are captured in a rule base and the rule base is represented as an AND/OR tree. Determining the retrieval output by evaluation of the AND/OR tree is exponential in m, where m is the maximum number of conjunctions in the DNF expression associated with a query topic. In this paper, we propose a method of computing retrieval output that involves the preprocessing of the rule base to generate what we call Minimal Term Sets (MTS) that enhances the computations needed for retrieval. The computational complexity associated with the proposed approach is polynomial in m. We also show that MTSs can provide additional advantages for the users by enabling them to (i) choose query topics that best suit their needs from among existing ones and (ii) use retrieval functions that yield more refined and controlled retrieval output than is possible with the AND/OR tree.

Original languageEnglish (US)
Title of host publicationFoundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings
EditorsZbigniew W. Raś, Zbigniew W. Raś, Andrzej Skowron
PublisherSpringer Verlag
Pages114-122
Number of pages9
ISBN (Print)354065965X, 9783540659655
DOIs
StatePublished - Jan 1 1999
Event11th International Symposium on Methodologies for Intelligent Systems, ISMIS 1999 - Warsaw, Poland
Duration: Jun 8 1999Jun 11 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1609
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Symposium on Methodologies for Intelligent Systems, ISMIS 1999
CountryPoland
CityWarsaw
Period6/8/996/11/99

Fingerprint

Expert systems
Computational complexity
Retrieval
Polynomials
Rule Base
Query
Term
Output
Expert System
Preprocessing
Computational Complexity
Choose
Concepts
Polynomial
Computing
Evaluation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Alsaffar, A. H., Deogun, J. S., Raghavan, V. V., & Sever, H. (1999). Concept based retrieval by minimal term sets. In Z. W. Raś, Z. W. Raś, & A. Skowron (Eds.), Foundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings (pp. 114-122). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1609). Springer Verlag. https://doi.org/10.1007/BFb0095096

Concept based retrieval by minimal term sets. / Alsaffar, Ali H.; Deogun, Jitender S.; Raghavan, Vijay V.; Sever, Hayri.

Foundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings. ed. / Zbigniew W. Raś; Zbigniew W. Raś; Andrzej Skowron. Springer Verlag, 1999. p. 114-122 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1609).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alsaffar, AH, Deogun, JS, Raghavan, VV & Sever, H 1999, Concept based retrieval by minimal term sets. in ZW Raś, ZW Raś & A Skowron (eds), Foundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1609, Springer Verlag, pp. 114-122, 11th International Symposium on Methodologies for Intelligent Systems, ISMIS 1999, Warsaw, Poland, 6/8/99. https://doi.org/10.1007/BFb0095096
Alsaffar AH, Deogun JS, Raghavan VV, Sever H. Concept based retrieval by minimal term sets. In Raś ZW, Raś ZW, Skowron A, editors, Foundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings. Springer Verlag. 1999. p. 114-122. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0095096
Alsaffar, Ali H. ; Deogun, Jitender S. ; Raghavan, Vijay V. ; Sever, Hayri. / Concept based retrieval by minimal term sets. Foundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings. editor / Zbigniew W. Raś ; Zbigniew W. Raś ; Andrzej Skowron. Springer Verlag, 1999. pp. 114-122 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{dff322ee066b4faf92c0e41ee0239d84,
title = "Concept based retrieval by minimal term sets",
abstract = "The problem of bridging the terminological gap between the way users prefer to specify their information needs and the way queries are formulated in terms of words or text expressions is of considerable interest. The central ideas of existing approaches based on expert systems technology were introduced in the context of a system called RUBRIC. In RUBRIC, user query topics (or concepts) are captured in a rule base and the rule base is represented as an AND/OR tree. Determining the retrieval output by evaluation of the AND/OR tree is exponential in m, where m is the maximum number of conjunctions in the DNF expression associated with a query topic. In this paper, we propose a method of computing retrieval output that involves the preprocessing of the rule base to generate what we call Minimal Term Sets (MTS) that enhances the computations needed for retrieval. The computational complexity associated with the proposed approach is polynomial in m. We also show that MTSs can provide additional advantages for the users by enabling them to (i) choose query topics that best suit their needs from among existing ones and (ii) use retrieval functions that yield more refined and controlled retrieval output than is possible with the AND/OR tree.",
author = "Alsaffar, {Ali H.} and Deogun, {Jitender S.} and Raghavan, {Vijay V.} and Hayri Sever",
year = "1999",
month = "1",
day = "1",
doi = "10.1007/BFb0095096",
language = "English (US)",
isbn = "354065965X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "114--122",
editor = "Raś, {Zbigniew W.} and Raś, {Zbigniew W.} and Andrzej Skowron",
booktitle = "Foundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings",

}

TY - GEN

T1 - Concept based retrieval by minimal term sets

AU - Alsaffar, Ali H.

AU - Deogun, Jitender S.

AU - Raghavan, Vijay V.

AU - Sever, Hayri

PY - 1999/1/1

Y1 - 1999/1/1

N2 - The problem of bridging the terminological gap between the way users prefer to specify their information needs and the way queries are formulated in terms of words or text expressions is of considerable interest. The central ideas of existing approaches based on expert systems technology were introduced in the context of a system called RUBRIC. In RUBRIC, user query topics (or concepts) are captured in a rule base and the rule base is represented as an AND/OR tree. Determining the retrieval output by evaluation of the AND/OR tree is exponential in m, where m is the maximum number of conjunctions in the DNF expression associated with a query topic. In this paper, we propose a method of computing retrieval output that involves the preprocessing of the rule base to generate what we call Minimal Term Sets (MTS) that enhances the computations needed for retrieval. The computational complexity associated with the proposed approach is polynomial in m. We also show that MTSs can provide additional advantages for the users by enabling them to (i) choose query topics that best suit their needs from among existing ones and (ii) use retrieval functions that yield more refined and controlled retrieval output than is possible with the AND/OR tree.

AB - The problem of bridging the terminological gap between the way users prefer to specify their information needs and the way queries are formulated in terms of words or text expressions is of considerable interest. The central ideas of existing approaches based on expert systems technology were introduced in the context of a system called RUBRIC. In RUBRIC, user query topics (or concepts) are captured in a rule base and the rule base is represented as an AND/OR tree. Determining the retrieval output by evaluation of the AND/OR tree is exponential in m, where m is the maximum number of conjunctions in the DNF expression associated with a query topic. In this paper, we propose a method of computing retrieval output that involves the preprocessing of the rule base to generate what we call Minimal Term Sets (MTS) that enhances the computations needed for retrieval. The computational complexity associated with the proposed approach is polynomial in m. We also show that MTSs can provide additional advantages for the users by enabling them to (i) choose query topics that best suit their needs from among existing ones and (ii) use retrieval functions that yield more refined and controlled retrieval output than is possible with the AND/OR tree.

UR - http://www.scopus.com/inward/record.url?scp=84957656741&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957656741&partnerID=8YFLogxK

U2 - 10.1007/BFb0095096

DO - 10.1007/BFb0095096

M3 - Conference contribution

AN - SCOPUS:84957656741

SN - 354065965X

SN - 9783540659655

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 114

EP - 122

BT - Foundations of Intelligent Systems - 11th International Symposium, ISMIS 1999, Proceedings

A2 - Raś, Zbigniew W.

A2 - Raś, Zbigniew W.

A2 - Skowron, Andrzej

PB - Springer Verlag

ER -