Sciweavers

93
Voted
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 15 days ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar