Biskri, I.; Rompré, L.: Using association rules for query reformulation (2012)
0.01
0.011432374 = sum of:
0.008923343 = product of:
0.07138675 = sum of:
0.07138675 = weight(_text_:authors in 92) [ClassicSimilarity], result of:
0.07138675 = score(doc=92,freq=4.0), product of:
0.16702999 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.03663891 = queryNorm
0.42738882 = fieldWeight in 92, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.046875 = fieldNorm(doc=92)
0.125 = coord(1/8)
0.0025090303 = product of:
0.0050180606 = sum of:
0.0050180606 = weight(_text_:e in 92) [ClassicSimilarity], result of:
0.0050180606 = score(doc=92,freq=2.0), product of:
0.05266367 = queryWeight, product of:
1.43737 = idf(docFreq=28552, maxDocs=44218)
0.03663891 = queryNorm
0.09528506 = fieldWeight in 92, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.43737 = idf(docFreq=28552, maxDocs=44218)
0.046875 = fieldNorm(doc=92)
0.5 = coord(1/2)
- Abstract
- In this paper the authors will present research on the combination of two methods of data mining: text classification and maximal association rules. Text classification has been the focus of interest of many researchers for a long time. However, the results take the form of lists of words (classes) that people often do not know what to do with. The use of maximal association rules induced a number of advantages: (1) the detection of dependencies and correlations between the relevant units of information (words) of different classes, (2) the extraction of hidden knowledge, often relevant, from a large volume of data. The authors will show how this combination can improve the process of information retrieval.
- Language
- e
