Properties of Numeric Codes for the Scheme of Random Subspaces RSC

Authors:
D. A. Rachkovskii;S. V. Slipchenko;E. M. Kussul;T. N. Baidyk
Affiliations:
International Scientific-Educational Center of Information Technologies and Systems, Kiev, Ukraine;International Scientific-Educational Center of Information Technologies and Systems, Kiev, Ukraine;National Autonomous University of Mexico, Mexico City, Mexico;National Autonomous University of Mexico, Mexico City, Mexico
Venue:
Cybernetics and Systems Analysis
Year:
2005

Citing 4
Cited 3

Boltzmann machines for speech recognition

Computer Speech and Language
DataGen: a generator of datasets for evaluation of classification algorithms

Pattern Recognition Letters
The Handbook of Brain Theory and Neural Networks

The Handbook of Brain Theory and Neural Networks
Analysis of a Classifier with Random Thresholds

Cybernetics and Systems Analysis

Resolution of Binary Coding of Real-Valued Vectors by Hyperrectangular Receiptive Fields

Cybernetics and Systems Analysis
Analysis of separating surfaces formed by a random subspace classifier

Cybernetics and Systems Analysis
Similarity-Based Retrieval With Structure-Sensitive Sparse Binary Distributed Representations

Computational Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Properties of coarse coding obtained by using the random subspace coding (RSC) scheme with random hyperrectangular receptive fields are considered. Characteristics of codes are provided such as the dimensionality of receptive fields, code density at various points of the input space, code overlapping, and others. The results of theoretical analysis are illustrated by experiments with high-dimensional codes.