ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An algorithm to detect linearly separable clusters of binary patterns

Warnekar, CS and Krishna, G (1979) An algorithm to detect linearly separable clusters of binary patterns. In: Pattern Recognition, 11 (2). pp. 109-113.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/0031-3203(79)90056-6

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.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Elsevier Science.
Keywords: Binary patterns; Cluster; Linear separability; Convexity; Numbered binary form; Ordered sequence
Department/Centre: Division of Electrical Sciences > Electrical Engineering
Date Deposited: 21 Sep 2010 10:18
Last Modified: 21 Sep 2010 10:18
URI: http://eprints.iisc.ernet.in/id/eprint/32225

Actions (login required)

View Item View Item