766 search results - page 110 / 154 » Clustering high dimensional data using subspace and projecte... |
DAWAK
2000
Springer
14 years 1 months ago
2000
Springer
Abstract The application of data mining algorithms needs a goal-oriented preprocessing of the data. In practical applications the preprocessing task is very time consuming and has ...
IDEAL
2010
Springer
13 years 6 months ago
2010
Springer
: Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d2 elements of the covariance (in d dimensions) is costly and could result ...
BMCBI
2006
13 years 8 months ago
2006
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
COR
2010
13 years 8 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
BMCBI
2006
13 years 8 months ago
2006
Background: Traditional methods of analysing gene expression data often include a statistical test to find differentially expressed genes, or use of a clustering algorithm to find...