12841 search results - page 2275 / 2569 » PL-detective: experiences and results |
217
Voted
KDD
2008
ACM
16 years 7 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 ...
208
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
215
click to vote
KDD
2007
ACM
16 years 7 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...
195
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
The need for mining causality, beyond mere statistical correlations, for real world problems has been recognized widely. Many of these applications naturally involve temporal data...
204
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to deter...