Pages that link to "Item:Q4850276"
From MaRDI portal
The following pages link to Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding (Q4850276):
Displayed 13 items.
- Quantile-based clustering (Q107146) (← links)
- Fast rates for empirical vector quantization (Q351685) (← links)
- A notion of stability for \(k\)-means clustering (Q1711576) (← links)
- Consistency of data-driven histogram methods for density estimation and classification (Q1816593) (← links)
- On Hölder fields clustering (Q1936547) (← links)
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases (Q1945151) (← links)
- On strong consistency of kernel \(k\)-means: a Rademacher complexity approach (Q2070586) (← links)
- Nonasymptotic bounds for vector quantization in Hilbert spaces (Q2343956) (← links)
- \(L_1\)-quantization and clustering in Banach spaces (Q2437889) (← links)
- Statistical learning guarantees for compressive clustering and compressive mixture modeling (Q2664825) (← links)
- Strong Consistency of Reduced<i>K</i>-means Clustering (Q2932766) (← links)
- Convergence of the $k$-Means Minimization Problem using $\Gamma$-Convergence (Q3452592) (← links)
- Dimensionality-Dependent Generalization Bounds for <i>k</i>-Dimensional Coding Schemes (Q5380581) (← links)