Sciweavers

298 search results - page 4 / 60
» Subspace Clustering of High Dimensional Data
Sort
View
CVPR
2005
IEEE
14 years 7 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
CIKM
2008
Springer
13 years 7 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010
CVPR
2004
IEEE
14 years 7 months ago
Inference of Multiple Subspaces from High-Dimensional Data and Application to Multibody Grouping
Multibody grouping is a representative of applying subspace constraints in computer vision tasks. Under linear projection models, feature points of multibody reside in multiple su...
Zhimin Fan, Jie Zhou, Ying Wu
ICPP
2000
IEEE
13 years 9 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
BIOINFORMATICS
2006
85views more  BIOINFORMATICS 2006»
13 years 5 months ago
Clusterv: a tool for assessing the reliability of clusters discovered in DNA microarray data
Summary: We present a new R package for the assessment of the reliability of clusters discovered in high dimensional DNA microarray data. The package implements methods based on r...
Giorgio Valentini