Dynamic clustering of histogram data based on adaptive squared Wasserstein distances

Expert Systems with Applications

Volumn 41, Issue 7, 2014, Pages 3351-3366

  Irpino, Antonio ^a   Verde, Rosanna ^a   De Carvalho, Francisco De A T ^b  

^a SECOND UNIVERSITY OF NAPLES   (Italy)

^b FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

Adaptive distance; Histogram data; Partitioning clustering method; Symbolic data analysis; Wasserstein distance

Indexed keywords

ADAPTIVE DISTANCE; CLUSTERING METHODS; HISTOGRAM DATA; SYMBOLIC DATA ANALYSIS; WASSERSTEIN DISTANCE;

GRAPHIC METHODS; STATISTICAL METHODS;

CLUSTERING ALGORITHMS;

EID: 84891600144     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2013.12.001     Document Type: Article

References (40)

1. A. Ahmad, and L. Dey A k-means type clustering algorithm for subspace clustering of mixed numeric and categorical datasets Pattern Recognition Letters 32 2011 1062 1069
2. H.H. Bock, and E. Diday Analysis of symbolic data Exploratory methods for extracting statistical information from complex data 2000 Springer Berlin
3. R.B. Calinski, and J. Harabasz A dendrite method for cluster analysis Communications in Statistics 3 1 1974 1 27
4. D.G. Calo, A. Montanari, and C. Viroli A hierarchical modeling approach for clustering probability density functions Computational Statistics and Data Analysis 71 2014 79 91
5. G. Celeux, E. Diday, G. Govaert, Y. Lechevallier, and H. Ralambondrainy Classification automatique des donnés 1989 Bordas Paris
6. E.Y. Chan, W.K. Ching, M.K. Ng, and J.Z. Huang An optimization algorithm for clustering using weighted dissimilarity measures Pattern Recognition 37 2004 943 952 (Pubitemid 38473837)
7. X. Chen, Y. Ye, X. Xu, and J.Z. Huang A feature group weighting method for subspace clustering of high-dimensional data Pattern Recognition 45 2012 434 446
8. R.G. Clark, and M.S. Rae A class of Wasserstein metrics for probability distributions Michigan Mathematical Journal 31 2 1984 231 240
9. J.A. Cuesta-Albertos, C. Matrán, and A. Tuero-Diaz Optimal transportation plans and convergence in distribution Journal of Multivariate Analysis 60 1997 72 83 (Pubitemid 127167512)
10. F.A.T. De Carvalho, P. Brito, and H.H. Bock Dynamic clustering for interval data based on L2 distance Computational Statistics 2 2006 231 250 (Pubitemid 44598946)
11. F.A.T. De Carvalho, and R.M.C.R. De Souza Unsupervised pattern recognition models for mixed feature-type symbolic data Pattern Recognition Letters 31 2010 430 443
12. F.A.T. De Carvalho, and Y. Lechevallier Dynamic clustering of interval-valued data based on adaptive quadratic distances Transactions on Systems, Man, and Cybernetics. Part A 39 2009 1295 1306
13. F.A.T. De Carvalho, and Y. Lechevallier Partitional clustering algorithms for symbolic interval data based on single adaptive distances Pattern Recognition 42 2009 1223 1236
14. Z. Deng, K.S. Choi, F.L. Chung, and S. Wang Enhanced soft subspace clustering integrating within-cluster and between-cluster information Pattern Recognition 43 2010 767 781
15. R.M.C.R. De Souza, and F.A.T. De Carvalho A clustering method for mixed feature-type symbolic data using adaptive squared euclidean distances HIS'07: Proceedings of the 7th international conference on hybrid intelligent systems 2007 IEEE Computer Society Washington, DC, USA 168 173
16. E. Diday, and G. Govaert Classification automatique avec distances adaptatives R.A.I.R.O. Informatique Computer Science 11 1997 329 349
17. E. Diday, and J.C. Simon Clustering analysis K. Fu, Digital pattern classification 1976 Springer Berlin 47 94
18. J.H. Friedman, and J.J. Meulman Clustering objects on subsets of attributes Journal of the Royal Statistical Society: Series B 66 2004 815 849
19. H. Frigui, and O. Nasraoui Unsupervised learning of prototypes and attribute weights Pattern Recognition 37 2004 567 581 (Pubitemid 38003094)
20. A.L. Gibbs, and F.E. Su On choosing and bounding probability metrics International Statistical Review 7 2002 419 435
21. J.Z. Huang, M.K. Ng, H. Rong, and Z. Li Automated variable weighting in k-means type clustering IEEE Transactions on Pattern Analysis and Machine Intelligence 27 2005 657 668 (Pubitemid 40608400)
22. L. Hubert, and P. Arabie Comparing partitions Journal of Classification 2 1985 193 218
23. A. Irpino, and E. Romano Optimal histogram representation of large data sets: Fisher vs piecewise linear approximation M. Noirhomme-Fraiture, G. Venturini, EGC, volume RNTI-E-9 of Revue des Nouvelles Technologies de l'Information 2007 Cépaduès-Éditions 99 110
24. A. Irpino, and R. Verde A new Wasserstein based distance for the hierarchical clustering of histogram symbolic data V. Batanjeli, H. Bock, A. Ferligoj, A. Ziberna, Data science and classification 2006 Springer Berlin 185 192
25. A.K. Jain Data clustering: 50 years beyond k-means Pattern Recognition Letters 31 2010 651 666
26. L. Jing, M.K. Ng, and J.Z. Huang An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data IEEE Transactions on Knowledge and Data Engineering 19 2007 1026 1041 (Pubitemid 47000341)
27. N.L. Johnson, S. Kotz, and N. Balakrishnan Continuous univariate distributions Vol. 1 1994 Wiley-Interscience
28. E. Levina, and P.J. Bickel The Earth Mover's distance is the Mallows distance: Some insights from statistics Proceedings of the 8th international conference on computer vision Vol. 2 2001 IEEE Computer Society 251 256 (Pubitemid 32795066)
29. C.L. Mallows A note on asymptotic joint normality Annals of Mathematics Statistics 43 1972 508 515
30. G.W. Milligan, and M.C. Cooper A study of standardization of variables in cluster analysis Journal of Classification 5 1988 181 204
31. Y. Rubner, C. Tomasi, and L.J. Guibas The Earth Mover's distance as a metric for image retrieval International Journal of Computer Vision 40 2000 99 121 (Pubitemid 32136368)
32. L. Rüshendorff Wasserstein metric Encyclopedia of mathematics 2001 Springer
33. Y. Terada, and H. Yadohisa Non-hierarchical clustering for distribution-valued data Y. Lechevallier, G. Saporta, Proceedings of COMPSTAT 2010 2010 Springer Berlin 1653 1660
34. C.Y. Tsai, and C.C. Chiu Developing a feature weight self-adjustment mechanism for a k-means clustering algorithm Computational Statistics and Data Analysis 52 2008 4658 4672
35. R. Verde, and A. Irpino Dynamic clustering of histograms using Wasserstein metric A. Rizzi, M. Vichi, Proceedings in computational statistics, COMPSTAT 2006, Compstat 2006 2006 PhysicaVerlag Heidelberg 869 876
36. R. Verde, and A. Irpino Comparing histogram data using a Mahalanobis-Wasserstein distance P. Brito, Proceedings in computational statistics, COMPSTAT 2008, Compstat 2008 2008 Springer verlag Heidelberg 77 89
37. R. Verde, and A. Irpino Dynamic clustering of histogram data: Using the right metric P. Brito, P. Bertrand, G. Cucumel, F. De Carvalho, Selected contributions in data analysis and classification 2008 Springer Berlin 123 134
38. C. Villani Topics in optimal transportation 2003 AMS
39. M. Vrac, L. Billard, E. Diday, and A. Chedin Copula analysis of mixture models Computational Statistics 27 2012 427 457
40. R. Xu, and D.I.I. Wunusch Survey of clustering algorithms IEEE Transactions on Neural Networks 16 2005 645 678 (Pubitemid 40718010)