266 search results - page 16 / 54 » Learning to Identify Unexpected Instances in the Test Set |
SDM
2010
SIAM
13 years 8 months ago
2010
SIAM
We present Confidence-based Feature Acquisition (CFA), a novel supervised learning method for acquiring missing feature values when there is missing data at both training and test...
FLAIRS
2008
13 years 9 months ago
2008
We introduce a method to deal with the problem of learning from imbalanced data sets, where examples of one class significantly outnumber examples of other classes. Our method sel...
EC
2008
13 years 7 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
CIKM
2005
Springer
14 years 27 days ago
2005
Springer
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...