Sciweavers

599 search results - page 20 / 120
» An Algorithm for Learning Abductive Rules
Sort
View
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 8 months ago
Extraction of Symbolic Rules from Artificial Neural Networks
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
S. M. Kamruzzaman, Md. Monirul Islam
ICML
1990
IEEE
13 years 12 months ago
Explanations of Empirically Derived Reactive Plans
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
Diana F. Gordon, John J. Grefenstette
ATAL
2008
Springer
13 years 10 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
ICML
2005
IEEE
14 years 8 months ago
Learning first-order probabilistic models with combining rules
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
Sriraam Natarajan, Prasad Tadepalli, Eric Altendor...
IJCAI
1997
13 years 9 months ago
Noise-Tolerant Windowing
Windowing has been proposed as a procedure for efficient memory use in the ID3 decision tree learning algorithm. However, it was shown that it may often lead to a decrease in perf...
Johannes Fürnkranz