An algorithm to detect linearly separable clusters of binary patterns

DOI10.1016/0031-3203(79)90056-6MaRDI QIDQ1255786zbMATH OpenOpenAlexFDO

Authors 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

• An Algorithm for Constructing Optimal Binary Decision Trees
• An Efficient Clustering Algorithm
• Characterization of Binary Patterns and Their Projections
• scientific article; zbMATH DE number 3140980 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• On the Characterizing Parameters of a Threshold Function
• Printer graphics for clustering

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

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