997 search results - page 42 / 200 » Learning Rule Representations from Boolean Data |
JMLR
2002
15 years 6 days ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
99
Voted
KDD
1997
ACM
15 years 4 months ago
1997
ACM
One of the important problems in data mining is the evaluation of subjective interestingness of the discovered rules. Past research has found that in many real-life applications i...
114
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
101
Voted
CIKM
2005
Springer
15 years 6 months 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...
106
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
The major challenge in mining data streams is the issue of concept drift, the tendency of the underlying data generation process to change over time. In this paper, we propose a g...