Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 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
Efficient mining of weighted association rules (WAR)
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and 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
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th 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
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
Mining lossless closed frequent patterns with weight constraints
Knowledge-Based Systems
Efficient mining of weighted interesting patterns with a strong weight and/or support affinity
Information Sciences: an International Journal
A new framework for detecting weighted sequential patterns in large sequence databases
Knowledge-Based Systems
Efficient Single-Pass Mining of Weighted Interesting Patterns
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Efficient mining of interesting weighted patterns from directed graph traversals
Integrated Computer-Aided Engineering
Handling Dynamic Weights in Weighted Frequent Pattern Mining
IEICE - Transactions on Information and Systems
WTPMiner: efficient mining of weighted frequent patterns based on graph traversals
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Mining weighted sequential patterns based on length-decreasing support constraints
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Single-pass incremental and interactive mining for weighted frequent patterns
Expert Systems with Applications: An International Journal
CWFM: closed contingency weighted frequent itemsets mining
ICDM'12 Proceedings of the 12th Industrial conference on Advances in Data Mining: applications and theoretical aspects
Proceedings of the CUBE International Information Technology Conference
Hi-index | 0.01 |
Two main 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, patterns having only smaller items tend to be interesting if they have high support, while long patterns can still be interesting although their supports are relatively small. Weight and length decreasing support constraints are key factors, but no mining algorithms consider both the constraints. In this paper, we re-examine two basic but interesting constraints, a weight constraint and a length decreasing support constraint and propose weighted frequent pattern mining with length decreasing 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 Weighted Smallest Valid Extension (WSVE) with applying length decreasing support constraints in weight-based mining. The WSVE property is applied to transaction and node pruning. WLPMiner generates more concise and important weighted frequent patterns with a length decreasing support constraint in large databases by applying the weighted smallest valid extension.