Comparing histogram data using a mahalanobis-wasserstein distance

COMPSTAT 2008 - Proceedings in Computational Statistics, 18th Symposium

Volumn , Issue , 2008, Pages 77-89

  Verde, Rosanna ^a   Irpino, Antonio ^a  

^a SECOND UNIVERSITY OF NAPLES   (Italy)

Author keywords

Dependence; Dynamic clustering; Histogram data; Inertia; Mahalanobis distance; Wasserstein distance

Indexed keywords

DEPENDENCE; DYNAMIC CLUSTERING; HISTOGRAM DATA; INERTIA; MAHALANOBIS DISTANCES; WASSERSTEIN DISTANCE;

GRAPHIC METHODS;

EID: 77952710071     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-7908-2084-3_7     Document Type: Conference Paper

References (13)

1. BERTRAND, P. and GOUPIL, F. (2000): Descriptive statistics for symbolic data. In: H.-H. Bock and E. Diday (Eds.): Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data. Springer, Berlin, 103-124.
2. BILLARD, L. (2007): Dependencies and Variation Components of Symbolic Interval-Valued Data. In: P. Brito, P. Bertrand, G. Cucumel, F. de Carvalho (Eds.): Selected Contributions in Data Analysis and Classification. Springer, Berlin, 3-12.
3. BOCK, H.-H. and DIDAY, E. (2000): Analysis of Symbolic Data, Exploratory methods for extracting statistical information from complex data, Studies in Classification, Data Analysis and Knowledge Organisation, Springer-Verlag.
4. BRITO, P. (2007): On the Analysis of Symbolic Data. In: P. Brito, P. Bertrand, G. Cucumel, F. de Carvalho (Eds.): Selected Contributions in Data Analysis and Classification. Springer, Berlin, 13-22.
5. CHAVENT, M., DE CARVALHO, F.A.T., LECHEVALLIER, Y., and VERDE, R. (2003): Trois nouvelles méthodes de classification automatique des données symbolique de type intervalle. Revue de Statistique Appliquée, LI, 4, 5-29.
6. CUESTA-ALBERTOS, J.A., MATRÁN, C., TUERO-DIAZ, A. (1997): Optimal transportation plans and convergence in distribution. Journ. of Multiv. An., 60, 72-83.
7. DIDAY, E., and SIMON, J.C. (1976): Clustering analysis, In: K.S. Fu (Eds.), Digital Pattern Recognition, Springer Verlag, Heidelberg, 47-94.
8. DIDAY, E. (1971): Le méthode des nuées dynamiques, Revue de Statistique Appliquée, 19, 2, 19-34.
9. GIBBS, A.L. and SU, F.E. (2002): On choosing and bounding probability metrics. Intl. Stat. Rev. 7 (3), 419-435.
10. IRPINO, A., LECHEVALLIER, Y. and VERDE, R. (2006): Dynamic clustering of histograms using Wasserstein metric. In: A. Rizzi, M. Vichi, (Eds.) COMPSTAT 2006. Physica-Verlag, Berlin, 869-876.
11. IRPINO, A. and ROMANO, E. (2007): Optimal histogram representation of large data sets: Fisher vs piecewise linear approximations. RNTI E-9, 99-110.
12. IRPINO, A. and VERDE, R. (2006): A new Wasserstein based distance for the hierarchical clustering of histogram symbolic data. In: V. Batagelj, H.-H. Bock, A. Ferligoj, A. Ziberna (Eds.) Data Science and Classification, IFCS 2006. Springer, Berlin, 185-192.
13. VERDE, R. and IRPINO, A. (2007): Dynamic Clustering of Histogram Data: Using the Right Metric. In: P. Brito, P. Bertrand, G. Cucumel, F. de Carvalho (Eds.): Selected Contributions in Data Analysis and Classification. Springer, Berlin, 123-134.