Sciweavers

56 search results - page 6 / 12
» Finding Clusters and Components by Unsupervised Learning
Sort
View
IJCNN
2007
IEEE
15 years 3 months ago
The Metro Visualisation of Component Planes for Self-Organising Maps
— The Self-Organising Map is a popular unsupervised neural network model which has successfully been used for clustering various kinds of data. To help in understanding the infl...
Robert Neumayer, Rudolf Mayer, Georg Pölzlbau...
75
Voted
ICML
2008
IEEE
15 years 10 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
15 years 10 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
TIP
2002
179views more  TIP 2002»
14 years 9 months ago
Unsupervised image classification, segmentation, and enhancement using ICA mixture models
An unsupervised classification algorithm is derived by modeling observed data as a mixture of several mutually exclusive classes that are each described by linear combinations of i...
Te-Won Lee, Michael S. Lewicki
PRL
2010
158views more  PRL 2010»
14 years 8 months ago
Data clustering: 50 years beyond K-means
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
Anil K. Jain