|
|
|
|
|
Pattern Recognition - For the William Gibson novel, see: Pattern Recognition (novel).
Pattern recognition (also known as classification or pattern classification) is a field within the area of machine learning and can be defined as "the act of taking in raw data and taking an action based on the category of the data" 1. As such, it is a collection of methods for supervised learning. Typical applications are automatic speech recognition, classification of text into several categories (e.g. spam/non-spam email messages), the automatic recognition of handwritten postal codes on postal envelopes, or the automatic recognition of images of human faces. The last three examples form the subtopic image analysis of pattern recognition that deals with digital images as input to pattern recognition systems. Pattern recognition techniques Pattern recognition is typically an intermediate step in a longer process. These steps generally are acquisition of the data (image, sound, text, etc.) to be classified, preprocessing to remove noise or normalize the data in some way (image processing, stemming text, etc.), computing features, classification and finally post-processing based upon the recognized class and the confidence level. Pattern recognition itself is primarily concerned with the classification step. In some cases, such as in neural networks , feature selection and extraction may also be partially or fully automated. While there are many methods for classification, they are solving one of three related mathematical problems. The first is to find a map of a feature space (which is typically a multi-dimensional vector space) to a set of labels. This is equivalent to partitioning the feature space into regions, then assigning a label to each region. Such algorithms (e.g., the nearest neighbour algorithm) typically do not yield confidence or class probabilities, unless post-processing is applied. The second problem is to consider classification as an estimation problem, where the goal is to estimate a function of the form -
where the feature vector input is , and the function f is typically parameterized by some parameters . In the Bayesian approach to this problem, instead of choosing a single parameter vector , the result is integrated over all possible thetas, with weighted by how likely they are given the training data D: -
The third problem is related to the second, but the problem is to estimate the class-conditional probabilities and then use Bayes' rule to produce the class probability as in the second problem. Examples of classification algorithms include: Application domains See also References - Richard O. Duda, Peter E. Hart, David G. Stork (2001) Pattern classification (2nd edition), Wiley, New York, ISBN 0471056693.
- J. Schuermann: Pattern Classification: A Unified View of Statistical and Neural Approaches, Wiley&Sons, 1996, ISBN 0471135348
|  | bellerose terrace, new york bellmore, new york bethpage, new york brookville, new york carle place, new york cedarhurst, new york centre island, new york cove neck, new york east atlantic beach, new york prevalence (epidemiology) east garden city, new york
| east hills, new york east massapequa, new york east meadow, new york east norwich, new york east rockaway, new york east williston, new york elmont, new york farmingdale, new york floral park, new york flower hill, new york franklin square, new york
| freeport, new york garden city, new york garden city park, new york bernal sphere garden city south, new york glen cove, new york glen head, new york glenwood landing, new york great neck, new york great neck estates, new york great neck gardens, new york
| great neck plaza, new york greenvale, new york harbor hills, new york harbor isle, new york herricks, new york hewlett, new york hewlett bay park, new york hewlett harbor, new york hewlett neck, new york hicksville, new york inwood, new york
|
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|