A comparative analysis on the bisecting K-means and the PDDP clustering algorithms

Intelligent Data Analysis

Volumn 8, Issue 4, 2004, Pages 345-362

  Savaresi, Sergio M ^a   Boley, Daniel L ^b  

^a POLITECNICO DI MILANO   (Italy)

^b University of Minnesota   (United States)

Author keywords

K means; principal direction divisive partitioning; unsupervised clustering

Indexed keywords

ITERATIVE METHODS;

2-DIMENSIONAL CASE; CLOSED FORM MODELING; COMPARATIVE ANALYSIS; DATA SET; DYNAMIC BEHAVIORS; K-MEANS; PRINCIPAL DIRECTION DIVISIVE PARTITIONING; UNSUPERVISED CLUSTERING;

K-MEANS CLUSTERING;

EID: 41849149791     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2004-8403     Document Type: Article

References (21)

1. T. Anderson, On estimation of parameters in latent structure analysis, Psychometrica 19 (1954), 1-10.
2. M.W. Berry, Z. Drmac, E.R. Jessup, Matrices, Vector spaces, and Information Retrieval, SIAM Review 41 (1999), 335-362.
3. D.L. Boley, Principal Direction Divisive Partitioning, Data Mining and Knowledge Discovery 2(4) (1998), 325-344.
4. D.L. Boley, M. Gini, R. Gross, S. Han, K. Hastings, G. Karypis, V. Kumar, B. Mobasher and J. Moore, Document Categorization and Query Generation on the World Wide Web Using WebACE, AI Review 11 (2000), 365-391.
5. L. Bottou, Y. Bengio, Convergence properties of the k-means algorithm, Advances in Neural Information Processing Systems, 1995.
6. C. Chute, Y. Yang An overview of statistical methods for the classification and retrieval of patient events, Meth. Inform. Med. 34 (1995), 104-110.
7. S. Deerwester, S. Dumais, G. Furnas and R. Harshman, Indexing by latent semantic analysis, J. Amer. Soc. Inform. Sci 41 (1990), 41-50.
8. E. Forgy, Cluster Analysis of Multivariate Data: Efficiency versus Interpretability of Classification, Biometrics (1965), 768-780.
9. G.H. Golub and C.F. van Loan, Matrix Computations, (3rd Ed.), The Johns Hopkins University Press, 1996.
10. E. Gose, R. Johnsonbaugh and S. Jost, Pattern Recognition & Image Analysis, Prentice-Hall, 1996.
11. D. Hand, H. Mannila and P. Smyh, Principles of Data Mining, MIT Press, 2001.
12. A.K. Jain, M.N. Murty and P.J. Flynn, Data Clustering: a Review, ACM Computing Surveys 31(3) (1999), 264-323.
13. G.N. Lance andW.T.Williams, A general theory of classificatory sorting strategies, Hierarchical systems, The Computer Journal 9 (1967), 373-380.
14. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand 45 (1950), 255-282.
15. J.P. LaSalle, The Stability and Control of Discrete Processes, Springer-Verlag, 1986.
16. S.Z. Selim and M.A. Ismail, K-means-type algorithms: a generalized convergence theorem and characterization of local optimality, IEEE Trans. on Pattern Analysis and Machine Intelligence 6(1) (1984), 81-86.
17. S.M. Savaresi, D.L. Boley, S. Bittanti and G. Gazzaniga, Cluster selection in divisive clustering algorithms, 2nd SIAM International Conference on Data Mining, Arlington, VI, USA, 2002, pp. 299-314.
18. M. Steinbach, G. Karipis and V. Kumar, A comparison of Document Clustering Techniques, Proceedings of World Text Mining Conference, KDD2000, Boston, 2000.
19. M. Vidyasagar, Nonlinear Systems Analysis, Prentice-Hall, 1993.
20. J.Z. Wang, G. Wiederhold, O. Firschein and S.X. Wei, Content-based image indexing and searching using Daubechies' wavelets, Int. J. Digit. Library 1 (1997), 311-328.
21. J.H. Ward Jr., Hierarchical groupings to optimise an objective function, Journal of the American Statistical Association 58(301) (1963), 236-244.