475 search results - page 48 / 95 » A Distance-Based Packing Method for High Dimensional Data |
IDEAL
2004
Springer
14 years 2 months ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Histograms have been widely used for fast estimation of query result sizes in query optimization. In this paper, we propose a new histogram method, called the Skew-Tolerant Histog...
ICCSA
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we propose a new clustering procedure for high dimensional microarray data. Major difficulty in cluster analysis of microarray data is that the number of samples to ...
EGH
2011
Springer
12 years 8 months ago
2011
Springer
Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphi...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Supervised learning is difficult with high dimensional input spaces and very small training sets, but accurate classification may be possible if the data lie on a low-dimensional ...