Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Chow, Chao-Ming Liu (1968)
Approximating discrete probability distributions with dependence treesIEEE Trans. Inf. Theory, 14
T. Young, T. Calvert (1974)
Classification, Estimation and Pattern Recognition
D. Cox (1972)
The Analysis of Multivariate Binary DataJournal of The Royal Statistical Society Series C-applied Statistics, 21
E. Ivie (1966)
Search procedures based on measures of relatedness between documents
H. Steinhaus (1957)
The Problem of EstimationAnnals of Mathematical Statistics, 28
J. Minker, G. Wilson, B. Zimmerman (1972)
An evaluation of query expansion by the addition of clustered terms for a document retrieval systemInf. Storage Retr., 8
V. Whitney (1972)
Algorithm 422: minimal spanning tree [H]Communications of The ACM, 15
Karen Jones (1971)
Automatic keyword classification for information retrieval
J. Bentley, J. Friedman (1978)
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate SpacesIEEE Transactions on Computers, C-27
S. Robertson, Karen Jones (1976)
Relevance weighting of search termsJ. Am. Soc. Inf. Sci., 27
Gordon Hughes (1968)
On the mean accuracy of statistical pattern recognizersIEEE Trans. Inf. Theory, 14
M. Maron, J. Kuhns (1960)
On Relevance, Probabilistic Indexing and Information RetrievalJ. ACM, 7
G. Box, G. Tiao (1973)
Bayesian inference in statistical analysisInternational Statistical Review, 43
J. Gower, G. Ross (1969)
Minimum Spanning Trees and Single Linkage Cluster AnalysisJournal of The Royal Statistical Society Series C-applied Statistics, 18
H. Ku, S. Kullback (1969)
Approximating discrete probability distributionsIEEE Trans. Inf. Theory, 15
B. Hill, I. Good (1965)
The Estimation of Probabilities: An Essay on Modern Bayesian MethodsJournal of the American Statistical Association, 60
C. Craig, S. Kullback (1960)
Information Theory and StatisticsMathematics of Computation, 14
R. Duda, P. Hart (1974)
Pattern classification and scene analysis
Clement Yu, G. Salton (1976)
Precision Weighting—An Effective Automatic Indexing MethodJournal of the ACM (JACM), 23
R. Kashyap (1974)
Minimax estimation with divergence loss functionInf. Sci., 7
This paper provides a foundation for a practical way of improving the effectiveness of an automatic retrieval system. Its main concern is with the weighting of index terms as a device for increasing retrieval effectiveness. Previously index terms have been assumed to be independent for the good reason that then a very simple weighting scheme can be used. In reality index terms are most unlikely to be independent. This paper explores one way of removing the independence assumption. Instead the extent of the dependence between index terms is measured and used to construct a nonlinear weighting function. In a practical situation the values of some of the parameters of such a function must be estimated from small samples of documents. So a number of estimation rules are discussed and one in particular is recommended. Finally the feasibility of the computations required for a nonlinear weighting scheme is examined.
Journal of Documentation – Emerald Publishing
Published: Feb 1, 1977
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.