Toward a compression-based self-organizing recognizer: Preliminary implementation of PRDC-CSOR ?
Compressibility of a data x  is an approximation of the Kolmogorov complexity K(x) K ( x ) . Compressibility can be a new general datas feature for pattern recognition. This possibility is shown through the preliminary implementation of the PRDC-CSOR. PRDC-CSOR can build the pattern recognition function using incoming data only. Preliminary application to image data gave promising results.
kolmogorov complexity design scheme self organization data analysis compressibility feature