Sciweavers

434 search results - page 49 / 87
» Dimensionality Reduction of Clustered Data Sets
Sort
View
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 6 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
JMLR
2010
150views more  JMLR 2010»
13 years 3 months ago
Supervised Dimension Reduction Using Bayesian Mixture Modeling
We develop a Bayesian framework for supervised dimension reduction using a flexible nonparametric Bayesian mixture modeling approach. Our method retrieves the dimension reduction ...
Kai Mao, Feng Liang, Sayan Mukherjee
ICASSP
2010
IEEE
13 years 8 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...
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
14 years 9 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...
MICAI
2005
Springer
14 years 2 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...