Sciweavers

298 search results - page 50 / 60
» Subspace Clustering of High Dimensional Data
Sort
View
ICASSP
2010
IEEE
15 years 18 days ago
Swift: Scalable weighted iterative sampling for flow cytometry clustering
Flow cytometry (FC) is a powerful technology for rapid multivariate analysis and functional discrimination of cells. Current FC platforms generate large, high-dimensional datasets...
Iftekhar Naim, Suprakash Datta, Gaurav Sharma, Jam...
PR
2008
170views more  PR 2008»
14 years 12 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
SIGIR
2005
ACM
15 years 6 months ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He
CVPR
2007
IEEE
16 years 2 months ago
The Hierarchical Isometric Self-Organizing Map for Manifold Representation
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...
Haiying Guan, Matthew Turk
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 1 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich