245 search results - page 46 / 49 » Efficient Algorithms for Discovering Association Rules |
115
click to vote
SAC
2002
ACM
15 years 3 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...
160
click to vote
BMCBI
2002
15 years 4 months ago
2002
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
128
click to vote
KDD
2002
ACM
16 years 4 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 ...
140
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
144
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
A number of medically important disease-causing bacteria (collectively called Gram-negative bacteria) are noted for the extra "outer" membrane that surrounds their cell....