ACM Home Page
Please provide us with feedback. Feedback
Probabilistic document indexing from relevance feedback data
Full text PdfPdf (1.45 MB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Brussels, Belgium
Pages: 45 - 61  
Year of Publication: 1989
ISBN:0-89791-408-2
Authors
N. Fuhr  TH Darmstadt, Darmstadt, West Germany
C. Buckley  Cornell University, Ithaca, NY
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
U. lib de Bruxelles :
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Citation Count: 11
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/96749.98008
What is a DOI?

ABSTRACT

Based on the binary independence indexing model, we apply three new concepts for probabilistic document indexing from relevance feedback data: Abstraction from specific terms and documents, which overcomes the restriction of limited relevance information for parameter estimation. Flexibility of the representation, which allows the integration of new text analysis and knowledge-based methods in our approach as well as the consideration of more complex document structures or different types of terms (e.g. single words and noun phrases). Probabilistic learning or classification methods for the estimation of the indexing weights making better use of the available relevance information. We give experimental results for five test collections which show improvements over other indexing methods.


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
Beinke-Geiser, U.; Lustig, G.; Putze-Meier, G. (1986). Indexieren mit dem System DAISY. In: Lustig, G. (ed.) : Au#ornatische Indezierung zwischen Forschung und Anwendung, pages 73-97. Olms, Hildesheim.
2
 
3
Chow, C. K.; Liu, C. N. (1968). Approximating Discrete Probability Distributions with Dependence Trees. 1EEE Transactions on Information Theor#t 14(3), pages 462--467.
 
4
Croft, W. B. (1081). Document Representation in Probabilistic Models of Information Retrieval. Journal of the American Socie# for lnforraa#ion Science 3P, pages 451-457.
 
5
Croft, W. B. (1083). Experiments with Representation ,in a Document Retrieval System. Information Technology: Research and Development #, pages i-22.
 
6
Croft, W. 13. (1986). Boolean Queries and Term Dependencies in Probabilistic Retrieval Models. Journal of the American Society for Information Science 37(#), pages 71-77.
7
 
8
 
9
Faiflt, S. (1990). Developmen~ of Indezing Functions Based on Probabilistic Decision TPees (in German). Diploma thesis, TH Darmstadt, FB Informatik, Datenverwaltungssysteme II.
 
10
 
11
Fuhr, N. (1988). Probabilistisches lndexing nnd Retrieval. Dissertation, TH Darmstadt, Faehbereich Informatik.
 
12
13
14
15
 
16
Knorz, G. (1983). Automatisches lndezieren als Erkennen abstrakter Objekte. Niemeyer, Ttibingen.
 
17
18
19
20
 
21
 
22
Pfeifer, U. (1990). Development of Log-Linear and Linear-Iterative Indexing Functions (in German). Diploma thesis, TH Darmstadt, FB Informatik, Datenverwaltungssysteme If.
 
23
Quinlan, J. R. (1986). The Effect of Noise on Concept Learning. In: Michalski, R. S.; Carbonell, $. G.; Mitchell, T. M. (ed.) : Machine Learning: An Artificial Intelligence Approach , Vol. 11, pages 149-166. Morgan Kaufmann, Los Altos, California.
 
24
van Rijsbergen, C. J. (1977). A Theoretical Basis for the Use of Cx>-Occurrcnce Data in Information Retrieval. journal of Documentation 33, pages 106-119.
 
25
 
26
l#obertson, S. E.; Maron, M. F..; Cooper, W. S. (1982). Probability of Relevance: A Unification of Two Competing Models for Document Retrieval. Information Technology: Research and Developrnen# 1, pages 1-21.
 
27
 
28
Salton, G.; Yang, C. S.; Yu, C. T. (1975). A Theory of Term Irnportwaee in Automatic Text Analysis. Journal of the American Society for Information Science 36, pages 33--44.
29
 
30
Tietze, A. (1989). Approximation of Discrete Probability Distributions by Dependence Trees and #heir Application as lndezin# Functions (in German). Diploma thesis, TH Darmstadt, FB tnformatik, Datenverwaltungssysteme iI.
 
31
 
32
33

CITED BY  11