Amir, A.; Feldman, R.; Kashi, R.: ¬A new and versatile method for association generation (1997)
0.03
0.031588875 = product of:
0.06317775 = sum of:
0.06317775 = sum of:
0.013257373 = weight(_text_:a in 1270) [ClassicSimilarity], result of:
0.013257373 = score(doc=1270,freq=12.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.24964198 = fieldWeight in 1270, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0625 = fieldNorm(doc=1270)
0.04992038 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
0.04992038 = score(doc=1270,freq=2.0), product of:
0.16128273 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046056706 = queryNorm
0.30952093 = fieldWeight in 1270, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=1270)
0.5 = coord(1/2)
- Abstract
- Current algorithms for finding associations among the attributes describing data in a database have a number of shortcomings. Presents a novel method for association generation, that answers all desiderata. The method is different from all existing algorithms and especially suitable to textual databases with binary attributes. Uses subword trees for quick indexing into the required database statistics. Tests the algorithm on the Reuters-22173 database with satisfactory results
- Source
- Information systems. 22(1997) nos.5/6, S.333-347
- Type
- a
