book

Introduction to Pattern Recognition: A Matlab Approach

by Sergios Theodoridis, Aggelos Pikrakis, Konstantinos Koutroumbas, Dionisis Cavouras

March 2010

Intermediate to advanced

150 pages

7h 13m

English

Academic Press

Read now

Unlock full access

Front Cover
Title Page
Copyright Page
Table of Contents
Preface
Chapter 1. Classifiers Based on Bayes Decision Theory
1.1 Introduction1.2 Bayes Decision Theory
1.3 The Gaussian Probability Density Function
1.4 Minimum Distance Classifiers
1.4.1 The Euclidean Distance Classifier1.4.2 The Mahalanobis Distance Classifier
1.4.3 Maximum Likelihood Parameter Estimation of Gaussian pdfs
1.5 Mixture Models

1.6 The Expectation-Maximization Algorithm (1/2)
1.6 The Expectation-Maximization Algorithm (2/2)
1.7 Parzen Windows
1.8 k-Nearest Neighbor Density Estimation
1.9 The Naive Bayes Classifier
1.10 The Nearest Neighbor Rule
Chapter 2. Classifiers Based on Cost Function Optimization
2.1 Introduction
2.2 The Perceptron Algorithm
2.2.1 The Online Form of the Perceptron Algorithm
2.3 The Sum of Error Squares Classifier
2.3.1 The Multiclass LS Classifier
2.4 Support Vector Machines: The Linear Case
2.4.1 Multiclass Generalizations
2.5 SVM: The Nonlinear Case (1/2)
2.5 SVM: The Nonlinear Case (2/2)
2.6 The Kernel Perceptron Algorithm
2.7 The AdaBoost Algorithm
2.8 Multilayer Perceptrons (1/3)
2.8 Multilayer Perceptrons (2/3)
2.8 Multilayer Perceptrons (3/3)
Chapter 3. Data Transformation: Feature Generation and Dimensionality Reduction
3.1 Introduction3.2 Principal Component Analysis
3.3 The Singular Value Decomposition Method
3.4 Fisher’s Linear Discriminant Analysis
3.5 The Kernel PCA (1/2)
3.5 The Kernel PCA (2/2)
3.6 Laplacian Eigenmap (1/2)
3.6 Laplacian Eigenmap (2/2)
Chapter 4. Feature Selection
4.1 Introduction4.2 Outlier Removal
4.3 Data Normalization
4.4 Hypothesis Testing: The t-Test
4.5 The Receiver Operating Characteristic Curve
4.6 Fisher’s Discriminant Ratio
4.7 Class Separability Measures
4.7.1 Divergence
4.7.2 Bhattacharyya Distance and Chernoff Bound
4.7.3 Measures Based on Scatter Matrices
4.8 Feature Subset Selection
4.8.1 Scalar Feature Selection
4.8.2 Feature Vector Selection (1/3)
4.8.2 Feature Vector Selection (2/3)
4.8.2 Feature Vector Selection (3/3)
Chapter 5. Template Matching
5.1 Introduction5.2 The Edit Distance
5.3 Matching Sequences of Real Numbers
5.4 Dynamic Time Warping in Speech Recognition
Chapter 6. Hidden Markov Models
6.1 Introduction6.2 Modeling
6.3 Recognition and Training (1/3)
6.3 Recognition and Training (2/3)
6.3 Recognition and Training (3/3)
Chapter 7. Clustering
7.1 Introduction7.2 Basic Concepts and Definitions
7.3 Clustering Algorithms
7.4 Sequential Algorithms
7.4.1 BSAS Algorithm
7.4.2 Clustering Refinement (1/2)
7.4.2 Clustering Refinement (2/2)
7.5 Cost Function Optimization Clustering Algorithms
7.5.1 Hard Clustering Algorithms
7.5.2 Nonhard Clustering Algorithms
7.6 Miscellaneous Clustering Algorithms (1/2)
7.6 Miscellaneous Clustering Algorithms (2/2)
7.7 Hierarchical Clustering Algorithms
7.7.1 Generalized Agglomerative Scheme
7.7.2 Specific Agglomerative Clustering Algorithms
7.7.3 Choosing the Best Clustering (1/2)
7.7.3 Choosing the Best Clustering (2/2)
Appendix (1/2)
Appendix (2/2)
References
Index

Content preview from Introduction to Pattern Recognition: A Matlab Approach

4.8 Feature Subset Selection 123

4.8.1 Scalar Feature Selection

One way of reducing t he available features is to consider them individually and use one of the rel ated

criteria, such as the t-test , ROC, or FDR, t o discard and/or rank them in descending order; then choose the

top, say, l feat ures. Such an approach does not t ake into account existing correlations among the feat ures,

so here the cross-correlation coefﬁcient between them is considered and the following procedure may

be followed [Theo 09, Section 5.7.1].

First, features are ranked in descending order according to some criterion C.Leti

be the index of

the best one. Next, the cross- ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Classification, Parameter Estimation and State Estimation: An Engineering Approach Using MATLAB

Publisher Resources

ISBN: 9780123744869

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Introduction to Pattern Recognition: A Matlab Approach

by Sergios Theodoridis, Aggelos Pikrakis, Konstantinos Koutroumbas, Dionisis Cavouras

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.