An algorithm to detect linearly separable clusters of binary patterns |
| |
Authors: | CS Warnekar G Krishna |
| |
Affiliation: | Electrical Engineering Department, Indian Institute of Science, Bangalore 560012, India |
| |
Abstract: | The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data. |
| |
Keywords: | Binary patterns Cluster Linear separability Convexity Numbered binary form Ordered sequence |
本文献已被 ScienceDirect 等数据库收录! |