Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 6 min ago
PreprintCC BY 4.0arXiv

Merging Modal Clusters via Significance Assessment

Abstract

To deal with superfluous clusters and to reduce the number of clusters as often desired in practice, a modal cluster merging procedure is proposed. Based on some new properties established in this paper for Morse functions, the procedure merges clusters in a sequential manner without causing unnecessary density distortion. Each cluster is evaluated for its significance relative to the other clusters, using the Kullback-Leibler divergence or its log-likelihood approximation, by truncating the density for the cluster at an appropriate level. The least significant cluster is then merged into one of its adjacent clusters, using the novel concept of cluster adjacency defined in this paper. The resulting hierarchical clustering tree is useful for determining the number of clusters, as may be preferred by a specific user or in a general, meaningful manner. Numerical studies show that the new procedure deals well with difficult clustering problems and often produces intuitively appealing and numerically more accurate clustering results, as compared with several other popular clustering methods in the literature.

Related

  1. Geometry-induced formation and merging of multiple dead zones in diffusion-reaction problems
    Piotr Skrzypacz, Boris Golman, Jan Valdman
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. A Self-Generated Local Structural Prior for Resolving Target Merging in Electrical Impedance Tomography (EIT)
    Junkang Liu, Yizhuang Song
    arXivPreprintCC BY-NC-ND 4.0Full textMathematical physicsarXiv
  3. PRIME: Frequency-Aware Unified Pruning and Merging for MoE Compression
    Shanfeng Huang, Rongqian Zhang, Zhou Fang +2
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Bagel: A Fast Bayesian Online Changepoint Detection Algorithm for Linear Models via Posterior Merging
    Ziyang Yang, Paul Fearnhead, Dan Grose
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Admissible E-Value Merging Under Uncertain Input Validity
    Lulah Alnaji
    MathematicsPeer-reviewedCC BY 4.0StatisticsCrossref
BibTeX
@misc{wang2026merging,
  title = {{Merging Modal Clusters via Significance Assessment}},
  author = {Yong Wang and Shengwei Hu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.01958},
  eprint = {2609.01958},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.01958},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Merging Modal Clusters via Significance Assessment
AU  - Yong Wang
AU  - Shengwei Hu
PY  - 2026
DA  - 2026/09/02
PB  - arXiv
DO  - 10.48550/arxiv.2609.01958
UR  - https://arxiv.org/abs/2609.01958
AB  - To deal with superfluous clusters and to reduce the number of clusters as often desired in practice, a modal cluster merging procedure is proposed. Based on some new properties established in this paper for Morse functions, the procedure merges clusters in a sequential manner without causing unnecessary density distortion. Each cluster is evaluated for its significance relative to the other clusters, using the Kullback-Leibler divergence or its log-likelihood approximation, by truncating the density for the cluster at an appropriate level. The least significant cluster is then merged into one of its adjacent clusters, using the novel concept of cluster adjacency defined in this paper. The resulting hierarchical clustering tree is useful for determining the number of clusters, as may be preferred by a specific user or in a general, meaningful manner. Numerical studies show that the new procedure deals well with difficult clustering problems and often produces intuitively appealing and numerically more accurate clustering results, as compared with several other popular clustering methods in the literature.
ER  -