Sciweavers

298 search results - page 18 / 60
» Subspace Clustering of High Dimensional Data
Sort
View
ICDM
2003
IEEE
111views Data Mining» more  ICDM 2003»
15 years 9 months ago
OP-Cluster: Clustering by Tendency in High Dimensional Space
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
Jinze Liu, Wei Wang 0010
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
15 years 9 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
MM
2005
ACM
122views Multimedia» more  MM 2005»
15 years 9 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han
JMLR
2002
137views more  JMLR 2002»
15 years 3 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
CVPR
2004
IEEE
16 years 6 months ago
Motion Segmentation with Missing Data Using PowerFactorization and GPCA
We consider the problem of segmenting multiple rigid motions from point correspondences in multiple affine views. We cast this problem as a subspace clustering problem in which th...
René Vidal, Richard I. Hartley