Strong consistency of the prototype based clustering in probabilitic space

MaRDI QIDQ5502140zbMATH OpenFDO

Authors Vladimir Nikulin

Publication date 17 August 2015

Full work available at URL http://www.jmlr.org/papers/v16/nikulin15a.html

zbMATH Keywords

clusteringconsistencyprobabilitic space

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17)

Recommendations

• On strong consistency of kernel \(k\)-means: a Rademacher complexity approach
• Strong consistency of k-parameters clustering
• Strong consistency of reduced K-means clustering
• Strong consistency of factorial \(k\)-means clustering
• ON EXISTENCE AND STRONG CONSISTENCY OF A CLASS OF FUZZYC-MEANS CLUSTERING PROCEDURES

Cited in

(5)

• An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering
• On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
• On the strong consistency of feature-weighted \(k\)-means clustering in a nearmetric space
• On the uniform concentration bounds and large sample properties of clustering with Bregman divergences
• Riding down the Bay: space-time clustering of ecological trends

This page was built for publication: Strong consistency of the prototype based clustering in probabilitic space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502140)