DocumentCode
1393706
Title
Conundrum of combinatorial complexity
Author
Perlovsky, Leonid I.
Author_Institution
Nichols Res. Corp., Lexington, MA, USA
Volume
20
Issue
6
fYear
1998
fDate
6/1/1998 12:00:00 AM
Firstpage
666
Lastpage
670
Abstract
This paper examines fundamental problems underlying difficulties encountered by pattern recognition algorithms, neural networks, and rule systems. These problems are manifested as combinatorial complexity of algorithms, of their computational or training requirements. The paper relates particular types of complexity problems to the roles of a priori knowledge and adaptive learning. Paradigms based on adaptive learning lead to the complexity of training procedures, while nonadaptive rule-based paradigms lead to complexity of rule systems. Model-based approaches to combining adaptivity with a priori knowledge lead to computational complexity. Arguments are presented for the Aristotelian logic being culpable for the difficulty of combining adaptivity and a priority. The potential role of the fuzzy logic in overcoming current difficulties is discussed. Current mathematical difficulties are related to philosophical debates of the past
Keywords
combinatorial mathematics; computational complexity; fuzzy logic; learning (artificial intelligence); neural nets; pattern recognition; philosophical aspects; Aristotelian logic; adaptive learning; adaptivity; combinatorial complexity; computational complexity; neural networks; nonadaptive rule-based paradigms; pattern recognition algorithms; rule systems; Adaptive algorithm; Computational complexity; Explosions; Function approximation; Fuzzy logic; History; Mathematics; Neural networks; Neurons; Pattern recognition;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/34.683784
Filename
683784
Link To Document