Sciweavers

2421 search results - page 128 / 485
» Measuring independence of datasets
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 6 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
BMCBI
2006
146views more  BMCBI 2006»
15 years 6 months ago
Recursive gene selection based on maximum margin criterion: a comparison with SVM-RFE
Background: In class prediction problems using microarray data, gene selection is essential to improve the prediction accuracy and to identify potential marker genes for a disease...
Satoshi Niijima, Satoru Kuhara
BMCBI
2005
94views more  BMCBI 2005»
15 years 6 months ago
Reproducible Clusters from Microarray Research: Whither?
Motivation: In cluster analysis, the validity of specific solutions, algorithms, and procedures present significant challenges because there is no null hypothesis to test and no &...
Nikhil R. Garge, Grier P. Page, Alan P. Sprague, B...
BMCBI
2004
156views more  BMCBI 2004»
15 years 6 months ago
GeneXplorer: an interactive web application for microarray data visualization and analysis
Background: When publishing large-scale microarray datasets, it is of great value to create supplemental websites where either the full data, or selected subsets corresponding to ...
Christian A. Rees, Janos Demeter, John C. Matese, ...
RECOMB
2005
Springer
16 years 6 months ago
A Partial Solution to the C-Value Paradox
In the half-century since the C-value paradox (the apparent lack of correlation between organismal genome size and morphological complexity) was described, there have been no expli...
Jeffrey M. Marcus