Optimal clustering by merge-based branch-and-bound
Applied Computing and Intelligence · 2022
DOI: 10.3934/aci.2022004 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Computing and Intelligence, 2022. Verfasst von Pasi Fränti und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 33 Literaturangaben.
Abstract (Originalsprache)
We present a method to construct optimal clustering via a sequence of merge steps. We formulate the merge-based clustering as a minimum redundancy search tree, and then search the optimal clustering by a branch-and-bound technique. Optimal clustering is found regardless of the objective function used. We also consider two suboptimal polynomial time variants based on the proposed branch-and-bound technique. However, all variants are slow and has merely theoretical interest. We discuss the reasons for the results.
Zitieren
APA
Fränti, P., & Virmajoki, O. (2022). Optimal clustering by merge-based branch-and-bound. Applied Computing and Intelligence. https://doi.org/10.3934/aci.2022004
Vancouver
Fränti P, Virmajoki O. Optimal clustering by merge-based branch-and-bound. Applied Computing and Intelligence. 2022. doi:10.3934/aci.2022004
BibTeX
@article{Frnti2022,
author = {Fränti, Pasi and Virmajoki, Olli},
title = {Optimal clustering by merge-based branch-and-bound},
journal = {Applied Computing and Intelligence},
year = {2022},
doi = {10.3934/aci.2022004}
}
EUVIMED