33 search results - page 4 / 7 » Growing decision trees on support-less association rules |
JMLR
2010
13 years 5 months ago
2010
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
SAC
2002
ACM
13 years 10 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
KDD
2002
ACM
14 years 11 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
ESANN
2004
14 years 7 days ago
2004
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
SIGMETRICS
2008
ACM
13 years 10 months ago
2008
ACM
XACML has become the de facto standard for specifying access control policies for various applications, especially web services. With the explosive growth of web applications depl...