Biskri, I.; Rompré, L.: Using association rules for query reformulation (2012)
0.00
3.4178712E-4 = product of:
0.0051268064 = sum of:
0.0051268064 = product of:
0.010253613 = sum of:
0.010253613 = weight(_text_:information in 92) [ClassicSimilarity], result of:
0.010253613 = score(doc=92,freq=6.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.20156369 = fieldWeight in 92, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.046875 = fieldNorm(doc=92)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- 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.
- Source
- Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a
