ACM Home Page
Please provide us with feedback. Feedback
Integration of probabilistic fact and text retrieval
Full text PdfPdf (1.16 MB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Copenhagen, Denmark
Pages: 211 - 222  
Year of Publication: 1992
ISBN:0-89791-523-2
Author
Norbert Fuhr  Universität Dortmund, Informatik VI, W-4600 Dortmund 50, Germany
Sponsors
Royal School of Lib. : Royal School of Lib.
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 29,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/133160.133202
What is a DOI?

ABSTRACT

In this paper, a model for combining text and fact retrieval is described. A query is a set of conditions, where a single condition is either a text or fact condition. Fact conditions can be interpreted as being vague, thus leading to nonbinary weights for fact conditions with respect to database objects. For text conditions, we use descriptions of the occurence of terms in documents instead of precomputed indexing weights, thus treating terms similar to attributes. Probabilistic indexing weights for conditions are computed by introducing the notion of correctness (or acceptability) of a condition w.r.t. an object. These indexing weights are used in retrieval for a probabilistic ranking of objects based on the retrieval for a probabilistic ranking of objects based on the retrieval-with-probabilistic-indexing (RPI) model, for which a new derivation is given here.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
4
5
 
6
 
7
 
8
Fuhr, N. (1991). Probabilistic Retrieval for Imprecise Queries. Report DV II 91-3, TH Darmstadt, FB Informatik, Datenverwaltungssysteme II.
 
9
Fuhr, N.; Hartmann~ S.; Knorz, G.; Lustig, G.; Schwantner, M.; Tzeras, K. (1991). AIR/X- a Rule-Based Multistage Indexing System for Large Subject Fields. in: Proceedings of lhe RIAO'91, Barcelona, Spain, April 2-5, 1991, pages 606-623.
 
10
IEEE. (1989). IEEE Data Engineering 12(2). Special Issue on Imprecision in Databases.
11
12
 
13
Prade, H.; Testemale, C. (1984). Generalizing Database Relational Algebra for the Treatment of Incomplete/Uncertain Information and Vague Queries. Information Science 3~, pages 115-143.
 
14
 
15
Raghavan, V.; Saxton, L.; Wong, S.; Ting, S. (1986). A Unified Architecture for the Integration of Data Base Management and Information Retrieval Systems. In: Kugler, H.-J. (ed.): information Processing 86, pages 1049-1054. Elsevier, Amsterdam.
 
16
 
17
 
18
 
19
 
20
 
21
Schneider, R.; Kriegel, H.-P.; Seeger, B.; Heep, S. (1989). Geometry-Based Similarity Retrieval of Rotational Parts. In" Proceedings 2nd international Conference on Data and Knowledge Systems for Manufacturing and Engineering.
 
22
Sehwarz, C. (1990). Automatic Syntactic Analysis of Free Text. Journal of 1he American Society for Information Science 41(6), pages 408-417.
23
 
24
 
25
Wong, S.; Yao, Y. (1990). Query Formulation in Linear Retrieval Models. Journal of the American Society for Information Science 41(5), pages 334-341.
26
 
27

CITED BY  12