Sciweavers

284 search results - page 17 / 57
» Sensitivity Analysis of the Result in Binary Decision Trees
Sort
View
BMCBI
2008
71views more  BMCBI 2008»
13 years 7 months ago
Examining the significance of fingerprint-based classifiers
Background: Experimental examinations of biofluids to measure concentrations of proteins or their fragments or metabolites are being explored as a means of early disease detection...
Brian T. Luke, Jack R. Collins
ICML
1999
IEEE
14 years 8 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
14 years 1 months ago
Learning through Changes: An Empirical Study of Dynamic Behaviors of Probability Estimation Trees
In practice, learning from data is often hampered by the limited training examples. In this paper, as the size of training data varies, we empirically investigate several probabil...
Kun Zhang, Zujia Xu, Jing Peng, Bill P. Buckles
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
ICPP
1994
IEEE
13 years 12 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández