Can, F.: Incremental clustering for dynamic information processing (1993)
0.01
0.005054501 = product of:
0.035381503 = sum of:
0.011415146 = weight(_text_:information in 6627) [ClassicSimilarity], result of:
0.011415146 = score(doc=6627,freq=4.0), product of:
0.052020688 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.029633347 = queryNorm
0.21943474 = fieldWeight in 6627, 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=6627)
0.023966359 = weight(_text_:retrieval in 6627) [ClassicSimilarity], result of:
0.023966359 = score(doc=6627,freq=2.0), product of:
0.08963835 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.029633347 = queryNorm
0.26736724 = fieldWeight in 6627, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=6627)
0.14285715 = coord(2/14)
- Abstract
- Clustering of very large document databases is useful for both searching and browsing. The periodic updating of clusters is required due to the dynamic nature of databases. Introduces an algorithm for incremental clustering and discusses the complexity and cost of analysis of the algorithm together with an investigation of its expected behaviour. Shows through empirical testing that the algortihm achieves cost effectiveness and generates statistically valid clusters that are compatible with those of reclustering. The experimental evidence shows that the algorithm creates an effective and effecient retrieval environment
- Source
- ACM transactions on information systems. 11(1993) no.2, S.143-164
