58 search results - page 1 / 12 » Pushing Tougher Constraints in Frequent Pattern Mining |
PAKDD
2005
ACM
13 years 9 months ago
2005
ACM
In this paper we extend the state-of-art of the constraints that can be pushed in a frequent pattern computation. We introduce a new class of tough constraints, namely Loose Anti-m...
ICDM
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
SDM
2004
SIAM
13 years 5 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
ICDM
2007
IEEE
13 years 10 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...