Descripción del título
Data Complexity in Pattern ...
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
Monografía
monografia Rebiun06171771 https://catalogo.rebiun.org/rebiun/record/Rebiun06171771 cr nn 008mamaa 100301s2006 xxk| s |||| 0|eng d 9781846281723 UPVA 996882657603706 UAM 991007781069204211 UNAV 006.4 23 Basu, Mitra Data Complexity in Pattern Recognition Recurso electrónico] edited by Mitra Basu, Tin Kam Ho London Springer London 2006 London London Springer London XIV, 300 p. XIV, 300 p. Advanced Information and Knowledge Processing Springer eBooks Theory and Methodology -- Measures of Geometrical Complexity in Classification Problems -- Object Representation, Sample Size and Dataset Complexity -- Measures of Data and Classifier Complexity and the Training Sample Size -- Linear Separability in Descent Procedures for Linear Classifiers -- Data Complexity, Margin-based Learning and Popper's Philosophy of Inductive Learning -- Data Complexity and Evolutionary Learning -- Data Complexity and Domains of Competence of Classifiers -- Data Complexity Issues in Grammatical Inference -- Applications -- Simple Statistics for Complex Feature Spaces -- Polynomial Time for Complexity Graph Distance Computation for Web Content Mining -- Data Complexity in Clustering Analysis for Gene Microarray Expression Profiles -- Complexity of Magnetic Resonance Spectrum Classification -- Data Complexity in Tropical Cyclone Positioning and Classification -- Human-Computer Interaction for Complex Pattern Recognition Problems -- Complex Image Recognition and Web Security 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 Forma de acceso: World Wide Web Ho, Tin Kam SpringerLink