Unsupervised learning

You don't need to be Editor-In-Chief to add or edit content to WikiDoc. You can begin to add to or edit text on this WikiDoc page by clicking on the edit button at the top of this page. Next enter or edit the information that you would like to appear here. Once you are done editing, scroll down and click the Save page button at the bottom of the page.

Unsupervised learning is a method of machine learning where a model is fit to observations. It is distinguished from supervised learning by the fact that there is no a priori output. In unsupervised learning, a data set of input objects is gathered. Unsupervised learning then typically treats input objects as a set of random variables. A joint density model is then built for the data set.

Unsupervised learning can be used in conjunction with Bayesian inference to produce conditional probabilities (i.e. supervised learning) for any of the random variables given the others. A holy grail of unsupervised learning is the creation of a factorial code of the data, i. e., a code with statistically independent components. Later supervised learning usually works much better when the raw input data is first translated into a factorial code.

Unsupervised learning is also useful for data compression: fundamentally, all data compression algorithms either explicitly or implicitly rely on a probability distribution over a set of inputs.

Another form of unsupervised learning is clustering, which is sometimes not probabilistic. Also see formal concept analysis.

Adaptive resonance theory (ART) 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 also used for many pattern recognition tasks, such as automatic target recognition and seismic signal processing. The first version of ART was "ART1", developed by Carpenter and Grossberg(1988).

Bibliography

• Geoffrey Hinton, Terrence J. Sejnowski (editors) (1999) Unsupervised Learning and Map Formation: Foundations of Neural Computation, MIT Press, ISBN 0-262-58168-X (This book focuses on unsupervised learning in neural networks.)

• Horace Barlow, T. P. Kaushal, and G. J. Mitchison. Finding minimum entropy codes. Neural Computation, 1:412-423, 1989.

• Jürgen Schmidhuber. Learning factorial codes by predictability minimization. Neural Computation, 4(6):863-879, 1992

• S. Kotsiantis, P. Pintelas, Recent Advances in Clustering: A Brief Survey, WSEAS Transactions on Information Science and Applications, Vol 1, No 1 (73-81), 2004.

• Richard O. Duda, Peter E. Hart, David G. Stork. Unsupervised Learning and Clustering, Ch. 10 in Pattern classification (2nd edition), p. 571, Wiley, New York, ISBN 0-471-05669-3, 2001.

See also

• Artificial neural network
• Data clustering
• Expectation-maximization algorithm
• Self-organizing map
• Radial basis function network
• Generative Topographic Mappingde:Unüberwachtes Lernenit:Apprendimento non supervisionatoth:การเรียนรู้แบบไม่มีผู้สอน