Sciweavers

1458 search results - page 127 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
BMCBI
2006
164views more  BMCBI 2006»
15 years 6 months ago
Evaluation of clustering algorithms for gene expression data
Background: Cluster analysis is an integral part of high dimensional data analysis. In the context of large scale gene expression data, a filtered set of genes are grouped togethe...
Susmita Datta, Somnath Datta
ESANN
2006
15 years 7 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi
BMCBI
2005
190views more  BMCBI 2005»
15 years 6 months ago
An Entropy-based gene selection method for cancer classification using microarray data
Background: Accurate diagnosis of cancer subtypes remains a challenging problem. Building classifiers based on gene expression data is a promising approach; yet the selection of n...
Xiaoxing Liu, Arun Krishnan, Adrian Mondry
IJAIT
2002
122views more  IJAIT 2002»
15 years 6 months ago
Comparing Keyword Extraction Techniques for WEBSOM Text Archives
The WEBSOM methodology for building very large text archives has a very slow method for extracting meaningful unit labels. This is because the method computes for the relative fre...
Arnulfo P. Azcarraga, Teddy N. Yap Jr., Tat-Seng C...
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
15 years 7 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar