Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD
IEEE Transactions on Pattern Analysis and Machine Intelligence · 2026-09 · 48 (9) · 10207-10220
DOI: 10.1109/tpami.2026.3669975 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Pattern Analysis and Machine Intelligence, 2026-09. Verfasst von Sourav Chakrabarty und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 38 Literaturangaben. Gefördert von: MATRICS Grant of Science and Engineering Research Board, Govt. of India.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- MATRICS Grant of Science and Engineering Research Board, Govt. of India
Zitieren
APA
Chakrabarty, S., Chakraborty, A., & De, S. K. (2026). Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD. IEEE Transactions on Pattern Analysis and Machine Intelligence, 48(9), 10207-10220. https://doi.org/10.1109/tpami.2026.3669975
Vancouver
Chakrabarty S, Chakraborty A, De SK. Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2026;48(9):10207-10220. doi:10.1109/tpami.2026.3669975
BibTeX
@article{Chakrabarty2026,
author = {Chakrabarty, Sourav and Chakraborty, Anirvan and De, Shyamal K},
title = {Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
year = {2026},
volume = {48},
number = {9},
pages = {10207--10220},
doi = {10.1109/tpami.2026.3669975}
}
EUVIMED