Maxdiff kd-trees for data condensation

Pattern Recognition Letters

Volumn 27, Issue 3, 2006, Pages 187-200

  Narayan, B L ^a   Murthy, C A ^a   Pal, Sankar K ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Data representation; Multiresolution kd trees; Prototype selection

Indexed keywords

ALGORITHMS; DATA REDUCTION; PROBLEM SOLVING; SET THEORY; SOFTWARE PROTOTYPING;

DATA CONDENSATION; DATA REPRESENTATION; MULTIRESOLUTION KD-TREES; PROTOTYPE SELECTION;

TREES (MATHEMATICS);

EID: 28044469490     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2005.08.015     Document Type: Article

References (21)

1. M. Balakrishnan, W.A. Pearlman, and L. Lu Variable-rate tree-structured vector quantizers IEEE Trans. Inform. Theory 41 4 1995 917 930 July
2. L. Breiman Arcing classifiers Ann. Statist. 26 3 1998 801 849
3. D.S. Broomhead, and D. Lowe Multivariable functional interpolation and adaptive networks Complex Syst. 2 1988 321 355
4. Catlett, J., 1991. Megainduction: Machine learning on very large databases. Ph.D. thesis, Department of Computer Science, University of Sydney, Australia.
5. A. Cuevas, M. Febrero, and R. Fraiman Estimating the number of clusters Canad. J. Statist. 28 2 2000 367 382
6. C. Decaestecker Finding prototypes for nearest neighbour classification by means of gradient descent and deterministic annealing Pattern Recognition 30 2 1997 281 288
7. J.H. Friedman, J.L. Bentley, and R.A. Finkel An algorithm for finding best matches in logarithmic expected time ACM Trans. Math. Software 3 3 1997 209 226
8. K. Fukunaga Introduction to Statistical Pattern Recognition second ed. 1990 Academic Press
9. S. Guha, R. Rastogi, and K. Shim Cure: An efficient clustering algorithm for large databases Inform. Syst. 26 1 2001 35 58
10. P.E. Hart The condensed nearest neighbor rule IEEE Trans. Inform. Theory 14 1968 515 516
11. T. Kanungo, D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu An efficient k-means clustering algorithm: Analysis and implementation IEEE Trans. PAMI 24 7 2002 881 892
12. G. Karypis, E.H. Han, and V. Kumar Chameleon: A hierarchical clustering algorithm using dynamic modeling IEEE Comput. 32 8 1999 68 75
13. Moore, A.W., 1999. Very fast EM-based mixture model clustering using multiresolution kd-trees. In: Proc. Neural Information Processing Systems Conf., pp. 543-549.
14. A.W. Moore, and M.S. Lee Cached sufficient statistics for efficient machine learning with large datasets J. Artif. Intell. Res. 8 1998 67 91
15. Poosala, V., 1997. Histogram-based estimation techniques in databases. PhD Thesis, University of Wisconsin, Madison.
16. F.J. Provost, and V. Kolluri A survey of methods for scaling up inductive algorithms Data Min. Knowl. Disc. 3 2 1999 131 169
17. J.S. Sanchez, F. Pla, and F.J. Ferri Prototype selection for the nearest neighbour rule through proximity graphs Pattern Recogition Lett. 18 6 1997 507 513
18. Wang, W., Yang, J., Muntz, R., 1997. Sting: A statistical information grid approach to spatial data mining. In: Proc. 23rd Internat. Conf. on Very Large Data Bases, Athens, Greece, pp. 186-195.
19. Zhang, T., Ramakrishnan, R., Livny, M., 1996. Birch: An efficient data clustering method for very large databases. In: Proc. ACM SIGMOD Conf. on Management of Data, Montreal, Canada, pp. 103-114.
20. Zhao, Y., Karypis, G., 2001. Criterion functions for document clustering: Experiments and analysis. Technical Report 01-40, Department of Computer Science, University of Minnesota, Minneapolis, MN.
21. Zhao, Y., Karypis, G., 2002. Evaluation of hierarchical clustering algorithms for document datasets. In: CIKM '02, Proc. 11th Internat. Conf. on Information and Knowledge Management, pp. 515-524.