Unsupervised learning

<h2 id="tasks">Tasks</h2>
<p>Tasks are often categorized as <a href="/facts/Discriminative_model/hPGxBneP">discriminative</a> (recognition) or <a href="/facts/Generative_model/JUgExNIP">generative</a> (imagination).  Often but not always, discriminative tasks use supervised methods and generative tasks use unsupervised (see <a href="/facts/Venn_diagram/Vkh8fVtD">Venn diagram</a>); however, the separation is very hazy.  For example, object recognition favors supervised learning but unsupervised learning can also cluster objects into groups.  Furthermore, as progress marches onward, some tasks employ both methods, and some tasks swing from one to another.  For example, image recognition started off as heavily supervised, but became hybrid by employing unsupervised pre-training, and then moved towards supervision again with the advent of <a href="/facts/Dilution_(neural_networks)/HvqnkJpt">dropout</a>, <a href="/facts/Rectifier_(neural_networks)/pwzdU9jF">ReLU</a>, and <a href="/facts/Learning_rate/EClSgMCR">adaptive learning rates</a>.
</p><p>A typical generative task is as follows. At each step, a datapoint is sampled from the dataset, and part of the data is removed, and the model must infer the removed part. This is particularly clear for the <a href="/facts/Autoencoder/jnTqhtm9">denoising autoencoders</a> and <a href="/facts/BERT_(language_model)/rDSueM4E">BERT</a>.
</p>
<h2 id="neural-network-architectures">Neural network architectures</h2>
<h3>Training</h3>
<p>During the learning phase, an unsupervised network tries to mimic the data it's given and uses the error in its mimicked output to correct itself (i.e. correct its weights and biases). Sometimes the error is expressed as a low probability that the erroneous output occurs, or it might be expressed as an unstable high energy state in the network.
</p><p>In contrast to supervised methods' dominant use of <a href="/facts/Backpropagation/lCsIdKHc">backpropagation</a>, unsupervised learning also employs other methods  including: Hopfield learning rule, Boltzmann learning rule, <a href="/facts/Contrastive_Divergence/D5afVGCs">Contrastive Divergence</a>, <a href="/facts/Wake-sleep_algorithm/JeWMmXq6">Wake Sleep</a>, <a href="/facts/Variational_Inference/pFuMLBcU">Variational Inference</a>, <a href="/facts/Maximum_Likelihood/0Yq2dpQD">Maximum Likelihood</a>, <a href="/facts/Maximum_A_Posteriori/Y5zHyqfX">Maximum A Posteriori</a>, <a href="/facts/Gibbs_Sampling/HDYRhxEq">Gibbs Sampling</a>, and backpropagating reconstruction errors or hidden state reparameterizations. See the table below for more details.
</p>
<h3>Energy</h3>
<p>An energy function is a macroscopic measure of a network's activation state.  In Boltzmann machines, it plays the role of the Cost function.  This analogy with physics is inspired by Ludwig Boltzmann's analysis of a gas' macroscopic energy from the microscopic probabilities of particle motion 
  
    
      
        p
        ∝
        
          e
          
            −
            E
            
              /
            
            k
            T
          
        
      
    
    {\displaystyle p\propto e^{-E/kT}}
  
, where k is the Boltzmann constant and T is temperature. In the <a href="/facts/Restricted_Boltzmann_machine/D5afVGCs">RBM</a> network the relation is 
  
    
      
        p
        =
        
          e
          
            −
            E
          
        
        
          /
        
        Z
      
    
    {\displaystyle p=e^{-E}/Z}
  
,<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> where 
  
    
      
        p
      
    
    {\displaystyle p}
  
 and 
  
    
      
        E
      
    
    {\displaystyle E}
  
 vary over every possible activation pattern and 
  
    
      
        
          
            Z
            =
            
              ∑
              
                
                  
                    All Patterns
                  
                
              
            
            
              e
              
                −
                E
                (
                
                  pattern
                
                )
              
            
          
        
      
    
    {\displaystyle \textstyle {Z=\sum _{\scriptscriptstyle {\text{All Patterns}}}e^{-E({\text{pattern}})}}}
  
. To be more precise, 
  
    
      
        p
        (
        a
        )
        =
        
          e
          
            −
            E
            (
            a
            )
          
        
        
          /
        
        Z
      
    
    {\displaystyle p(a)=e^{-E(a)}/Z}
  
, where 
  
    
      
        a
      
    
    {\displaystyle a}
  
 is an activation pattern of all neurons (visible and hidden). Hence, some early neural networks bear the name Boltzmann Machine.  Paul Smolensky calls 
  
    
      
        −
        E
        
      
    
    {\displaystyle -E\,}
  
 the <i>Harmony</i>. A network seeks low energy which is high Harmony.
</p>
<h3>Networks</h3>
<p>This table shows connection diagrams of various unsupervised networks, the details of which will be given in the section Comparison of Networks.  Circles are neurons and edges between them are connection weights.  As network design changes, features are added on to enable new capabilities or removed to make learning faster.  For instance, neurons change between deterministic (Hopfield) and stochastic (Boltzmann) to allow robust output, weights are removed within a layer (RBM) to hasten learning, or connections are allowed to become asymmetric (Helmholtz).
</p>
<table><tbody><tr><th><a href="/facts/Hopfield_network/xUBr6rpm">Hopfield</a></th><th><a href="/facts/Boltzmann_machine/2wyLI0pI">Boltzmann</a></th><th><a href="/facts/Restricted_Boltzmann_machine/D5afVGCs">RBM</a></th><th><a href="/facts/Stacked_Restricted_Boltzmann_Machine/D5afVGCs">Stacked Boltzmann</a></th></tr><tr><td></td><td></td><td></td><td></td></tr></tbody></table>
<table><tbody><tr><th><a href="/facts/Helmholtz_machine/E5G0Wzpg">Helmholtz</a></th><th><a href="/facts/Autoencoder/jnTqhtm9">Autoencoder</a></th><th><a href="/facts/Variational_autoencoder/I5wBbYpR">VAE</a></th></tr><tr><td></td><td></td><td></td></tr></tbody></table>
<p>Of the networks bearing people's names, only Hopfield worked directly with neural networks.  Boltzmann and Helmholtz came before artificial neural networks, but their work in physics and physiology inspired the analytical methods that were used.
</p>
<h3>History</h3>
<table><tbody><tr><td>1974</td><td>Ising magnetic model proposed by WA Little [de] for cognition</td></tr><tr><td>1980</td><td><a href="/facts/Kunihiko_Fukushima/lEjNNvI2">Kunihiko Fukushima</a> introduces the <a href="/facts/Neocognitron/W7AmETp2">neocognitron</a>, which is later called a <a href="/facts/Convolutional_neural_network/kHEdnmGU">convolutional neural network</a>. It is mostly used in SL, but deserves a mention here.</td></tr><tr><td>1982</td><td>Ising variant Hopfield net described as <a href="/facts/Content-addressable_memory/VteSPHMR">CAMs</a> and classifiers by John Hopfield.</td></tr><tr><td>1983</td><td>Ising variant Boltzmann machine with probabilistic neurons described by <a href="/facts/Geoffrey_Hinton/HJU6lC2H">Hinton</a> & <a href="/facts/Terry_Sejnowski/rckEWrwp">Sejnowski</a> following Sherington & Kirkpatrick's 1975 work.</td></tr><tr><td>1986</td><td><a href="/facts/Paul_Smolensky/JrsCWlwT">Paul Smolensky</a> publishes Harmony Theory, which is an RBM with practically the same Boltzmann energy function. Smolensky did not give a practical training scheme. Hinton did in mid-2000s.</td></tr><tr><td>1995</td><td>Schmidthuber introduces the <a href="/facts/Long_short-term_memory/NBBVEoft">LSTM</a> neuron for languages.</td></tr><tr><td>1995</td><td>Dayan & Hinton introduces Helmholtz machine</td></tr><tr><td>2013</td><td>Kingma, Rezende, & co. introduced Variational Autoencoders as Bayesian graphical probability network, with neural nets as components.</td></tr></tbody></table>
<h3>Specific Networks</h3>
<p>Here, we highlight some characteristics of select networks.  The details of each are given in the comparison table below.
</p>

<a href="/facts/Hopfield_Network/xUBr6rpm">Hopfield Network</a>
Ferromagnetism inspired Hopfield networks.  A neuron correspond to an iron domain with binary magnetic moments Up and Down, and neural connections correspond to the domain's influence on each other.  Symmetric connections enable a global energy formulation. During inference the network updates each state using the standard activation step function. Symmetric weights and the right energy functions guarantees convergence to a stable activation pattern.  Asymmetric weights are difficult to analyze.  Hopfield nets are used as Content Addressable Memories (CAM).

<a href="/facts/Boltzmann_Machine/2wyLI0pI">Boltzmann Machine</a>
These are stochastic Hopfield nets. Their state value is sampled from this <a href="/facts/Probability_density_function/zvfybna4">pdf</a> as follows: suppose a binary neuron fires with the Bernoulli probability p(1) = 1/3 and rests with p(0) = 2/3. One samples from it by taking a <i>uniformly</i> distributed random number y, and plugging it into the inverted <a href="/facts/Cumulative_distribution_function/WaKU8tp4">cumulative distribution function</a>, which in this case is the step function thresholded at 2/3. The inverse function = { 0 if x <= 2/3, 1 if x > 2/3 }.

Sigmoid Belief Net
Introduced by Radford Neal in 1992, this network applies ideas from probabilistic graphical models to neural networks.  A key difference is that nodes in graphical models have pre-assigned meanings, whereas Belief Net neurons' features are determined after training. The network is a sparsely connected directed acyclic graph composed of binary stochastic neurons.  The learning rule comes from Maximum Likelihood on p(X):  Δwij 
  
    
      
        ∝
      
    
    {\displaystyle \propto }
  
 sj * (si - pi), where pi = 1 / ( 1 + eweighted inputs into neuron i ).  sj's are activations from an unbiased sample of the posterior distribution and this is problematic due to the Explaining Away problem raised by Judea Perl.  <a href="/facts/Variational_Bayesian_methods/pFuMLBcU">Variational Bayesian methods</a> uses a surrogate posterior and blatantly disregard this complexity.

<a href="/facts/Deep_Belief_Network/aPkAjLIU">Deep Belief Network</a>
Introduced by Hinton, this network is a hybrid of RBM and Sigmoid Belief Network.  The top 2 layers is an RBM and the second layer downwards form a sigmoid belief network.  One trains it by the <a href="/facts/Stacked_Restricted_Boltzmann_Machine/D5afVGCs">stacked RBM</a> method and then throw away the recognition weights below the top RBM.  As of 2009, 3-4 layers seems to be the optimal depth.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a>

<a href="/facts/Helmholtz_machine/E5G0Wzpg">Helmholtz machine</a>
These are early inspirations for the Variational Auto Encoders. Its 2 networks combined into one—forward weights operates recognition and backward weights implements imagination. It is perhaps the first network to do both. Helmholtz did not work in machine learning but he inspired the view of "statistical inference engine whose function is to infer probable causes of sensory input".<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> the stochastic binary neuron outputs a probability that its state is 0 or 1. The data input is normally not considered a layer, but in the Helmholtz machine generation mode, the data layer receives input from the middle layer and has separate weights for this purpose, so it is considered a layer. Hence this network has 3 layers.

<a href="/facts/Variational_autoencoder/I5wBbYpR">Variational autoencoder</a>
These are inspired by Helmholtz machines and combines probability network with neural networks. An Autoencoder is a 3-layer CAM network, where the middle layer is supposed to be some internal representation of input patterns. The encoder neural network is a probability distribution qφ(z given x) and the decoder network is pθ(x given z). The weights are named phi & theta rather than W and V as in Helmholtz—a cosmetic difference. These 2 networks here can be fully connected, or use another NN scheme.

<h3>Comparison of networks</h3>
<table><tbody><tr><th></th><th>Hopfield</th><th>Boltzmann</th><th>RBM</th><th>Stacked RBM</th><th>Helmholtz</th><th>Autoencoder</th><th>VAE</th></tr><tr><td>Usage & notables</td><td>CAM, traveling salesman problem</td><td>CAM. The freedom of connections makes this network difficult to analyze.</td><td>pattern recognition. used in MNIST digits and speech.</td><td>recognition & imagination.   trained with unsupervised pre-training and/or supervised fine tuning.</td><td>imagination, mimicry</td><td>language: creative writing, translation.  vision: enhancing blurry images</td><td>generate realistic data</td></tr><tr><td>Neuron</td><td>deterministic binary state. Activation = { 0 (or -1) if x is negative, 1 otherwise }</td><td>stochastic binary Hopfield neuron</td><td>← same. (extended to real-valued in mid 2000s)</td><td>← same</td><td>← same</td><td>language: LSTM. vision: local receptive fields. usually real valued relu activation.</td><td>middle layer neurons encode means & variances for Gaussians.  In run mode (inference), the output of the middle layer are sampled values from the Gaussians.</td></tr><tr><td>Connections</td><td>1-layer with symmetric weights. No self-connections.</td><td>2-layers. 1-hidden & 1-visible. symmetric weights.</td><td>← same. no lateral connections within a layer.</td><td>top layer is undirected, symmetric.  other layers are 2-way, asymmetric.</td><td>3-layers: asymmetric weights. 2 networks combined into 1.</td><td>3-layers. The input is considered a layer even though it has no inbound weights. recurrent layers for NLP. feedforward convolutions for vision. input & output have the same neuron counts.</td><td>3-layers: input, encoder, distribution sampler decoder. the sampler is not considered a layer</td></tr><tr><td>Inference & energy</td><td>Energy is given by Gibbs probability measure :                    E        =        −                              1            2                                    ∑                      i            ,            j                                                w                          i              j                                                          s                              i                                                                        s                              j                                                    +                  ∑                      i                                                θ                          i                                                            s                          i                                            {\displaystyle E=-{\frac {1}{2}}\sum _{i,j}{w_{ij}{s_{i}}{s_{j}}}+\sum _{i}{\theta _{i}}{s_{i}}}  </td><td>← same</td><td>← same</td><td></td><td>minimize KL divergence</td><td>inference is only feed-forward. previous UL networks ran forwards AND backwards</td><td>minimize error = reconstruction error - KLD</td></tr><tr><td>Training</td><td>Δwij = si*sj, for +1/-1 neuron</td><td>Δwij = e*(pij - p'ij). This is derived from minimizing KLD. e = learning rate, p' = predicted and p = actual distribution.</td><td>Δwij = e*( < vi hj >data - < vi hj >equilibrium ).  This is a form of contrastive divergence w/ Gibbs Sampling.  "<>" are expectations.</td><td>← similar. train 1-layer at a time.  approximate equilibrium state with a 3-segment pass.  no back propagation.</td><td>wake-sleep 2 phase training</td><td>back propagate the reconstruction error</td><td>reparameterize hidden state for backprop</td></tr><tr><td>Strength</td><td>resembles physical systems so it inherits their equations</td><td>← same. hidden neurons act as internal representatation of the external world</td><td>faster more practical training scheme than Boltzmann machines</td><td>trains quickly.  gives hierarchical layer of features</td><td>mildly anatomical. analyzable w/ information theory & statistical mechanics</td><td></td><td></td></tr><tr><td>Weakness</td><td></td><td>hard to train due to lateral connections</td><td>equilibrium requires too many iterations</td><td>integer & real-valued neurons are more complicated.</td><td></td><td></td><td></td></tr></tbody></table>
<h3>Hebbian Learning, ART, SOM</h3>
<p>The classical example of unsupervised learning in the study of neural networks is <a href="/facts/Donald_Hebb/D4a9dIuB">Donald Hebb</a>'s principle, that is, neurons that fire together wire together.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> In <a href="/facts/Hebbian_learning/Mmtd6Dzt">Hebbian learning</a>, the connection is reinforced irrespective of an error, but is exclusively a function of the coincidence between action potentials between the two neurons.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> A similar version that modifies synaptic weights takes into account the time between the action potentials (<a href="/facts/Spike-timing-dependent_plasticity/pfCGUP9Q">spike-timing-dependent plasticity</a> or STDP). Hebbian Learning has been hypothesized to underlie a range of cognitive functions, such as <a href="/facts/Pattern_recognition/o1s38opj">pattern recognition</a> and experiential learning.
</p><p>Among <a href="/facts/Artificial_neural_network/6V1jMlkx">neural network</a> models, the <a href="/facts/Self-organizing_map/uuMRbpkl">self-organizing map</a> (SOM) and <a href="/facts/Adaptive_resonance_theory/X136MqFg">adaptive resonance theory</a> (ART) are commonly used in unsupervised learning algorithms. The SOM is a topographic organization in which nearby locations in the map represent inputs with similar properties. The ART model allows the number of clusters to vary with problem size and lets the user control the degree of similarity between members of the same clusters by means of a user-defined constant called the vigilance parameter. ART networks are used for many pattern recognition tasks, such as <a href="/facts/Automatic_target_recognition/fH8ySeJd">automatic target recognition</a> and seismic signal processing.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a>
</p>
<h2 id="probabilistic-methods">Probabilistic methods</h2>
<p>Two of the main methods used in unsupervised learning are <a href="/facts/Principal_component_analysis/pCbVTqdR">principal component</a> and <a href="/facts/Cluster_analysis/HUeDnWPt">cluster analysis</a>. <a href="/facts/Cluster_analysis/HUeDnWPt">Cluster analysis</a> is used in unsupervised learning to group, or segment, datasets with shared attributes in order to extrapolate algorithmic relationships.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> Cluster analysis is a branch of <a href="/facts/Machine_learning/e0w0XJTu">machine learning</a> that groups the data that has not been <a href="/facts/Labeled_data/o0doUSPA">labelled</a>, classified or categorized. Instead of responding to feedback, cluster analysis identifies commonalities in the data and reacts based on the presence or absence of such commonalities in each new piece of data. This approach helps detect anomalous data points that do not fit into either group.
</p><p>A central application of unsupervised learning is in the field of <a href="/facts/Density_estimation/YthqJssX">density estimation</a> in <a href="/facts/Statistics/DNPsKGYU">statistics</a>,<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> though unsupervised learning encompasses many other domains involving summarizing and explaining data features. It can be contrasted with supervised learning by saying that whereas supervised learning intends to infer a <a href="/facts/Conditional_probability_distribution/0eGm3P9W">conditional probability distribution</a>  conditioned on the label  of input data; unsupervised learning intends to infer an <a href="/facts/A_priori_probability/UvycdVT2">a priori probability</a> distribution .
</p>
<h3>Approaches</h3>
<p>Some of the most common algorithms used in unsupervised learning include: (1) Clustering, (2) Anomaly detection, (3) Approaches for learning latent variable models. Each approach uses several methods as follows:
</p>
<ul><li><a href="/facts/Data_clustering/HUeDnWPt">Clustering</a> methods include: <a href="/facts/Hierarchical_clustering/KxXs6GPK">hierarchical clustering</a>,<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> <a href="/facts/K-means/vxIcqHwN">k-means</a>,<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> <a href="/facts/Mixture_models/WWe6TJlg">mixture models</a>, <a href="/facts/Model-based_clustering/zkVRu6qS">model-based clustering</a>, <a href="/facts/DBSCAN/EKKoHRkM">DBSCAN</a>, and <a href="/facts/OPTICS_algorithm/NqbewAnI">OPTICS algorithm</a></li>
<li><a href="/facts/Anomaly_detection/wjEGMGGz">Anomaly detection</a> methods include: <a href="/facts/Local_Outlier_Factor/bT3HfymN">Local Outlier Factor</a>, and <a href="/facts/Isolation_Forest/73QvVNfy">Isolation Forest</a></li>
<li>Approaches for learning <a href="/facts/Latent_variable_model/FCcgtsmc">latent variable models</a> such as <a href="/facts/Expectation%25E2%2580%2593maximization_algorithm/32P2bdBc">Expectation–maximization algorithm</a> (EM), <a href="/facts/Method_of_moments_(statistics)/Qfso3fMe">Method of moments</a>, and <a href="/facts/Blind_signal_separation/lrwEWUTC">Blind signal separation</a> techniques (<a href="/facts/Principal_component_analysis/pCbVTqdR">Principal component analysis</a>, <a href="/facts/Independent_component_analysis/gsdVaDFR">Independent component analysis</a>, <a href="/facts/Non-negative_matrix_factorization/DIBLH8B0">Non-negative matrix factorization</a>, <a href="/facts/Singular_value_decomposition/8t3v6wk3">Singular value decomposition</a>)</li></ul>
<h3>Method of moments</h3>
<p>One of the statistical approaches for unsupervised learning is the <a href="/facts/Method_of_moments_(statistics)/Qfso3fMe">method of moments</a>. In the method of moments, the unknown parameters (of interest) in the model are related to the moments of one or more random variables, and thus, these unknown parameters can be estimated given the moments. The moments are usually estimated from samples empirically. The basic moments are first and second order moments. For a random vector, the first order moment is the <a href="/facts/Mean/swcEd4Pg">mean</a> vector, and the second order moment is the <a href="/facts/Covariance_matrix/kLhgjHC6">covariance matrix</a> (when the mean is zero). Higher order moments are usually represented using <a href="/facts/Tensors/pNjFo5tV">tensors</a> which are the generalization of matrices to higher orders as multi-dimensional arrays.
</p><p>In particular, the method of moments is shown to be effective in learning the parameters of <a href="/facts/Latent_variable_model/FCcgtsmc">latent variable models</a>. Latent variable models are statistical models where in addition to the observed variables, a set of latent variables also exists which is not observed. A highly practical example of latent variable models in machine learning is the <a href="/facts/Topic_modeling/aCAuIjwe">topic modeling</a> which is a statistical model for generating the words (observed variables) in the document based on the topic (latent variable) of the document. In the topic modeling, the words in the document are generated according to different statistical parameters when the topic of the document is changed. It is shown that method of moments (tensor decomposition techniques) consistently recover the parameters of a large class of latent variable models under some assumptions.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a>
</p><p>The <a href="/facts/Expectation%25E2%2580%2593maximization_algorithm/32P2bdBc">Expectation–maximization algorithm</a> (EM) is also one of the most practical methods for learning latent variable models. However, it can get stuck in local optima, and it is not guaranteed that the algorithm will converge to the true unknown parameters of the model. In contrast, for the method of moments, the global convergence is guaranteed under some conditions.
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Automated_machine_learning/7MRUSKHq">Automated machine learning</a></li>
<li><a href="/facts/Cluster_analysis/HUeDnWPt">Cluster analysis</a></li>
<li><a href="/facts/Model-based_clustering/zkVRu6qS">Model-based clustering</a></li>
<li><a href="/facts/Anomaly_detection/wjEGMGGz">Anomaly detection</a></li>
<li><a href="/facts/Expectation%25E2%2580%2593maximization_algorithm/32P2bdBc">Expectation–maximization algorithm</a></li>
<li><a href="/facts/Generative_topographic_map/2S0KfVKH">Generative topographic map</a></li>
<li><a href="/facts/Meta-learning_(computer_science)/PQcoMGh6">Meta-learning (computer science)</a></li>
<li><a href="/facts/Multivariate_analysis/tDuNcWrL">Multivariate analysis</a></li>
<li><a href="/facts/Radial_basis_function_network/KBesEWD3">Radial basis function network</a></li>
<li><a href="/facts/Weak_supervision/3EAoE32F">Weak supervision</a></li></ul>

<h2 id="further-reading">Further reading</h2>

<ul><li>Bousquet, O.; <a href="/facts/Ulrike_von_Luxburg/C16hlQ71">von Luxburg, U.</a>; Raetsch, G., eds. (2004). <a href="https://archive.org/details/springer_10.1007-b100712"><i>Advanced Lectures on Machine Learning</i></a>. Springer. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3540231226.</li>
<li><a href="/facts/Richard_O._Duda/d7nAjctd">Duda, Richard O.</a>; <a href="/facts/Peter_E._Hart/pKSPzx0Q">Hart, Peter E.</a>; Stork, David G. (2001). "Unsupervised Learning and Clustering". <a href="/facts/Pattern_classification/jXXHRkXR"><i>Pattern classification</i></a> (2nd ed.). Wiley. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-471-05669-3.</li>
<li><a href="/facts/Trevor_Hastie/9bSQQGo7">Hastie, Trevor</a>; <a href="/facts/Robert_Tibshirani/BIzgnLuo">Tibshirani, Robert</a>; Friedman, Jerome (2009). <a href="https://link.springer.com/chapter/10.1007/978-0-387-84858-7_14">"Unsupervised Learning"</a>. <i>The Elements of Statistical Learning: Data mining, Inference, and Prediction</i>. Springer. pp. 485–586. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F978-0-387-84858-7_14">10.1007/978-0-387-84858-7_14</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-387-84857-0. <a href="https://web.archive.org/web/20221103234204/https://link.springer.com/chapter/10.1007/978-0-387-84858-7_14">Archived</a> from the original on 2022-11-03. Retrieved 2022-11-03.</li>
<li><a href="/facts/Geoffrey_Hinton/HJU6lC2H">Hinton, Geoffrey</a>; <a href="/facts/Terrence_J._Sejnowski/rckEWrwp">Sejnowski, Terrence J.</a>, eds. (1999). <i>Unsupervised Learning: Foundations of Neural Computation</i>. <a href="/facts/MIT_Press/eTerUM3c">MIT Press</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-262-58168-X.</li></ul>

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

<ol>
<li id="fn:1"><p>Wu, Wei. "Unsupervised Learning" (PDF). Archived (PDF) from the original on 14 April 2024. Retrieved 26 April 2024. <a href="https://na.uni-tuebingen.de/ex/ml_seminar_ss2022/Unsupervised_Learning%20Final.pdf" target="_blank">https://na.uni-tuebingen.de/ex/ml_seminar_ss2022/Unsupervised_Learning%20Final.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Liu, Xiao; Zhang, Fanjin; Hou, Zhenyu; Mian, Li; Wang, Zhaoyu; Zhang, Jing; Tang, Jie (2021). "Self-supervised Learning: Generative or Contrastive". IEEE Transactions on Knowledge and Data Engineering: 1. arXiv:2006.08218. doi:10.1109/TKDE.2021.3090866. ISSN 1041-4347. <a href="https://ieeexplore.ieee.org/document/9462394" target="_blank">https://ieeexplore.ieee.org/document/9462394</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Radford, Alec; Narasimhan, Karthik; Salimans, Tim; Sutskever, Ilya (11 June 2018). "Improving Language Understanding by Generative Pre-Training" (PDF). OpenAI. p. 12. Archived (PDF) from the original on 26 January 2021. Retrieved 23 January 2021. <a href="https://cdn.openai.com/research-covers/language-unsupervised/language_understanding_paper.pdf" target="_blank">https://cdn.openai.com/research-covers/language-unsupervised/language_understanding_paper.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Li, Zhuohan; Wallace, Eric; Shen, Sheng; Lin, Kevin; Keutzer, Kurt; Klein, Dan; Gonzalez, Joey (2020-11-21). "Train Big, Then Compress: Rethinking Model Size for Efficient Training and Inference of Transformers". Proceedings of the 37th International Conference on Machine Learning. PMLR: 5958–5968. <a href="https://proceedings.mlr.press/v119/li20m.html" target="_blank">https://proceedings.mlr.press/v119/li20m.html</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>Hinton, G. (2012). "A Practical Guide to Training Restricted Boltzmann Machines" (PDF). Neural Networks: Tricks of the Trade. Lecture Notes in Computer Science. Vol. 7700. Springer. pp. 599–619. doi:10.1007/978-3-642-35289-8_32. ISBN 978-3-642-35289-8. Archived (PDF) from the original on 2022-09-03. Retrieved 2022-11-03. <a href="978-3-642-35289-8" target="_blank">978-3-642-35289-8</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>"Deep Belief Nets" (video). September 2009. Archived from the original on 2022-03-08. Retrieved 2022-03-27. <a href="https://videolectures.net/mlss09uk_hinton_dbn" target="_blank">https://videolectures.net/mlss09uk_hinton_dbn</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>Peter, Dayan; Hinton, Geoffrey E.; Neal, Radford M.; Zemel, Richard S. (1995). "The Helmholtz machine". Neural Computation. 7 (5): 889–904. doi:10.1162/neco.1995.7.5.889. hdl:21.11116/0000-0002-D6D3-E. PMID 7584891. S2CID 1890561.
 <a href="/wiki/Peter_Dayan" target="_blank">/wiki/Peter_Dayan</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
<li id="fn:8"><p>Buhmann, J.; Kuhnel, H. (1992). "Unsupervised and supervised data clustering with competitive neural networks". [Proceedings 1992] IJCNN International Joint Conference on Neural Networks. Vol. 4. IEEE. pp. 796–801. doi:10.1109/ijcnn.1992.227220. ISBN 0780305590. S2CID 62651220. <a href="0780305590" target="_blank">0780305590</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li>
<li id="fn:9"><p>Comesaña-Campos, Alberto; Bouza-Rodríguez, José Benito (June 2016). "An application of Hebbian learning in the design process decision-making". Journal of Intelligent Manufacturing. 27 (3): 487–506. doi:10.1007/s10845-014-0881-z. ISSN 0956-5515. S2CID 207171436. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li>
<li id="fn:10"><p>Carpenter, G.A. & Grossberg, S. (1988). "The ART of adaptive pattern recognition by a self-organizing neural network" (PDF). Computer. 21 (3): 77–88. doi:10.1109/2.33. S2CID 14625094. Archived from the original (PDF) on 2018-05-16. Retrieved 2013-09-16. <a href="https://web.archive.org/web/20180516131553/http://www.cns.bu.edu/Profiles/Grossberg/CarGro1988Computer.pdf" target="_blank">https://web.archive.org/web/20180516131553/http://www.cns.bu.edu/Profiles/Grossberg/CarGro1988Computer.pdf</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li>
<li id="fn:11"><p>Roman, Victor (2019-04-21). "Unsupervised Machine Learning: Clustering Analysis". Medium. Archived from the original on 2020-08-21. Retrieved 2019-10-01. <a href="https://towardsdatascience.com/unsupervised-machine-learning-clustering-analysis-d40f2b34ae7e" target="_blank">https://towardsdatascience.com/unsupervised-machine-learning-clustering-analysis-d40f2b34ae7e</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li>
<li id="fn:12"><p>Jordan, Michael I.; Bishop, Christopher M. (2004). "7. Intelligent Systems §Neural Networks". In Tucker, Allen B. (ed.). Computer Science Handbook (2nd ed.). Chapman & Hall/CRC Press. doi:10.1201/9780203494455. ISBN 1-58488-360-X. Archived from the original on 2022-11-03. Retrieved 2022-11-03. <a href="1-58488-360-X" target="_blank">1-58488-360-X</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li>
<li id="fn:13"><p>Hastie, Tibshirani & Friedman 2009, pp. 485–586 - Hastie, Trevor; Tibshirani, Robert; Friedman, Jerome (2009). "Unsupervised Learning". The Elements of Statistical Learning: Data mining, Inference, and Prediction. Springer. pp. 485–586. doi:10.1007/978-0-387-84858-7_14. ISBN 978-0-387-84857-0. Archived from the original on 2022-11-03. Retrieved 2022-11-03. <a href="https://link.springer.com/chapter/10.1007/978-0-387-84858-7_14" target="_blank">https://link.springer.com/chapter/10.1007/978-0-387-84858-7_14</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li>
<li id="fn:14"><p>Garbade, Dr Michael J. (2018-09-12). "Understanding K-means Clustering in Machine Learning". Medium. Archived from the original on 2019-05-28. Retrieved 2019-10-31. <a href="https://towardsdatascience.com/understanding-k-means-clustering-in-machine-learning-6a6e67336aa1" target="_blank">https://towardsdatascience.com/understanding-k-means-clustering-in-machine-learning-6a6e67336aa1</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li>
<li id="fn:15"><p>Anandkumar, Animashree; Ge, Rong; Hsu, Daniel; Kakade, Sham; Telgarsky, Matus (2014). "Tensor Decompositions for Learning Latent Variable Models" (PDF). Journal of Machine Learning Research. 15: 2773–2832. arXiv:1210.7559. Bibcode:2012arXiv1210.7559A. Archived (PDF) from the original on 2015-03-20. Retrieved 2015-04-10. <a href="http://www.jmlr.org/papers/volume15/anandkumar14b/anandkumar14b.pdf" target="_blank">http://www.jmlr.org/papers/volume15/anandkumar14b/anandkumar14b.pdf</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li>
</ol>

Unsupervised learning open-in-new

Unsupervised learning