Prior knowledge for pattern recognition

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Pattern recognition is a very active field of research intimately bound to machine learning. Also known as classification or statistical classification, pattern recognition aims at building a classifier that can determine the class of an input pattern.

This procedure, known as training, corresponds to learning an unknown decision function based only on a set of input-output pairs (\boldsymbol{x}_i,y_i) that form the training data (or training set). Nonetheless, in real world applications such as character recognition, a certain amount of information on the problem is usually known beforehand.

The incorporation of this prior knowledge into the training is the key element that will allow an increase of performance in many applications.

Pattern recognition is a very active field of research intimately bound to machine learning. Also known as classification or statistical classification, pattern recognition aims at building a classifier that can determine the class of an input pattern.

This procedure, known as training, corresponds to learning an unknown decision function based only on a set of input-output pairs (\boldsymbol{x}_i,y_i) that form the training data (or training set). Nonetheless, in real world applications such as character recognition, a certain amount of information on the problem is usually known beforehand.

The incorporation of this prior knowledge into the training is the key element that will allow an increase of performance in many applications. f(\boldsymbol{x}) = f(T_{\theta}\boldsymbol{x}), \quad \forall \boldsymbol{x}, \theta . Local invariance can also be considered for a transformation centered at \theta=0 , so that T_0\boldsymbol{x} = \boldsymbol{x} , by using the constraint \left.\frac{\partial}{\partial \theta}\right|_{\theta=0} f(T_{\theta} \boldsymbol{x}) = 0 .

The function f in these equations can be either the decision function of the classifier or its real-valued output. Another approach is to consider class-invariance with respect to a "domain of the input space" instead of a transformation.

In this case, the problem becomes finding f so that f(\boldsymbol{x}) = y_{\mathcal{P}},\ \forall \boldsymbol{x}\in \mathcal{P} , where y_{\mathcal{P}} is the membership class of the region \mathcal{P} of the input space. A different type of class-invariance found in pattern recognition is permutation-invariance, i.e. invariance of the class to a permutation of elements in a structured input.

A typical application of this type of prior knowledge is a classifier invariant to permutations of rows of the matrix inputs.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1329489787 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001329489787 · captured 1766738200.0 · version history

Cite this page as: encyclopegia.org, “Prior knowledge for pattern recognition”, snapshot enwiki-001329489787. https://encyclopegia.org/a/prior-knowledge-for-pattern-recognition

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.