Sciweavers

2090 search results - page 35 / 418
» Learning with attribute costs
Sort
View
IDEAL
2004
Springer
14 years 1 months ago
Wrapper for Ranking Feature Selection
We propose a new feature selection criterion not based on calculated measures between attributes, or complex and costly distance calculations. Applying a wrapper to the output of a...
Roberto Ruiz, Jesús S. Aguilar-Ruiz, Jos&ea...
KDD
2010
ACM
175views Data Mining» more  KDD 2010»
13 years 11 months ago
Learning with cost intervals
Existing cost-sensitive learning methods work with unequal misclassification cost that is given by domain knowledge and appears as precise values. In many real-world applications,...
Xu-Ying Liu, Zhi-Hua Zhou
AAAI
2007
13 years 10 months ago
A Reinforcement Learning Algorithm with Polynomial Interaction Complexity for Only-Costly-Observable MDPs
An Unobservable MDP (UMDP) is a POMDP in which there are no observations. An Only-Costly-Observable MDP (OCOMDP) is a POMDP which extends an UMDP by allowing a particular costly a...
Roy Fox, Moshe Tennenholtz
FLAIRS
2006
13 years 9 months ago
Generalized Entropy for Splitting on Numerical Attributes in Decision Trees
Decision Trees are well known for their training efficiency and their interpretable knowledge representation. They apply a greedy search and a divide-and-conquer approach to learn...
Mingyu Zhong, Michael Georgiopoulos, Georgios C. A...
ICDM
2010
IEEE
228views Data Mining» more  ICDM 2010»
13 years 5 months ago
Active Learning from Multiple Noisy Labelers with Varied Costs
In active learning, where a learning algorithm has to purchase the labels of its training examples, it is often assumed that there is only one labeler available to label examples, ...
Yaling Zheng, Stephen D. Scott, Kun Deng