Supervised learning

<h2 id="steps-to-follow">Steps to follow</h2>
<p>To solve a given problem of supervised learning, the following steps must be performed:
</p>
<ol><li>Determine the type of training samples. Before doing anything else, the user should decide what kind of data is to be used as a <a href="/facts/Training,_validation,_and_test_data_sets/V3mMQb2G">training set</a>. In the case of <a href="/facts/Handwriting_analysis/fXJcgr1n">handwriting analysis</a>, for example, this might be a single handwritten character, an entire handwritten word, an entire sentence of handwriting, or a full paragraph of handwriting.</li>
<li>Gather a training set. The training set needs to be representative of the real-world use of the function. Thus, a set of input objects is gathered together with corresponding outputs, either from <a href="/facts/Subject-matter_expert/3kx3sVID">human experts</a> or from measurements.</li>
<li>Determine the input <a href="/facts/Feature_(machine_learning)/nzAhYxfu">feature</a> representation of the learned function. The accuracy of the learned function depends strongly on how the input object is represented. Typically, the input object is transformed into a <a href="/facts/Feature_vector/nzAhYxfu">feature vector</a>, which contains a number of features that are descriptive of the object. The number of features should not be too large, because of the <a href="/facts/Curse_of_dimensionality/dk7SnY6L">curse of dimensionality</a>; but should contain enough information to accurately predict the output.</li>
<li>Determine the structure of the learned function and corresponding learning algorithm. For example, one may choose to use <a href="/facts/Support-vector_machine/XobxpdBG">support-vector machines</a> or <a href="/facts/Decision_tree_learning/LbPMAwdI">decision trees</a>.</li>
<li>Complete the design. Run the learning algorithm on the gathered training set. Some supervised learning algorithms require the user to determine certain <a href="/facts/Hyperparameter_(machine_learning)/jCxm3fTA">control parameters</a>. These parameters may be adjusted by optimizing performance on a subset (called a <i><a href="/facts/Validation_set/V3mMQb2G">validation set</a></i>) of the training set, or via <a href="/facts/Cross-validation_(statistics)/pDWg8s0e">cross-validation</a>.</li>
<li>Evaluate the accuracy of the learned function. After parameter adjustment and learning, the performance of the resulting function should be measured on a <a href="/facts/Test_set/V3mMQb2G">test set</a> that is separate from the training set.</li></ol>
<h2 id="algorithm-choice">Algorithm choice</h2>
<p>A wide range of supervised learning algorithms are available, each with its strengths and weaknesses. There is no single learning algorithm that works best on all supervised learning problems (see the <a href="/facts/No_free_lunch_in_search_and_optimization/aNGHqkID">No free lunch theorem</a>).
</p><p>There are four major issues to consider in supervised learning:
</p>
<h3>Bias–variance tradeoff</h3>
<p class="note">Main article: <a href="/facts/Bias%E2%80%93variance_tradeoff/xqDnRpeQ">Bias–variance tradeoff</a></p>
<p>A first issue is the tradeoff between <i>bias</i> and <i>variance</i>.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> Imagine that we have available several different, but equally good, training data sets. A learning algorithm is biased for a particular input 
  
    
      
        x
      
    
    {\displaystyle x}
  
 if, when trained on each of these data sets, it is systematically incorrect when predicting the correct output for 
  
    
      
        x
      
    
    {\displaystyle x}
  
. A learning algorithm has high variance for a particular input 
  
    
      
        x
      
    
    {\displaystyle x}
  
 if it predicts different output values when trained on different training sets. The prediction error of a learned classifier is related to the sum of the bias and the variance of the learning algorithm.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> Generally, there is a tradeoff between bias and variance. A learning algorithm with low bias must be "flexible" so that it can fit the data well. But if the learning algorithm is too flexible, it will fit each training data set differently, and hence have high variance. A key aspect of many supervised learning methods is that they are able to adjust this tradeoff between bias and variance (either automatically or by providing a bias/variance parameter that the user can adjust).
</p>
<h3>Function complexity and amount of training data</h3>
<p>The second issue is of the amount of training data available relative to the complexity of the "true" function (classifier or regression function). If the true function is simple, then an "inflexible" learning algorithm with high bias and low variance will be able to learn it from a small amount of data. But if the true function is highly complex (e.g., because it involves complex interactions among many different input features and behaves differently in different parts of the input space), then the function will only be able to learn with a large amount of training data paired with a "flexible" learning algorithm with low bias and high variance.
</p>
<h3>Dimensionality of the input space</h3>
<p>A third issue is the dimensionality of the input space. If the input feature vectors have large dimensions, learning the function can be difficult even if the true function only depends on a small number of those features. This is because the many "extra" dimensions can confuse the learning algorithm and cause it to have high variance. Hence, input data of large dimensions typically requires tuning the classifier to have low variance and high bias. In practice, if the engineer can manually remove irrelevant features from the input data, it will likely improve the accuracy of the learned function. In addition, there are many algorithms for <a href="/facts/Feature_selection/gxbuF4VG">feature selection</a> that seek to identify the relevant features and discard the irrelevant ones. This is an instance of the more general strategy of <a href="/facts/Dimensionality_reduction/XoRpcrB0">dimensionality reduction</a>, which seeks to map the input data into a lower-dimensional space prior to running the supervised learning algorithm.
</p>
<h3>Noise in the output values</h3>
<p>A fourth issue is the degree of noise in the desired output values (the supervisory <a href="/facts/Target_variable/dINfzIF2">target variables</a>). If the desired output values are often incorrect (because of human error or sensor errors), then the learning algorithm should not attempt to find a function that exactly matches the training examples. Attempting to fit the data too carefully leads to <a href="/facts/Overfitting/5xnFLcMg">overfitting</a>. You can overfit even when there are no measurement errors (stochastic noise) if the function you are trying to learn is too complex for your learning model. In such a situation, the part of the target function that cannot be modeled "corrupts" your training data - this phenomenon has been called <a href="/facts/Deterministic_noise/nPnLMFQn">deterministic noise</a>. When either type of noise is present, it is better to go with a higher bias, lower variance estimator.
</p><p>In practice, there are several approaches to alleviate noise in the output values such as <a href="/facts/Early_stopping/eGThkRtL">early stopping</a> to prevent overfitting as well as <a href="/facts/Anomaly_detection/wjEGMGGz">detecting</a> and removing the noisy training examples prior to training the supervised learning algorithm. There are several algorithms that identify noisy training examples and removing the suspected noisy training examples prior to training has decreased <a href="/facts/Generalization_error/dy5YSgB8">generalization error</a> with <a href="/facts/Statistical_significance/PMxjdlAu">statistical significance</a>.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a><a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a>
</p>
<h3>Other factors to consider</h3>
<p>Other factors to consider when choosing and applying a learning algorithm include the following:
</p>
<ul><li>Heterogeneity of the data. If the feature vectors include features of many different kinds (discrete, discrete ordered, counts, continuous values), some algorithms are easier to apply than others. Many algorithms, including <a href="/facts/Support_Vector_Machines/XobxpdBG">support-vector machines</a>, <a href="/facts/Linear_regression/5n998IhK">linear regression</a>, <a href="/facts/Logistic_regression/mGj6mc8y">logistic regression</a>, <a href="/facts/Neural_network_(machine_learning)/6V1jMlkx">neural networks</a>, and <a href="/facts/K-nearest_neighbors_algorithm/Bs1UaAmE">nearest neighbor methods</a>, require that the input features be numerical and scaled to similar ranges (e.g., to the [-1,1] interval). Methods that employ a distance function, such as nearest neighbor methods and <a href="/facts/Support_Vector_Machines/XobxpdBG">support-vector machines with Gaussian kernels</a>, are particularly sensitive to this. An advantage of <a href="/facts/Decision_tree_learning/LbPMAwdI">decision trees</a> is that they easily handle heterogeneous data.</li>
<li>Redundancy in the data. If the input features contain redundant information (e.g., highly correlated features), some learning algorithms (e.g., <a href="/facts/Linear_regression/5n998IhK">linear regression</a>, <a href="/facts/Logistic_regression/mGj6mc8y">logistic regression</a>, and <a href="/facts/K-nearest_neighbors_algorithm/Bs1UaAmE"> distance-based methods</a>) will perform poorly because of numerical instabilities. These problems can often be solved by imposing some form of <a href="/facts/Regularization_(mathematics)/K601A3y2">regularization</a>.</li>
<li>Presence of interactions and non-linearities. If each of the features makes an independent contribution to the output, then algorithms based on linear functions (e.g., <a href="/facts/Linear_regression/5n998IhK">linear regression</a>, <a href="/facts/Logistic_regression/mGj6mc8y">logistic regression</a>, <a href="/facts/Support-vector_machine/XobxpdBG">support-vector machines</a>, <a href="/facts/Naive_Bayes_classifier/FmNHI688">naive Bayes</a>) and distance functions (e.g., nearest neighbor methods, <a href="/facts/Support_Vector_Machines/XobxpdBG">support-vector machines with Gaussian kernels</a>) generally perform well. However, if there are complex interactions among features, then algorithms such as <a href="/facts/Decision_tree_learning/LbPMAwdI">decision trees</a> and neural networks work better, because they are specifically designed to discover these interactions. Linear methods can also be applied, but the engineer must manually specify the interactions when using them.</li></ul>
<p>When considering a new application, the engineer can compare multiple learning algorithms and experimentally determine which one works best on the problem at hand (see <a href="/facts/Cross-validation_(statistics)/pDWg8s0e"> cross-validation</a>). Tuning the performance of a learning algorithm can be very time-consuming. Given fixed resources, it is often better to spend more time collecting additional training data and more informative features than it is to spend extra time tuning the learning algorithms.
</p>
<h3>Algorithms</h3>
<p>The most widely used learning algorithms are: 
</p>
<ul><li><a href="/facts/Support-vector_machine/XobxpdBG">Support-vector machines</a></li>
<li><a href="/facts/Linear_regression/5n998IhK">Linear regression</a></li>
<li><a href="/facts/Logistic_regression/mGj6mc8y">Logistic regression</a></li>
<li><a href="/facts/Naive_Bayes_classifier/FmNHI688">Naive Bayes</a></li>
<li><a href="/facts/Linear_discriminant_analysis/Mj6KQhRN">Linear discriminant analysis</a></li>
<li><a href="/facts/Decision_tree_learning/LbPMAwdI">Decision trees</a></li>
<li><a href="/facts/K-nearest_neighbors_algorithm/Bs1UaAmE"><i>k</i>-nearest neighbors algorithm</a></li>
<li><a href="/facts/Neural_network_(machine_learning)/6V1jMlkx">Neural networks</a> (e.g., <a href="/facts/Multilayer_perceptron/jkq4t7Gy">Multilayer perceptron</a>)</li>
<li><a href="/facts/Similarity_learning/peRWFSl4">Similarity learning</a></li></ul>
<h2 id="how-supervised-learning-algorithms-work">How supervised learning algorithms work</h2>
<p>Given a set of 
  
    
      
        N
      
    
    {\displaystyle N}
  
 training examples of the form 
  
    
      
        {
        (
        
          x
          
            1
          
        
        ,
        
          y
          
            1
          
        
        )
        ,
        .
        .
        .
        ,
        (
        
          x
          
            N
          
        
        ,
        
        
          y
          
            N
          
        
        )
        }
      
    
    {\displaystyle \{(x_{1},y_{1}),...,(x_{N},\;y_{N})\}}
  
 such that 
  
    
      
        
          x
          
            i
          
        
      
    
    {\displaystyle x_{i}}
  
 is the <a href="/facts/Feature_vector/nzAhYxfu">feature vector</a> of the 
  
    
      
        i
      
    
    {\displaystyle i}
  
-th example and 
  
    
      
        
          y
          
            i
          
        
      
    
    {\displaystyle y_{i}}
  
 is its label (i.e., class), a learning algorithm seeks a function 
  
    
      
        g
        :
        X
        →
        Y
      
    
    {\displaystyle g:X\to Y}
  
, where 
  
    
      
        X
      
    
    {\displaystyle X}
  
 is the input space and 
  
    
      
        Y
      
    
    {\displaystyle Y}
  
 is the output space. The function 
  
    
      
        g
      
    
    {\displaystyle g}
  
 is an element of some space of possible functions 
  
    
      
        G
      
    
    {\displaystyle G}
  
, usually called the <i>hypothesis space</i>. It is sometimes convenient to represent 
  
    
      
        g
      
    
    {\displaystyle g}
  
 using a <a href="/facts/Scoring_function/h5nm87vd">scoring function</a> 
  
    
      
        f
        :
        X
        ×
        Y
        →
        
          R
        
      
    
    {\displaystyle f:X\times Y\to \mathbb {R} }
  
 such that 
  
    
      
        g
      
    
    {\displaystyle g}
  
 is defined as returning the 
  
    
      
        y
      
    
    {\displaystyle y}
  
 value that gives the highest score: 
  
    
      
        g
        (
        x
        )
        =
        
          
            
              arg
              ⁡
              max
            
            y
          
        
        
        f
        (
        x
        ,
        y
        )
      
    
    {\displaystyle g(x)={\underset {y}{\arg \max }}\;f(x,y)}
  
. Let 
  
    
      
        F
      
    
    {\displaystyle F}
  
 denote the space of scoring functions.
</p><p>Although 
  
    
      
        G
      
    
    {\displaystyle G}
  
 and 
  
    
      
        F
      
    
    {\displaystyle F}
  
 can be any space of functions, many learning algorithms are probabilistic models where 
  
    
      
        g
      
    
    {\displaystyle g}
  
 takes the form of a <a href="/facts/Conditional_probability/QcN2UERV">conditional probability</a> model 
  
    
      
        g
        (
        x
        )
        =
        
          
            
              arg
              ⁡
              max
            
            y
          
        
        
        P
        (
        y
        
          |
        
        x
        )
      
    
    {\displaystyle g(x)={\underset {y}{\arg \max }}\;P(y|x)}
  
, or 
  
    
      
        f
      
    
    {\displaystyle f}
  
 takes the form of a <a href="/facts/Joint_probability/klX2ksGY">joint probability</a> model 
  
    
      
        f
        (
        x
        ,
        y
        )
        =
        P
        (
        x
        ,
        y
        )
      
    
    {\displaystyle f(x,y)=P(x,y)}
  
. For example, <a href="/facts/Naive_Bayes_classifier/FmNHI688">naive Bayes</a> and <a href="/facts/Linear_discriminant_analysis/Mj6KQhRN">linear discriminant analysis</a> are joint probability models, whereas <a href="/facts/Logistic_regression/mGj6mc8y">logistic regression</a> is a conditional probability model.
</p><p>There are two basic approaches to choosing 
  
    
      
        f
      
    
    {\displaystyle f}
  
 or 
  
    
      
        g
      
    
    {\displaystyle g}
  
: <a href="/facts/Empirical_risk_minimization/QIm8CRMC">empirical risk minimization</a> and <a href="/facts/Structural_risk_minimization/b9DG3Gnp">structural risk minimization</a>.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> Empirical risk minimization seeks the function that best fits the training data. Structural risk minimization includes a <i>penalty function</i> that controls the bias/variance tradeoff.
</p><p>In both cases, it is assumed that the training set consists of a sample of <a href="/facts/Independent_and_identically-distributed_random_variables/othIRaWt">independent and identically distributed pairs</a>, 
  
    
      
        (
        
          x
          
            i
          
        
        ,
        
        
          y
          
            i
          
        
        )
      
    
    {\displaystyle (x_{i},\;y_{i})}
  
. In order to measure how well a function fits the training data, a <a href="/facts/Loss_function/xv5ozuhl">loss function</a> 
  
    
      
        L
        :
        Y
        ×
        Y
        →
        
          
            R
          
          
            ≥
            0
          
        
      
    
    {\displaystyle L:Y\times Y\to \mathbb {R} ^{\geq 0}}
  
 is defined. For training example 
  
    
      
        (
        
          x
          
            i
          
        
        ,
        
        
          y
          
            i
          
        
        )
      
    
    {\displaystyle (x_{i},\;y_{i})}
  
, the loss of predicting the value 
  
    
      
        
          
            
              y
              ^
            
          
        
      
    
    {\displaystyle {\hat {y}}}
  
 is 
  
    
      
        L
        (
        
          y
          
            i
          
        
        ,
        
          
            
              y
              ^
            
          
        
        )
      
    
    {\displaystyle L(y_{i},{\hat {y}})}
  
.
</p><p>The <i>risk</i> 
  
    
      
        R
        (
        g
        )
      
    
    {\displaystyle R(g)}
  
 of function 
  
    
      
        g
      
    
    {\displaystyle g}
  
 is defined as the expected loss of 
  
    
      
        g
      
    
    {\displaystyle g}
  
. This can be estimated from the training data as
</p>

R
          
            e
            m
            p
          
        
        (
        g
        )
        =
        
          
            1
            N
          
        
        
          ∑
          
            i
          
        
        L
        (
        
          y
          
            i
          
        
        ,
        g
        (
        
          x
          
            i
          
        
        )
        )
      
    
    {\displaystyle R_{emp}(g)={\frac {1}{N}}\sum _{i}L(y_{i},g(x_{i}))}
  
.
<h3>Empirical risk minimization</h3>
<p class="note">Main article: <a href="/facts/Empirical_risk_minimization/QIm8CRMC">Empirical risk minimization</a></p>
<p>In empirical risk minimization, the supervised learning algorithm seeks the function 
  
    
      
        g
      
    
    {\displaystyle g}
  
 that minimizes 
  
    
      
        R
        (
        g
        )
      
    
    {\displaystyle R(g)}
  
. Hence, a supervised learning algorithm can be constructed by applying an <a href="/facts/Optimization_(mathematics)/oRn8Iv5I">optimization algorithm</a> to find 
  
    
      
        g
      
    
    {\displaystyle g}
  
.
</p><p>When 
  
    
      
        g
      
    
    {\displaystyle g}
  
 is a conditional probability distribution 
  
    
      
        P
        (
        y
        
          |
        
        x
        )
      
    
    {\displaystyle P(y|x)}
  
 and the loss function is the negative log likelihood: 
  
    
      
        L
        (
        y
        ,
        
          
            
              y
              ^
            
          
        
        )
        =
        −
        log
        ⁡
        P
        (
        y
        
          |
        
        x
        )
      
    
    {\displaystyle L(y,{\hat {y}})=-\log P(y|x)}
  
, then empirical risk minimization is equivalent to <a href="/facts/Maximum_likelihood/0Yq2dpQD">maximum likelihood estimation</a>.
</p><p>When 
  
    
      
        G
      
    
    {\displaystyle G}
  
 contains many candidate functions or the training set is not sufficiently large, empirical risk minimization leads to high variance and poor generalization. The learning algorithm is able to memorize the training examples without generalizing well (overfitting).
</p>
<h3>Structural risk minimization</h3>
<p><a href="/facts/Structural_risk_minimization/b9DG3Gnp">Structural risk minimization</a> seeks to prevent overfitting by incorporating a <a href="/facts/Regularization_(mathematics)/K601A3y2">regularization penalty</a> into the optimization. The regularization penalty can be viewed as implementing a form of <a href="/facts/Occam%27s_razor/KG1Bx0J9">Occam's razor</a> that prefers simpler functions over more complex ones.
</p><p>A wide variety of penalties have been employed that correspond to different definitions of complexity. For example, consider the case where the function 
  
    
      
        g
      
    
    {\displaystyle g}
  
 is a linear function of the form
</p>

g
        (
        x
        )
        =
        
          ∑
          
            j
            =
            1
          
          
            d
          
        
        
          β
          
            j
          
        
        
          x
          
            j
          
        
      
    
    {\displaystyle g(x)=\sum _{j=1}^{d}\beta _{j}x_{j}}
  
.
<p>A popular regularization penalty is 
  
    
      
        
          ∑
          
            j
          
        
        
          β
          
            j
          
          
            2
          
        
      
    
    {\displaystyle \sum _{j}\beta _{j}^{2}}
  
, which is the squared <a href="/facts/Euclidean_norm/R2UbzmzM">Euclidean norm</a> of the weights, also known as the 
  
    
      
        
          L
          
            2
          
        
      
    
    {\displaystyle L_{2}}
  
 norm. Other norms include the 
  
    
      
        
          L
          
            1
          
        
      
    
    {\displaystyle L_{1}}
  
 norm, 
  
    
      
        
          ∑
          
            j
          
        
        
          |
        
        
          β
          
            j
          
        
        
          |
        
      
    
    {\displaystyle \sum _{j}|\beta _{j}|}
  
, and the <a href="/facts/L0_%22norm%22/xIbR4uE1">
  
    
      
        
          L
          
            0
          
        
      
    
    {\displaystyle L_{0}}
  
 "norm"</a>, which is the number of non-zero 
  
    
      
        
          β
          
            j
          
        
      
    
    {\displaystyle \beta _{j}}
  
s. The penalty will be denoted by 
  
    
      
        C
        (
        g
        )
      
    
    {\displaystyle C(g)}
  
.
</p><p>The supervised learning optimization problem is to find the function 
  
    
      
        g
      
    
    {\displaystyle g}
  
 that minimizes
</p>

J
        (
        g
        )
        =
        
          R
          
            e
            m
            p
          
        
        (
        g
        )
        +
        λ
        C
        (
        g
        )
        .
      
    
    {\displaystyle J(g)=R_{emp}(g)+\lambda C(g).}

<p>The parameter 
  
    
      
        λ
      
    
    {\displaystyle \lambda }
  
 controls the bias-variance tradeoff. When 
  
    
      
        λ
        =
        0
      
    
    {\displaystyle \lambda =0}
  
, this gives empirical risk minimization with low bias and high variance. When 
  
    
      
        λ
      
    
    {\displaystyle \lambda }
  
 is large, the learning algorithm will have high bias and low variance. The value of 
  
    
      
        λ
      
    
    {\displaystyle \lambda }
  
 can be chosen empirically via <a href="/facts/Cross-validation_(statistics)/pDWg8s0e"> cross-validation</a>.
</p><p>The complexity penalty has a Bayesian interpretation as the negative log prior probability of 
  
    
      
        g
      
    
    {\displaystyle g}
  
, 
  
    
      
        −
        log
        ⁡
        P
        (
        g
        )
      
    
    {\displaystyle -\log P(g)}
  
, in which case 
  
    
      
        J
        (
        g
        )
      
    
    {\displaystyle J(g)}
  
 is the <a href="/facts/Posterior_probability/fojsMD0D">posterior probability</a> of 
  
    
      
        g
      
    
    {\displaystyle g}
  
.
</p>
<h2 id="generative-training">Generative training</h2>
<p>The training methods described above are <i>discriminative training</i> methods, because they seek to find a function 
  
    
      
        g
      
    
    {\displaystyle g}
  
 that discriminates well between the different output values (see <a href="/facts/Discriminative_model/hPGxBneP">discriminative model</a>). For the special case where 
  
    
      
        f
        (
        x
        ,
        y
        )
        =
        P
        (
        x
        ,
        y
        )
      
    
    {\displaystyle f(x,y)=P(x,y)}
  
 is a <a href="/facts/Joint_probability_distribution/klX2ksGY">joint probability distribution</a> and the loss function is the negative log likelihood 
  
    
      
        −
        
          ∑
          
            i
          
        
        log
        ⁡
        P
        (
        
          x
          
            i
          
        
        ,
        
          y
          
            i
          
        
        )
        ,
      
    
    {\displaystyle -\sum _{i}\log P(x_{i},y_{i}),}
  
 a risk minimization algorithm is said to perform <i>generative training</i>, because 
  
    
      
        f
      
    
    {\displaystyle f}
  
 can be regarded as a <a href="/facts/Generative_model/JUgExNIP">generative model</a> that explains how the data were generated. Generative training algorithms are often simpler and more computationally efficient than discriminative training algorithms. In some cases, the solution can be computed in closed form as in <a href="/facts/Naive_Bayes_classifier/FmNHI688">naive Bayes</a> and <a href="/facts/Linear_discriminant_analysis/Mj6KQhRN">linear discriminant analysis</a>.
</p>
<h2 id="generalizations">Generalizations</h2>
<p>There are several ways in which the standard supervised learning problem can be generalized:
</p><ul><li><a href="/facts/Semi-supervised_learning/4mzcqFjI">Semi-supervised learning</a> or <a href="/facts/Weak_supervision/3EAoE32F">weak supervision</a>: the desired output values are provided only for a subset of the training data. The remaining data is unlabeled or imprecisely labeled.</li>
<li><a href="/facts/Active_learning_(machine_learning)/wWoXGdCV">Active learning</a>: Instead of assuming that all of the training examples are given at the start, active learning algorithms interactively collect new examples, typically by making queries to a human user. Often, the queries are based on unlabeled data, which is a scenario that combines semi-supervised learning with active learning.</li>
<li><a href="/facts/Structured_prediction/hqe45TQD">Structured prediction</a>: When the desired output value is a complex object, such as a <a href="/facts/Parse_tree/FeBEtXcz">parse tree</a> or a labeled graph, then standard methods must be extended.</li>
<li><a href="/facts/Learning_to_rank/4Js3B8LG">Learning to rank</a>: When the input is a set of objects and the desired output is a ranking of those objects, then again the standard methods must be extended.</li></ul>
<h2 id="approaches-and-algorithms">Approaches and algorithms</h2>
<ul><li>Analytical learning</li>
<li><a href="/facts/Artificial_neural_network/6V1jMlkx">Artificial neural network</a></li>
<li><a href="/facts/Backpropagation/lCsIdKHc">Backpropagation</a></li>
<li><a href="/facts/Boosting_(meta-algorithm)/HgejTPPu">Boosting (meta-algorithm)</a></li>
<li><a href="/facts/Bayesian_statistics/9w7b1Bw4">Bayesian statistics</a></li>
<li><a href="/facts/Case-based_reasoning/JkxLXCqF">Case-based reasoning</a></li>
<li><a href="/facts/Decision_tree_learning/LbPMAwdI">Decision tree learning</a></li>
<li><a href="/facts/Inductive_logic_programming/gKc9Nxq4">Inductive logic programming</a></li>
<li><a href="/facts/Gaussian_process_regression/Rk7X4qP5">Gaussian process regression</a></li>
<li><a href="/facts/Genetic_programming/kGa2jr0w">Genetic programming</a></li>
<li><a href="/facts/Group_method_of_data_handling/kpk97NQL">Group method of data handling</a></li>
<li><a href="/facts/Variable_kernel_density_estimation/dAmHva6y">Kernel estimators</a></li>
<li><a href="/facts/Learning_automaton/E4c0sfaH">Learning automata</a></li>
<li><a href="/facts/Learning_classifier_system/KrJGL5QN">Learning classifier systems</a></li>
<li><a href="/facts/Learning_vector_quantization/xs7Pk0pe">Learning vector quantization</a></li>
<li><a href="/facts/Minimum_message_length/GqS4Tydg">Minimum message length</a> (<a href="/facts/Decision_tree/XDVeGlkJ">decision trees</a>, decision graphs, etc.)</li>
<li><a href="/facts/Multilinear_subspace_learning/B2mIlGQQ">Multilinear subspace learning</a></li>
<li><a href="/facts/Naive_Bayes_classifier/FmNHI688">Naive Bayes classifier</a></li>
<li><a href="/facts/Maximum_entropy_classifier/aeF5lqDE">Maximum entropy classifier</a></li>
<li><a href="/facts/Conditional_random_field/TNuLaGzM">Conditional random field</a></li>
<li><a href="/facts/Nearest_neighbor_(pattern_recognition)/Bs1UaAmE">Nearest neighbor algorithm</a></li>
<li><a href="/facts/Probably_approximately_correct_learning/vBQlvDV1">Probably approximately correct learning</a> (PAC) learning</li>
<li><a href="/facts/Ripple_down_rules/tUrg8HJS">Ripple down rules</a>, a knowledge acquisition methodology</li>
<li>Symbolic machine learning algorithms</li>
<li>Subsymbolic machine learning algorithms</li>
<li><a href="/facts/Support_vector_machine/XobxpdBG">Support vector machines</a></li>
<li>Minimum complexity machines (MCM)</li>
<li><a href="/facts/Random_forest/Ff1ppJEQ">Random forests</a></li>
<li><a href="/facts/Ensembles_of_classifiers/GvFsd3Qc">Ensembles of classifiers</a></li>
<li><a href="/facts/Ordinal_classification/8GAxPxFv">Ordinal classification</a></li>
<li><a href="/facts/Data_pre-processing/CS2W8m5B">Data pre-processing</a></li>
<li>Handling imbalanced datasets</li>
<li><a href="/facts/Statistical_relational_learning/tFA87qG1">Statistical relational learning</a></li>
<li><a href="/facts/Proaftn/YRxGL4Kp">Proaftn</a>, a multicriteria classification algorithm</li></ul>
<h2 id="applications">Applications</h2>
<ul><li><a href="/facts/Bioinformatics/D5x2L8ee">Bioinformatics</a></li>
<li><a href="/facts/Cheminformatics/BwBkT11c">Cheminformatics</a>
<ul><li><a href="/facts/Quantitative_structure%E2%80%93activity_relationship/6RDyCQDD">Quantitative structure–activity relationship</a></li></ul></li>
<li><a href="/facts/Database_marketing/3e8qHEpt">Database marketing</a></li>
<li><a href="/facts/Handwriting_recognition/RgdyWtDQ">Handwriting recognition</a></li>
<li><a href="/facts/Information_retrieval/MFSmpeNw">Information retrieval</a>
<ul><li><a href="/facts/Learning_to_rank/4Js3B8LG">Learning to rank</a></li></ul></li>
<li><a href="/facts/Information_extraction/DL9nMD2X">Information extraction</a></li>
<li>Object recognition in <a href="/facts/Computer_vision/Tl2Yyk66">computer vision</a></li>
<li><a href="/facts/Optical_character_recognition/kdTyxa1l">Optical character recognition</a></li>
<li><a href="/facts/Spamming/Qc9IL60W">Spam detection</a></li>
<li><a href="/facts/Pattern_recognition/o1s38opj">Pattern recognition</a></li>
<li><a href="/facts/Speech_recognition/z7S7Pgk6">Speech recognition</a></li>
<li>Supervised learning is a special case of <a href="/facts/Downward_causation/33Nk0B68">downward causation</a> in biological systems</li>
<li>Landform classification using <a href="/facts/Satellite_imagery/V8LQh7jI">satellite imagery</a><a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></li>
<li>Spend classification in <a href="/facts/Procurement/y35C00fn">procurement</a> processes<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a></li></ul>
<h2 id="general-issues">General issues</h2>
<ul><li><a href="/facts/Computational_learning_theory/DKMoukIr">Computational learning theory</a></li>
<li><a href="/facts/Inductive_bias/QRYNe0g0">Inductive bias</a></li>
<li><a href="/facts/Overfitting/5xnFLcMg">Overfitting</a></li>
<li>(Uncalibrated) <a href="/facts/Class_membership_probabilities/eBJR4laB">class membership probabilities</a></li>
<li><a href="/facts/Version_space/d8SSLoQS">Version spaces</a></li></ul>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/List_of_datasets_for_machine-learning_research/exRn8tb7">List of datasets for machine-learning research</a></li>
<li><a href="/facts/Unsupervised_learning/8a6f61MC">Unsupervised learning</a></li></ul>

<h2 id="external-links">External links</h2>
<ul><li><a href="http://www.mloss.org/">Machine Learning Open Source Software (MLOSS)</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar (2012) Foundations of Machine Learning, The MIT Press ISBN 9780262018258. <a href="/wiki/Mehryar_Mohri" target="_blank">/wiki/Mehryar_Mohri</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>S. Geman, E. Bienenstock, and R. Doursat (1992). Neural networks and the bias/variance dilemma. Neural Computation 4, 1–58. <a href="http://delta-apache-vm.cs.tau.ac.il/~nin/Courses/NC06/VarbiasBiasGeman.pdf" target="_blank">http://delta-apache-vm.cs.tau.ac.il/~nin/Courses/NC06/VarbiasBiasGeman.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>G. James (2003) Variance and Bias for General Loss Functions, Machine Learning 51, 115-135. (http://www-bcf.usc.edu/~gareth/research/bv.pdf) <a href="http://www-bcf.usc.edu/~gareth/research/bv.pdf" target="_blank">http://www-bcf.usc.edu/~gareth/research/bv.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>C.E. Brodely and M.A. Friedl (1999). Identifying and Eliminating Mislabeled Training Instances, Journal of Artificial Intelligence Research 11, 131-167. (http://jair.org/media/606/live-606-1803-jair.pdf) <a href="http://jair.org/media/606/live-606-1803-jair.pdf" target="_blank">http://jair.org/media/606/live-606-1803-jair.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>M.R. Smith and T. Martinez (2011). "Improving Classification Accuracy by Identifying and Removing Instances that Should Be Misclassified". Proceedings of International Joint Conference on Neural Networks (IJCNN 2011). pp. 2690–2697. CiteSeerX 10.1.1.221.1371. doi:10.1109/IJCNN.2011.6033571. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Vapnik, V. N. The Nature of Statistical Learning Theory (2nd Ed.), Springer Verlag, 2000. <a href="https://books.google.com/books?id=EqgACAAAQBAJ&q=%22empirical+risk+minimization%22+OR+%22structural+risk+minimization%22" target="_blank">https://books.google.com/books?id=EqgACAAAQBAJ&q=%22empirical+risk+minimization%22+OR+%22structural+risk+minimization%22</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>A. Maity (2016). "Supervised Classification of RADARSAT-2 Polarimetric Data for Different Land Features". arXiv:1608.00501 [cs.CV]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
<li id="fn:8"><p>"Key Technologies for Agile Procurement | SIPMM Publications". publication.sipmm.edu.sg. 2020-10-09. Retrieved 2022-06-16. <a href="https://publication.sipmm.edu.sg/key-technologies-agile-procurement/" target="_blank">https://publication.sipmm.edu.sg/key-technologies-agile-procurement/</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li>
</ol>

Supervised learning open-in-new

Supervised learning