Enhancing principal direction divisive clustering

Pattern Recognition

Volumn 43, Issue 10, 2010, Pages 3391-3411

  Tasoulis, S K ^a   Tasoulis, D K ^b   Plagianakos, V P ^a  

^a UNIVERSITY OF CENTRAL GREECE   (Greece)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Clustering; Kernel density estimation; Principal component analysis

Indexed keywords

CLUSTERING; CLUSTERING TECHNIQUES; DATA CLUSTERING; DATA DIMENSIONALITY; DATA SETS; DIVISIVE CLUSTERING; KERNEL DENSITY ESTIMATION; NUMBER OF CLUSTERS; PRINCIPAL COMPONENTS; PRINCIPAL DIRECTIONS; USER-DEFINED PARAMETERS;

APPROXIMATION ALGORITHMS; CLUSTER ANALYSIS; PRINCIPAL COMPONENT ANALYSIS;

CLUSTERING ALGORITHMS;

EID: 77953622289     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2010.05.025     Document Type: Article

References (54)

1. Tryon C. Cluster Analysis (1939), Edward Brothers, Ann Arbor, MI
2. M. Steinbach, G. Karypis, V. Kumar, A comparison of document clustering techniques, in: KDD Workshop on Text Mining, 2000.
3. Hartigan J., and Wong M. A k-means clustering algorithm. Applied Statistics 28 (1979) 100-108
4. Dhillon I.S., and Modha D.S. Concept decompositions for large sparse text data using clustering. Machine Learning 42 1 (2001) 143-175
5. McLachlan G., and Basford K. Mixture Models: Inference and Applications to Clustering (1988), Marcel Dekker
6. Sander J., Ester M., Kriegel H.-P., and Xu X. Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery 2 2 (1998) 169-194
7. Bellman R. Adaptive Control Processes: A Guided Tour (1961), Princeton University Press, Princeton, NJ
8. M. Steinbach, L. Ertöz, V. Kumar, The challenges of clustering high dimensional data, New Vistas in Statistical Physics: Applications in Econophysics, Bioinformatics, and Pattern Recognition, 2003.
9. Beyer K.S., Goldstein J., Ramakrishnan R., and Shaft U. When is "nearest neighbor" meaningful. Seventh International Conference on Database Theory (1999) 217-235
10. A.K. Jain, R.C. Dubes, Algorithms for Clustering Data, Prentice Hall, New Jersey, 1988.
11. Lax P.D. Linear Algebra and its Applications (2007), Wiley-Interscience, New York, USA
12. Boley D. Principal direction divisive partitioning. Data Mining and Knowledge Discovery 2 4 (1998) 325-344
13. Deerwester S., Dumais S., Furnas G., Landauer T., and Harshman R. Indexing by latent semantic analysis. Journal of the American Society for Information Science 41 6 (1990) 391-407
14. Chute C., and Yang Y. An overview of statistical methods for the classification and retrieval of patient events. Methods of Information in Medicine 34 1-2 (1995) 104-110
15. S. Tasoulis, D. Tasoulis, Improving principal direction divisive clustering, in: 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008), Workshop on Data Mining using Matrices and Tensors, Las Vegas, USA, 2008.
16. D. Zeimpekis, E. Gallopoulos, PDDP(l): towards a flexing principal direction divisive partitioning clustering algorithms, in: D. Boley, I. Dhillon, J. Ghosh, J. Kogan (Eds.), Proceedings of the IEEE ICDM '03 Workshop on Clustering Large Data Sets, Melbourne, FL, 2003, pp. 26-35.
17. I.S. Dhillon, Co-clustering documents and words using bipartite spectral graph partitioning, in: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge discovery and data mining, ACM New York, NY, USA, 2001, pp. 269-274.
18. I. Dhillon, J. Kogan, C. Nicholas, Feature selection and document clustering, in: A Comprehensive Survey of Text Mining, 2003, pp. 73-100.
19. Nilsson M. Hierarchical clustering using non-greedy principal direction divisive partitioning. Information Retrieval 5 4 (2002) 311-321
20. Zeimpekis D., and Gallopoulos E. Principal direction divisive partitioning with kernels and k-means steering. Survey of Text Mining II: Clustering, Classification, and Retrieval (2007) 45-64
21. Guyon I., von Luxburg U., and Williamson R. Clustering: science or art?. NIPS Workshop on Clustering Theory (2009)
22. Wand M.P., and Jones M.C. Kernel Smoothing (1995), Chapman & Hall/CRC, Florida, USA
23. B.A. Turlach, Bandwidth selection in kernel density estimation: a review, in: CORE and Institut de Statistique, 1993, pp. 23-493.
24. Sarda P. Smoothing parameter selection for smooth distribution functions. Journal of Statistical Planning and Inference 35 1 (1993) 65-75
25. Altman N., and Léger C. Bandwidth selection for kernel distribution function estimation. Journal of Statistical Planning and Inference 46 2 (1995) 195-214
26. B.E. Hansen, Bandwidth selection for nonparametric distribution estimation, Ph.D. Thesis, University of Wisconsin, manuscript, 2004.
27. Theodoridis S., and Koutroumbas K. Pattern Recognition (2006), Academic Press, San Diego, USA
28. Ball G.H., and Hall D.J. A clustering technique for summarizing multivariate data. Behavioral Science 12 (1967) 153-155
29. Biernacki C., Celeux G., and Govaert G. Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Transactions on Pattern Analysis and Machine Intelligence 22 7 (2000) 719-725
30. Feng Y., Hamerly G., and Elkan C. PG-means: learning the number of clusters in data. Advances in Neural Information Processing Systems 19 (2007) 393
31. Pelleg D., and Moore A. X-means: extending k-means with efficient estimation of the number of clusters. Proceedings of the 17th International Conference on Machine Learning (2000) 727-734
32. Zhang T., Ramakrishnan R., and Livny M. Birch: an efficient data clustering method for very large databases. ACM SIGMOD International Conference on Management of Data (1996) 103-114
33. S. Guha, R. Rastogi, K. Shim, CURE: an efficient algorithm for clustering large databases, in: Proceedings of ACM-SIGMOD 1998 International Conference on Management of Data, Seattle, 1998, pp. 73-84.
34. Karypis G., Han E., and Kumar V. CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. IEEE Computer 32 8 (1999) 68-75
35. Hinneburg A., and Keim D. Optimal grid-clustering: towards breaking the curse of dimensionality in high-dimensional clustering. Proceedings of the 25th International Conference on Very Large Data Bases (1999) 506-517
36. Agrawal R., Gehrke J., Gunopulos D., and Raghavan P. Automatic subspace clustering of high dimensional data. Data Mining and Knowledge Discovery 11 1 (2005) 5-33
37. Kruengkrai C., Sornlertlamvanich V., and Isahara H. Refining a divisive partitioning algorithm for unsupervised clustering. Proceedings of the Third International Conference on Hybrid Intelligent Systems (2003) 535-542
38. Young D. The linear nearest neighbour statistic. Biometrica 69 2 (1982) 477-480
39. Yang C., Duraiswami R., Gumerov N.A., and Davis L. Improved fast gauss transform and efficient kernel density estimation. Proceedings of Ninth IEEE International Conference on Computer Vision (2003) 664-671
40. Greengard L., and Strain J. The fast gauss transform. SIAM Journal on Scientific and Statistical Computing 12 1 (1991) 79-94
41. Berkhin P. A survey of clustering data mining techniques. In: Kogan J., Nicholas C., and Teboulle M. (Eds). Grouping Multidimensional Data: Recent Advances in Clustering (2006), Springer, Berlin 25-72
42. Kogan J. Introduction to Clustering Large and High-Dimensional Data (2007), Cambridge University Press, New York, USA
43. Rosenberg A., and Hirschberg J. V-measure: a conditional entropy-based external cluster evaluation measure. 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL) (2007) 410-420
44. C. Blake, C. Merz, UCI repository of machine learning databases, University of California, School of Information and Computer Science, Irvine, CA, 1998.
45. Tasoulis D.K., and Vrahatis M.N. Generalizing the k-Windows clustering algorithm in metric spaces. Mathematical and Computer Modelling 46 1-2 (2007) 268-277
46. Huang Z. Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery 2 3 (1998) 283-304
47. Fisher D.H. Knowledge acquisition via incremental conceptual clustering. Machine Learning 2 2 (1987) 139-172
48. Michalski R.S., and Stepp R.E. Automated construction of classifications: conceptual clustering versus numerical taxonomy. IEEE Transactions on Pattern Analysis and Machine Intelligence 5 4 (1983) 396-409
49. R.J. Alcock, Y. Manolopoulos, Time-series similarity queries employing a feature-based approach, in: Seventh Hellenic Conference on Informatics, Ioannina, Greece, 1999.
50. Alon U., Barkai N., Notterman D., Gish K., Ybarra S., Mack D., and Levine A. Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide array. Proceedings of the National Academy of Sciences USA 96 12 (1999) 6745-6750
51. Alizadeh A.A., Eisen M.B., Davis R.E., Ma C., Lossos I.S., Rosenwald A., Boldrick J.C., Sabet H., Tran T., and Yu X. Distinct types of diffuse large b-cell lymphoma identified by gene expression profiling. Nature 403 (2000) 503-511
52. Singh D., Febbo P.G., Ross K., Jackson D.G., Manola J., Ladd C., Tamayo P., Renshaw A.A., D'Amico A.V., and Richie J.P. Gene expression correlates of clinical prostate cancer behavior. Cancer Cell 1 2 (2002) 203-209
53. Yeoh E.J., Ross M.E., Shurtleff S.A., Williams W.K., Patel D., Mahfouz R., Behm F.G., Raimondi S.C., Relling M.V., and Patel A. Classification, subtype discovery, and prediction of outcome in pediatric acute lymphoblastic leukemia by gene expression profiling. Cancer Cell 1 2 (2002) 133-143
54. Tasoulis D., Plagianakos V., and Vrahatis M. Unsupervised clustering in mRNA expression profiles. Computers in Biology and Medicine 36 (2006) 1126-1142