Efficient clustering of high-dimensional data sets with application to reference matching
Top Cited Papers
- 1 August 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 169-178
- https://doi.org/10.1145/347090.347123
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Automating the Construction of Internet Portals with Machine LearningInformation Retrieval Journal, 2000
- Deterministic annealing for clustering, compression, classification, regression, and related optimization problemsProceedings of the IEEE, 1998
- CiteSeerPublished by Association for Computing Machinery (ACM) ,1998
- BIRCHPublished by Association for Computing Machinery (ACM) ,1996
- The merge/purge problem for large databasesPublished by Association for Computing Machinery (ACM) ,1995
- Term-weighting approaches in automatic text retrievalInformation Processing & Management, 1988
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- A Theory for Record LinkageJournal of the American Statistical Association, 1969
- Automatic Linkage of Vital RecordsScience, 1959