Sciweavers

225 search results - page 40 / 45
» On Learning Decision Trees with Large Output Domains
Sort
View
ESANN
2006
13 years 9 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
NIPS
1996
13 years 9 months ago
Predicting Lifetimes in Dynamically Allocated Memory
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
David A. Cohn, Satinder P. Singh
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...
HIPC
1999
Springer
13 years 12 months ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
VLDB
1995
ACM
181views Database» more  VLDB 1995»
13 years 11 months ago
NeuroRule: A Connectionist Approach to Data Mining
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
Hongjun Lu, Rudy Setiono, Huan Liu