arXiv (OAI Expanded)
open access
Stochastic complexity of vectors containing cluster structure
This paper studies the problem of computing the stochastic probability (shortest code length) of the encoded vectors containing cluster structure using Normalized Maximum Likelihood (NML) model. This is of great theoretical and practical importance in data clustering based on Minimum Description Len
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Stochastic complexity of vectors containing cluster structure#819560
- An efficient EM algorithm for both element-wise and structural missingness in matrix-variate normal mixture models#820041
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#985566
- Backdoor Channels Hidden in Latent Space: Extending Cryptographic Undetectability to Modern Neural Networks#973171
- No More K-means: Single-Stage Sparse Coding for Efficient Multi-Vector Retrieval#1128604
Record · ID 809564
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive