Classification of run-length encoded binary data

DOI10.1016/J.PATCOG.2006.05.002MaRDI QIDQ853145zbMATHOpenAlexFDO

Authors N. E. Zubov

Publication date 15 November 2006

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2006.05.002

zbMATH Keywords

run-lengthclassification of compressed datanon-lossy compression

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Simple classification using binary data
• A fully compressed algorithm for computing the edit distance of run-length encoded strings
• Edit distance of run-length encoded strings.
• scientific article; zbMATH DE number 1700013
• Classification via Minimum Incremental Coding Length

Cites work

• Approximate matching of run-length compressed strings

Cited in

(3)

• Classification scheme for binary data with extensions
• A PROBABILISTIC SELF-ORGANIZING MAP FOR BINARY DATA TOPOGRAPHIC CLUSTERING
• Simple classification using binary data

This page was built for publication: Classification of run-length encoded binary data

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