Convex clustering analysis for histogram-valued data

Cheolwoo Park, Hosik Choi, Chris Delcher, Yanning Wang, Young Joo Yoon

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


In recent years, there has been increased interest in symbolic data analysis, including for exploratory analysis, supervised and unsupervised learning, time series analysis, etc. Traditional statistical approaches that are designed to analyze single-valued data are not suitable because they cannot incorporate the additional information on data structure available in symbolic data, and thus new techniques have been proposed for symbolic data to bridge this gap. In this article, we develop a regularized convex clustering approach for grouping histogram-valued data. The convex clustering is a relaxation of hierarchical clustering methods, where prototypes are grouped by having exactly the same value in each group via penalization of parameters. We apply two different distance metrics to measure (dis)similarity between histograms. Various numerical examples confirm that the proposed method shows better performance than other competitors.

Original languageEnglish
Pages (from-to)603-612
Number of pages10
Issue number2
StatePublished - 2019

Bibliographical note

Publisher Copyright:
© 2019 International Biometric Society


  • Wassertein-Kantorovich metric
  • clustering
  • histogram-valued data
  • quantiles
  • regularization

ASJC Scopus subject areas

  • Statistics and Probability
  • General Biochemistry, Genetics and Molecular Biology
  • General Immunology and Microbiology
  • General Agricultural and Biological Sciences
  • Applied Mathematics


Dive into the research topics of 'Convex clustering analysis for histogram-valued data'. Together they form a unique fingerprint.

Cite this