Sciweavers

4930 search results - page 3 / 986
» Learning minimal abstractions
Sort
View
ICMLA
2009
13 years 2 months ago
Automatic Feature Selection for Model-Based Reinforcement Learning in Factored MDPs
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
Mark Kroon, Shimon Whiteson
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
13 years 8 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
CAI
2007
Springer
13 years 10 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
VMCAI
2005
Springer
13 years 9 months ago
Minimizing Counterexample with Unit Core Extraction and Incremental SAT
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
ShengYu Shen, Ying Qin, Sikun Li
ICCS
2007
Springer
13 years 10 months ago
Adaptive Observation Strategies for Forecast Error Minimization
Abstract. Using a scenario of multiple mobile observing platforms (UAVs) measuring weather variables in distributed regions of the Pacific, we are developing algorithms that will ...
Nicholas Roy, Han-Lim Choi, Daniel Gombos, James H...