Data Complexity in Pattern Recognition
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 progre...
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
London :
Springer London,
2006.
|
Σειρά: | Advanced Information and Knowledge Processing
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Theory and Methodology
- Measures of Geometrical Complexity in Classification Problems
- Object Representation, Sample Size, and Data Set 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
- Classifier Domains of Competence in Data Complexity Space
- Data Complexity Issues in Grammatical Inference
- Applications
- Simple Statistics for Complex Feature Spaces
- Polynomial Time Complexity Graph Distance Computation for Web Content Mining
- Data Complexity in Clustering Analysis of 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.