SOURCE-LINKED INTELLIGENCE

Stochastic complexity of vectors containing cluster structure

arXiv · AI, language, vision and robotics · article · Aug 31, 2026 · UTC

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 Length (MDL) principle, such as for estimating the best number of clusters and best cluster structure for the data. Straightforward computation of the shortest code length of the vector containing cluster structure based on the NML model requires polynomial time with respect to the size of the vector a

Read original source ↗ Open in workspace

recordType

paper

region

Global