An algorithm to detect linearly separable clusters of binary patterns

DOI10.1016/0031-3203(79)90056-6zbMath0402.68061OpenAlexW2018596126MaRDI QIDQ1255786

K. Appert

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0031-3203(79)90056-6

zbMATH Keywords

Boolean FunctionsDetect Linearly Separable Clusters of Binary Patterns

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• Unnamed Item
• Unnamed Item
• An Efficient Clustering Algorithm
• Printer graphics for clustering
• Characterization of Binary Patterns and Their Projections
• An Algorithm for Constructing Optimal Binary Decision Trees
• On the Characterizing Parameters of a Threshold Function

This page was built for publication: An algorithm to detect linearly separable clusters of binary patterns