Sciweavers

396 search results - page 11 / 80
» Lossy Reduction for Very High Dimensional Data
Sort
View
IV
2007
IEEE
160views Visualization» more  IV 2007»
15 years 3 months ago
Targeted Projection Pursuit for Interactive Exploration of High- Dimensional Data Sets
High-dimensional data is, by its nature, difficult to visualise. Many current techniques involve reducing the dimensionality of the data, which results in a loss of information. ...
Joe Faith
BMEI
2008
IEEE
14 years 11 months ago
Clustering of High-Dimensional Gene Expression Data with Feature Filtering Methods and Diffusion Maps
The importance of gene expression data in cancer diagnosis and treatment by now has been widely recognized by cancer researchers in recent years. However, one of the major challen...
Rui Xu, Steven Damelin, Boaz Nadler, Donald C. Wun...
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
15 years 2 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
APVIS
2010
14 years 7 months ago
Interactive local clustering operations for high dimensional data in parallel coordinates
In this paper, we propose an approach of clustering data in parallel coordinates through interactive local operations. Different from many other methods in which clustering is glo...
Peihong Guo, He Xiao, Zuchao Wang, Xiaoru Yuan
ICPR
2000
IEEE
15 years 1 months ago
Two-Stage Computational Cost Reduction Algorithm Based on Mahalanobis Distance Approximations
For many pattern recognition methods, high recognition accuracy is obtained at very high expense of computational cost. In this paper, a new algorithm that reduces the computation...
Fang Sun, Shinichiro Omachi, Nei Kato, Hirotomo As...