Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD (May 1993)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: VLDB (September 1994)
Yun, U., Leggett, J.J.: WFIM: Weighted Frequent Itemset Mining with a weight range and a minimum weight In: SDM 2005 (April 2005)
Tao, F.: Weighted Association Rule Mining using Weighted Support and Significant framework. In: ACM SIGKDD (August 2003)
Wang, W., Yang, J., Yu, P.S.: Efficient mining of weighted association rules (WAR). In: ACM SIGKDD (August 2000)
Cai, C.H., Fu, A.W.-C., Cheng, C.H., Kwong, W.W.: Mining association rules with weighted items. In: IDEAS 1998, Cardiff, Wales, UK (July 1998)
Seno, M., Karypis, G.: LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing Support Constraint. In: ICDM 2001 (November 2001)
Wang, J., Karypis, G.: BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint. In: SDM 2004 (April 2004)
Seno, M., Karypis, G.: Finding Frequent Patterns Using Length Decreasing Support Constraints, University of Minnesota, Minneapolis, MN 55455, Technical Re-port 03-003 (2003)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD (May 2000)
Pei, J., Han, J.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Item-sets. In: DMKD (May 2000)
Wang, J., Han, J., Pei, J.: CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: ACM SIGKDD (August 2003)
Liu, G., Lu, H., Xu, Y., Yu, J.X.: Ascending Frequency Ordered Prefix-tree: Efficient Mining of Frequent Patterns. In: DASFAA (2003)
Liu, J., Pan, Y., Wang, K., Han, J.: Mining frequent item sets by opportun-istic projection. In: ACM SIGKDD (July 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yun, U., Leggett, J.J. (2005). WLPMiner: Weighted Frequent Pattern Mining with Length-Decreasing Support Constraints. In: Ho, T.B., Cheung, D., Liu, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. Lecture Notes in Computer Science(), vol 3518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11430919_65
Download citation
DOI: https://doi.org/10.1007/11430919_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26076-9
Online ISBN: 978-3-540-31935-1
eBook Packages: Computer ScienceComputer Science (R0)