Infoscience Epflmetadata only
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models
clustering, mixture models, k-means, iterative algorithms
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 388255
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.