Sciweavers

5046 search results - page 23 / 1010
» Non-redundant data clustering
Sort
View
CGF
2010
171views more  CGF 2010»
15 years 2 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
PRL
2010
158views more  PRL 2010»
15 years 4 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
EDM
2010
174views Data Mining» more  EDM 2010»
15 years 7 months ago
Clustering Student Learning Activity Data
We show a variety of ways to cluster student activity datasets using different clustering and subspace clustering algorithms. Our results suggest that each algorithm has its own st...
Haiyun Bian
KES
2004
Springer
15 years 11 months ago
Multi-modal Data Fusion: A Description
Clustering groups records that are similar to each other into the same group, and those that are less similar into different groups. Clustering data of mixed types is difficult du...
Sarah Coppock, Lawrence J. Mazlack
CVPR
2011
IEEE
15 years 1 months ago
A Closed Form Solution to Robust Subspace Estimation and Clustering
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
Paolo Favaro, René, Vidal, Avinash Ravichandran