1458 search results - page 119 / 292 » Practical Preference Relations for Large Data Sets |
195
click to vote
JMLR
2006
15 years 6 months ago
2006
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
129
click to vote
UAI
2004
15 years 7 months ago
2004
The task of matching co-referent records is known among other names as record linkage. For large record-linkage problems, often there is little or no labeled data available, but u...
172
click to vote
EMNLP
2009
15 years 3 months ago
2009
User clicks on a URL in response to a query are extremely useful predictors of the URL's relevance to that query. Exact match click features tend to suffer from severe data s...
198
click to vote
TIT
1998
15 years 5 months ago
1998
In this article we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory in the case of Gaussian...
159
click to vote
SDM
2004
SIAM
15 years 7 months ago
2004
SIAM
Segmentation based on RFM (Recency, Frequency, and Monetary) has been used for over 50 years by direct marketers to target a subset of their customers, save mailing costs, and imp...