Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
Data Mining: An Overview from a Database Perspective
IEEE Transactions on Knowledge and Data Engineering
Alternative Interest Measures for Mining Associations in Databases
IEEE Transactions on Knowledge and Data Engineering
Mining Frequent Item Sets with Convertible Constraints
Proceedings of the 17th International Conference on Data Engineering
H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing Support Constraint
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Mining Frequent Itemsets Using Support Constraints
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Mining frequent item sets by opportunistic projection
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Ascending Frequency Ordered Prefix-tree: Efficient Mining of Frequent Patterns
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Mining Association Rules with Weighted Items
IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Weighted Association Rule Mining using weighted support and significance framework
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
WAR: Weighted Association Rules for Item Intensities
Knowledge and Information Systems
Efficient closed pattern mining in the presence of tough block constraints
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Generalizing the notion of support
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach
IEEE Transactions on Knowledge and Data Engineering
On Closed Constrained Frequent Pattern Mining
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Mining lossless closed frequent patterns with weight constraints
Knowledge-Based Systems
Pushing tougher constraints in frequent pattern mining
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Mining weighted sequential patterns in a sequence database with a time-interval weight
Knowledge-Based Systems
Regression analysis of the number of association rules
International Journal of Automation and Computing
CMRules: Mining sequential rules common to several sequences
Knowledge-Based Systems
Expert Systems with Applications: An International Journal
Single-pass incremental and interactive mining for weighted frequent patterns
Expert Systems with Applications: An International Journal
An efficient mining algorithm for maximal weighted frequent patterns in transactional databases
Knowledge-Based Systems
Discovering forward sequences from temporal data
Knowledge-Based Systems
Efficient mining of maximal correlated weight frequent patterns
Intelligent Data Analysis
| Hi-index | 0.00 |
Frequent pattern mining has been extensively studied in the data mining field due to its broad applications in mining association rules, correlations, closed frequent patterns, graph patterns, constraint-based frequent patterns, sequential patterns, and many other data mining tasks. Two concerns exist for frequent pattern mining in the real world. First, each item has different importance so researchers have proposed weighted frequent pattern mining algorithms that reflect the importance of items. Second, previous mining algorithms use a constant support constraint irrespective of the length of discovered patterns. However, short patterns having only a fewer items tend to be interesting if they have high support, while long patterns can still be interesting although their supports are relatively low. Weight and length decreasing support constraints are important constraints, but no mining algorithms consider both constraints. In this paper, we propose weighted frequent pattern mining with length decreasing support constraints. Our main approach is to push weight constraints and length decreasing support constraints into the pattern growth algorithm. For pruning techniques, we propose the notion of the Weighted Smallest Valid Extension (WSVE) property with/without Minimum Weight (MinW). The WSVE property with/without MinW is applied to transaction pruning, node pruning and path pruning to eliminate weighted infrequent patterns earlier. Our approach generates more concise but important weighted frequent patterns with length decreasing support constraints by applying the WSVE property with/without MinW.