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

DOI10.1016/S0167-8655(02)00189-7zbMath1054.68120MaRDI QIDQ4421031

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

Publication date: 19 August 2003

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

zbMATH Keywords

ClusteringAlgorithmsDistance functionsStochastic complexity

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (2)

On multivariate binary data clustering and feature weighting ⋮ Efficient mixture model for clustering of sparse high dimensional binary data

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