Sciweavers

71 search results - page 9 / 15
» Rule learning with monotonicity constraints
Sort
View
AAAI
1994
13 years 8 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
ECAI
2000
Springer
13 years 11 months ago
Learning Classification taxonomies from a classification knowledge based system
Knowledge-based systems (KBS) are not necessarily based on well-defined ontologies. In particular it is possible to build KBS for classification problems, where there is little con...
Hendra Suryanto, Paul Compton
ACL
2010
13 years 5 months ago
Bitext Dependency Parsing with Bilingual Subtree Constraints
This paper proposes a dependency parsing method that uses bilingual constraints to improve the accuracy of parsing bilingual texts (bitexts). In our method, a targetside tree frag...
Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
14 years 20 days ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin