Title :
On computational complexity of non-reducible descriptors
Author :
Valev, Ventzeslav ; Asaithambi, Asai
Author_Institution :
Dept. of Comput. Sci., Saint Louis Univ., St. Louis, MO, USA
Abstract :
We present a supervised pattern recognition model that uses Boolean formulas for non-reducible descriptors. This model leads to computational problem which is shown to be NP-complete. In the paper, we identify two open combinatorial problems in the construction of non-reducible descriptors that can be applied to a large set of applications.
Keywords :
Boolean algebra; combinatorial mathematics; computational complexity; learning (artificial intelligence); pattern recognition; Boolean formulas; NP-completeness; combinatorial problems; computational complexity; machine learning; nonreducible descriptors; supervised pattern recognition; Computational complexity; Computational modeling; Computer science; Educational institutions; Electronic mail; Mathematical model; Medical diagnosis; Medical diagnostic imaging; Pattern analysis; Pattern recognition;
Conference_Titel :
Information Reuse and Integration, 2003. IRI 2003. IEEE International Conference on
Print_ISBN :
0-7803-8242-0
DOI :
10.1109/IRI.2003.1251415
