103 search results - page 15 / 21 » Projective ART for clustering data sets in high dimensional ... |
BMCBI
2005
13 years 7 months ago
2005
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
TSMC
2010
13 years 2 months ago
2010
In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakt...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We consider the task of dimensionality reduction for regression (DRR) whose goal is to find a low dimensional representation of input covariates, while preserving the statistical ...