Biskri, I.; Rompré, L.: Using association rules for query reformulation (2012)
0.04
0.03807682 = product of:
0.07615364 = sum of:
0.024175718 = product of:
0.09670287 = sum of:
0.09670287 = weight(_text_:authors in 92) [ClassicSimilarity], result of:
0.09670287 = score(doc=92,freq=4.0), product of:
0.2262644 = queryWeight, product of:
4.558814 = idf(docFreq=1258, maxDocs=44218)
0.049632296 = 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.25 = coord(1/4)
0.051977925 = weight(_text_:l in 92) [ClassicSimilarity], result of:
0.051977925 = score(doc=92,freq=2.0), product of:
0.19727112 = queryWeight, product of:
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.049632296 = queryNorm
0.26348472 = fieldWeight in 92, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9746525 = idf(docFreq=2257, maxDocs=44218)
0.046875 = fieldNorm(doc=92)
0.5 = coord(2/4)
- 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.
