Sciweavers

164 search results - page 27 / 33
» HD-Eye - Visual Clustering of High dimensional Data
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
CSDA
2006
85views more  CSDA 2006»
13 years 7 months ago
Two-way Poisson mixture models for simultaneous document classification and word clustering
An approach to simultaneous document classification and word clustering is developed using a two-way mixture model of Poisson distributions. Each document is represented by a vect...
Jia Li, Hongyuan Zha
MM
2005
ACM
122views Multimedia» more  MM 2005»
14 years 1 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
ICASSP
2010
IEEE
13 years 7 months 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»
13 years 7 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...