2286 search results - page 308 / 458 » Algorithms for Categorical Equivalence |
171
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
182
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
161
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
148
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
144
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
We study the performance issue of the “iterative” record linkage (RL) problem, where match and merge operations may occur together in iterations until convergence emerges. We ...