Machines capable of automatic pattern recognition have many fascinating uses in science and engineering as well as in our daily lives. Algorithms for supervised classification, where one infers a decision boundary from a set of training examples, are at the core of this capability. Tremendous progress has been made in refining such algorithms; yet, automatic learning in many simple tasks in daily life still appears to be far from reach. This book takes a close view of data complexity and its role in shaping the theories and techniques in different disciplines and asks: • What is missing from current classification techniques? • When the automatic classifiers are not perfect, is it a deficiency of the algorithms by design, or is it a difficulty intrinsic to the classification task? • How do we know whether we have exploited to the fullest extent the knowledge embedded in the training data? Data Complexity in Pattern Recognition is unique in its comprehensive coverage and multidisciplinary approach from various methodological and practical perspectives. Researchers and practitioners alike will find this book an insightful reference to learn about the current status of available techniques as well as application areas.
