Title :
Generalized non-reducible descriptors
Author :
Valev, Ventzeslav ; Sankur, Bulent ; Radeva, Petia
Author_Institution :
Dept. of Comput. Sci., St. Louis Univ., MO, USA
Abstract :
This paper provides a generalization of non-reducible descriptors. Non-reducible descriptors are used in supervised pattern recognition problems when the patterns descriptions consist of Boolean variables. This generalization extends the concept of distance between patterns of different classes. A mathematical model to construct generalized non-reducible descriptors, a computational procedure, and numerical examples are discussed
Keywords :
Boolean algebra; generalisation (artificial intelligence); learning systems; matrix algebra; pattern recognition; Boolean variables; dissimilarity matrix; generalization; machine learning; mathematical model; nonreducible descriptors; supervised pattern recognition; Character recognition; Computer science; Computer vision; Feature extraction; Hamming distance; Machine learning; Mathematical model; Optical character recognition software; Pattern recognition;
Conference_Titel :
Pattern Recognition, 2000. Proceedings. 15th International Conference on
Conference_Location :
Barcelona
Print_ISBN :
0-7695-0750-6
DOI :
10.1109/ICPR.2000.906095
