Prior knowledge for pattern recognition

Prior knowledge[1] refers to all information about the problem available in addition to the training data. However, in this most general form, determining a model from a finite set of samples without prior knowledge is an ill-posed problem, in the sense that a unique model may not exist. Many classifiers incorporate the general smoothness assumption that a test pattern similar to one of the training samples tends to be assigned to the same class.

The importance of prior knowledge in machine learning is suggested by its role in search and optimization. Loosely, the no free lunch theorem states that all search algorithms have the same average performance over all problems, and thus implies that to gain in performance on a certain application one must use a specialized algorithm that includes some prior knowledge about the problem.

The different types of prior knowledge encountered in pattern recognition are now regrouped under two main categories: class-invariance and knowledge on the data.

A very common type of prior knowledge in pattern recognition is the invariance of the class (or the output of the classifier) to a transformation of the input pattern. This type of knowledge is referred to as transformation-invariance. The mostly used transformations used in image recognition are:

• translation;
• rotation;
• skewing;
• scaling.

Incorporating the invariance to a transformation ${\displaystyle T_{\theta }:{\boldsymbol {x}}\mapsto T_{\theta }{\boldsymbol {x}}}$ parametrized in ${\displaystyle \theta }$ into a classifier of output ${\displaystyle f({\boldsymbol {x}})}$ for an input pattern ${\displaystyle {\boldsymbol {x}}}$ corresponds to enforcing the equality

${\displaystyle f({\boldsymbol {x}})=f(T_{\theta }{\boldsymbol {x}}),\quad \forall {\boldsymbol {x}},\theta .}$

Local invariance can also be considered for a transformation centered at ${\displaystyle \theta =0}$, so that ${\displaystyle T_{0}{\boldsymbol {x}}={\boldsymbol {x}}}$, by using the constraint

${\displaystyle \left.{\frac {\partial }{\partial \theta }}\right|_{\theta =0}f(T_{\theta }{\boldsymbol {x}})=0.}$

The function ${\displaystyle 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 ${\displaystyle f}$ so that

${\displaystyle f({\boldsymbol {x}})=y_{\mathcal {P}},\ \forall {\boldsymbol {x}}\in {\mathcal {P}},}$

where ${\displaystyle y_{\mathcal {P}}}$ is the membership class of the region ${\displaystyle {\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.

Other forms of prior knowledge than class-invariance concern the data more specifically and are thus of particular interest for real-world applications. The three particular cases that most often occur when gathering data are:

• Unlabeled samples are available with supposed class-memberships;
• Imbalance of the training set due to a high proportion of samples of a class;
• Quality of the data may vary from a sample to another.

Prior knowledge of these can enhance the quality of the recognition if included in the learning. Moreover, not taking into account the poor quality of some data or a large imbalance between the classes can mislead the decision of a classifier.

• E. Krupka and N. Tishby, "Incorporating Prior Knowledge on Features into Learning", Eleventh International Conference on Artificial Intelligence and Statistics (AISTATS 07)