Sciweavers

171 search results - page 2 / 35
» Adapting Decision Trees for Learning Selectional Restriction...
Sort
View
ILP
2005
Springer
13 years 10 months ago
Predicate Selection for Structural Decision Trees
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
Kee Siong Ng, John W. Lloyd
ATAL
2010
Springer
13 years 5 months ago
Learning context conditions for BDI plan selection
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-calle...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
ECML
2005
Springer
13 years 10 months ago
Model Selection in Omnivariate Decision Trees
We propose an omnivariate decision tree architecture which contains univariate, multivariate linear or nonlinear nodes, matching the complexity of the node to the complexity of the...
Olcay Taner Yildiz, Ethem Alpaydin
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
14 years 5 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du
SAC
2006
ACM
13 years 10 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach