LTI-Lib latest version v1.9 - last update 10 Apr 2010

Unsupervised Classifiers

Unsupervised classifiers are methods that try to find 'natural' or 'sensible' structure in data.

To this end each data point is usually member of a newly found group. A distinct label is assigned to each group. Some algorithms allow membership of each point to more then one group. One example is the Fuzzy-C-Means Clustering.

The most popular application of unsupervised classifiers is data analysis and possibly visualization. However, some methods are also used for data compression or quantization.

This page first deals with clustering techniques. These are usually statistical methods for finding groups (clusters). The second section deals with an artificial neural network, the Self-Organizing Feature Maps, which perform unsupervised classification.

Related classes:

Clustering

k-Means Clustering

lti::kMeansClustering

Fuzzy-C-Means Clustering

lti::fuzzyCMeans

Adaptive k-Means Clustering

lti::adaptiveKMeans

Self Organizing Feature Maps

lti::SOFM

2D SOMs

lti::SOFM2D

Visualization of SOMs

Still to be done.


Generated on Sat Apr 10 15:26:30 2010 for LTI-Lib by Doxygen 1.6.1