On strong consistency of kernel k-means: A Rademacher complexity approach

Anish Chakrabarty and Swagatam Das

Statistics & Probability Letters, 2022, vol. 182, issue C

Abstract: We provide uniform concentration bounds on the kernel k-means clustering objective based on Rademacher complexity by posing the underlying problem as a risk minimization task. This approach results in state-of-the-art convergence rates on the excess risk besides the eventual establishment of strong consistency of cluster centers.

Keywords: Kernel k-means clustering; Rademacher complexity; Strong consistency (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715221002534
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:182:y:2022:i:c:s0167715221002534

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spl.2021.109291

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().