96 search results - page 10 / 20 » Geometric Decision Rules for Instance-Based Learning Problem... |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
84
Voted
VLDB
1995
ACM
15 years 1 months ago
1995
ACM
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
79
Voted
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
136
click to vote
MSR
2006
ACM
15 years 3 months ago
2006
ACM
With the advent of open source software repositories the data available for defect prediction in source files increased tremendously. Although traditional statistics turned out t...
NIPS
2004
14 years 11 months ago
2004
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regulariza...