1301 search results - page 21 / 261 » Default Clustering from Sparse Data Sets |
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
ICCV
2001
IEEE
14 years 10 months ago
2001
IEEE
The number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, the number of features that can be computed and exploited by most c...
CVPR
2011
IEEE
13 years 12 days ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
ESANN
2001
13 years 10 months ago
2001
We investigate the use of an unsupervised artificial neural network to form a sparse representation of the underlying causes in a data set. By using fixed lateral connections that...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...