106 search results - page 3 / 22 » Finding Interesting Associations without Support Pruning |
ICDM
2002
IEEE
13 years 10 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
JCST
2008
13 years 5 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
ICDM
2002
IEEE
13 years 10 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...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Given a spatial data set placed on an n ? n grid, our goal is to find the rectangular regions within which subsets of the data set exhibit anomalous behavior. We develop algorithm...
ICDE
1998
IEEE
14 years 7 months ago
1998
IEEE
?Mining association rules on large data sets has received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a ...