Classification of binary vectors by using ΔSC distance to minimize stochastic complexity

DOI10.1016/S0167-8655(02)00189-7MaRDI QIDQ4421031zbMATH OpenFDO

Authors Pasi Fränti, Mantao Xu, Ismo Kärkkäinen

Publication date 19 August 2003

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8655(02)00189-7

zbMATH Keywords

AlgorithmsClusteringDistance functionsStochastic complexity

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Classification of binary vectors by stochastic complexity.
• scientific article; zbMATH DE number 1409218
• scientific article; zbMATH DE number 3971958
• scientific article; zbMATH DE number 4068049
• Stochastic K-means algorithm for vector quantization

Cited in

(5)

• Classification of binary vectors by stochastic complexity.
• Efficient mixture model for clustering of sparse high dimensional binary data
• The -machine: classification based on distances towards prototypes
• On multivariate binary data clustering and feature weighting
• The 2x2 Matrix

This page was built for publication: Classification of binary vectors by using ΔSC distance to minimize stochastic complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421031)