On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
From MaRDI portal
Publication:2244449
Recommendations
Cites work
- 10.1162/153244303321897690
- Biclustering via sparse singular value decomposition
- Convex biclustering
- Finding large average submatrices in high dimensional data
- scientific article; zbMATH DE number 1750182 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- Least squares quantization in PCM
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Profile likelihood biclustering
- Rademacher complexity bounds for a penalized multi-class semi-supervised algorithm
- Regularized k-means clustering of high-dimensional data and its asymptotic consistency
- Strong consistency of k-parameters clustering
- Strong consistency of factorial \(k\)-means clustering
- Strong consistency of k-means clustering
- Strong consistency of reduced K-means clustering
- Strong consistency of the prototype based clustering in probabilitic space
This page was built for publication: On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244449)