1601 search results - page 86 / 321 » Closed Sets for Labeled Data |
177
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
141
click to vote
PODS
2008
ACM
16 years 4 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
113
click to vote
HUC
2007
Springer
15 years 10 months ago
2007
Springer
We describe our experience building and using a reasoning system for providing context-based prompts to elders to take their medication. We describe the process of specification, ...
139
click to vote
IDA
2010
Springer
15 years 6 months ago
2010
Springer
This paper introduces a novel method for obtaining increased predictive performance from transparent models in situations where production input vectors are available when building...
173
click to vote
TNN
2010
14 years 11 months ago
2010
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...