Classification of Binary Vectors by Stoc
β
Mats Gyllenberg; Timo Koski; Martin Verlaan
π
Article
π
1997
π
Elsevier Science
π
English
β 336 KB
Stochastic complexity is treated as a tool of classification, i.e., of inferring the number of classes, the class descriptions, and the class memberships for a given data set of binary vectors. The stochastic complexity is evaluated with respect to the family of statistical models defined by finite