Park, Y.C.; Choi, K.-S.: Automatic thesaurus construction using Bayesian networks (1996)
0.00
0.0033653039 = product of:
0.013461215 = sum of:
0.013461215 = weight(_text_:information in 6581) [ClassicSimilarity], result of:
0.013461215 = score(doc=6581,freq=4.0), product of:
0.06134496 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.034944877 = queryNorm
0.21943474 = fieldWeight in 6581, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=6581)
0.25 = coord(1/4)
- Abstract
- Automatic thesaurus construction is accomplished by extracting term relations mechanically. A popular method uses statistical analysis to discover the term relations. For low frequency terms the statistical information of the terms cannot be reliably used for deciding the relationship of terms. This problem is referred to as the data sparseness problem. Many studies have shown that low frequency terms are of most use in thesaurus construction. Characterizes the statistical behaviour of terms by using an inference network. Develops a formal approach using a Baysian network for the data sparseness problem
- Source
- Information processing and management. 32(1996) no.5, S.543-553
