The Complexity of Patterns and Pattern Recognition Systems

摘要

A preliminary investigation of characterizing the complexity of pattern recognition problems is presented. It is pointed out that this complexity can usually be decomposed into search, measurement, learning and decision complexities. A brief discussion of previous psychological investigations of judged complexity is presented followed by a more extensive discussion of the problem as relevant to system design. Examples from some practical cases are used to illustrate some of the concepts. (Author)