# Unsupervised learning

**Unsupervised learning** is a type of self-organized Hebbian learning that helps find previously unknown patterns in data set without pre-existing labels. It is also known as self-organization and allows modeling probability densities of given inputs.[1] It is one of the main three categories of machine learning, along with supervised and reinforcement learning. Semi-supervised learning has also been described, and is a hybridization of supervised and unsupervised techniques.

Machine learning and data mining |
---|

Machine-learning venues |

Two of the main methods used in unsupervised learning are principal component and cluster analysis. Cluster analysis is used in unsupervised learning to group, or segment, datasets with shared attributes in order to extrapolate algorithmic relationships.[2] Cluster analysis is a branch of machine learning that groups the data that has not been labelled, 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.

A central application of unsupervised learning is in the field of density estimation in statistics,[3] though unsupervised learning encompasses many other domains involving summarizing and explaining data features. It could be contrasted with supervised learning by saying that whereas supervised learning intends to infer a conditional probability distribution conditioned on the label of input data; unsupervised learning intends to infer an a priori probability distribution .

Generative adversarial networks can also be used with unsupervised learning, though they can also be applied to supervised and reinforcement techniques.

## Approaches

Some of the most common algorithms used in unsupervised learning include:

- Clustering
- Anomaly detection
- Neural Networks
- Approaches for learning latent variable models such as

## Neural networks

The classical example of unsupervised learning in the study of neural networks is Donald Hebb's principle, that is, neurons that fire together wire together.[6] In Hebbian learning, the connection is reinforced irrespective of an error, but is exclusively a function of the coincidence between action potentials between the two neurons.[7] A similar version that modifies synaptic weights takes into account the time between the action potentials (spike-timing-dependent plasticity or STDP). Hebbian Learning has been hypothesized to underlie a range of cognitive functions, such as pattern recognition and experiential learning.

Among neural network models, the self-organizing map (SOM) and adaptive resonance theory (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 automatic target recognition and seismic signal processing.[8]

## Method of moments

One of the statistical approaches for unsupervised learning is the method of moments. 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 mean vector, and the second order moment is the covariance matrix (when the mean is zero). Higher order moments are usually represented using tensors which are the generalization of matrices to higher orders as multi-dimensional arrays.

In particular, the method of moments is shown to be effective in learning the parameters of latent variable models.[9] 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 topic modeling 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.[9]

The Expectation–maximization algorithm (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.[9]

## See also

## Notes

- Hinton, Geoffrey; Sejnowski, Terrence (1999).
*Unsupervised Learning: Foundations of Neural Computation*. MIT Press. ISBN 978-0262581684. - Roman, Victor (2019-04-21). "Unsupervised Machine Learning: Clustering Analysis".
*Medium*. Retrieved 2019-10-01. - Jordan, Michael I.; Bishop, Christopher M. (2004). "Neural Networks". In Allen B. Tucker (ed.).
*Computer Science Handbook, Second Edition (Section VII: Intelligent Systems)*. Boca Raton, Florida: Chapman & Hall/CRC Press LLC. ISBN 1-58488-360-X. - Hastie, Trevor, Robert Tibshirani, Friedman, Jerome (2009).
*The Elements of Statistical Learning: Data mining, Inference, and Prediction*. New York: Springer. pp. 485–586. ISBN 978-0-387-84857-0.CS1 maint: multiple names: authors list (link) - Garbade, Dr Michael J. (2018-09-12). "Understanding K-means Clustering in Machine Learning".
*Medium*. Retrieved 2019-10-31. - Buhmann, J.; Kuhnel, H. (1992). "Unsupervised and supervised data clustering with competitive neural networks".
*[Proceedings 1992] IJCNN International Joint Conference on Neural Networks*.**4**. IEEE. pp. 796–801. doi:10.1109/ijcnn.1992.227220. ISBN 0780305590. - 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. - 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. - Anandkumar, Animashree; Ge, Rong; Hsu, Daniel; Kakade, Sham; Telgarsky, Matus (2014). "Tensor Decompositions for Learning Latent Variable Models" (PDF).
*Journal of Machine Learning Research (JMLR)*.**15**: 2773–2832. arXiv:1210.7559. Bibcode:2012arXiv1210.7559A.

## Further reading

- Bousquet, O.; von Luxburg, U.; Raetsch, G., eds. (2004).
*Advanced Lectures on Machine Learning*. Springer-Verlag. ISBN 978-3540231226. - Duda, Richard O.; Hart, Peter E.; Stork, David G. (2001). "Unsupervised Learning and Clustering".
*Pattern classification*(2nd ed.). Wiley. ISBN 0-471-05669-3. - Hastie, Trevor; Tibshirani, Robert (2009).
*The Elements of Statistical Learning: Data mining, Inference, and Prediction*. New York: Springer. pp. 485–586. doi:10.1007/978-0-387-84858-7_14. ISBN 978-0-387-84857-0. - Hinton, Geoffrey; Sejnowski, Terrence J., eds. (1999).
*Unsupervised Learning: Foundations of Neural Computation*. MIT Press. ISBN 0-262-58168-X. (This book focuses on unsupervised learning in neural networks)