Sciweavers

98 search results - page 17 / 20
» Branching on Attribute Values in Decision Tree Generation
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 8 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
INFORMS
2010
177views more  INFORMS 2010»
13 years 7 months ago
Binarized Support Vector Machines
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...
PR
2010
158views more  PR 2010»
13 years 6 months ago
Out-of-bag estimation of the optimal sample size in bagging
The performance of m-out-of-n bagging with and without replacement in terms of the sampling ratio (m/n) is analyzed. Standard bagging uses resampling with replacement to generate ...
Gonzalo Martínez-Muñoz, Alberto Su&a...
GECCO
2004
Springer
155views Optimization» more  GECCO 2004»
14 years 1 months ago
Genetic Network Programming with Reinforcement Learning and Its Performance Evaluation
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
Shingo Mabu, Kotaro Hirasawa, Jinglu Hu
APIN
2008
110views more  APIN 2008»
13 years 8 months ago
Explaining inferences in Bayesian networks
While Bayesian network (BN) can achieve accurate predictions even with erroneous or incomplete evidence, explaining the inferences remains a challenge. Existing approaches fall sh...
Ghim-Eng Yap, Ah-Hwee Tan, HweeHwa Pang