3 research outputs found
SOM-based sparse binary encoding for AURA classifier
The AURA k-Nearest Neighbour classifier
associates binary input and output vectors, forming a compact
binary Correlation Matrix Memory (CMM). For a new input
vector, matching vectors are retrieved and classification is
performed on the basis of these recalled vectors. Real-world
data is not binary and must therefore be encoded to form the
required binary input. Efficient operation of the CMM requires
that these binary input vectors are sparse. Current encoding of
high dimensional data requires large vectors in order to remain
sparse, reducing efficiency. This paper explores an alternative
approach that produces shorter sparse codes, allowing more
efficient storage of information without degrading the recall
performance of the system
SOM-based sparse binary encoding for AURA classifier
The AURA k-Nearest Neighbour classifier
associates binary input and output vectors, forming a compact
binary Correlation Matrix Memory (CMM). For a new input
vector, matching vectors are retrieved and classification is
performed on the basis of these recalled vectors. Real-world
data is not binary and must therefore be encoded to form the
required binary input. Efficient operation of the CMM requires
that these binary input vectors are sparse. Current encoding of
high dimensional data requires large vectors in order to remain
sparse, reducing efficiency. This paper explores an alternative
approach that produces shorter sparse codes, allowing more
efficient storage of information without degrading the recall
performance of the system