Abstract
Weighted pattern mining have been studied the importance of items. So far, in weight constraint based pattern mining, the weight has been considered the item’s price. The price considered as the weight has a limit. The weight characteristic of weighted pattern mining should be considered case-by-case situation. Thus, we motivate by considering the special and individual case-by-case situation to find the exact frequent patterns. We propose how to set weight into frequent patterns mining with a case-by-case condition, called CWFM (closed contingency weighted pattern miming). Moreover, we devise information tables by using statistical and empirical data as strategic decision. In addition, we calculate the contingency weight using outer variables and values which are from information tables. CWFM extracts more meaningful and appropriate patterns reflected case-by-case situation. The proposed new mining method finds closed contingency weighted frequent patterns having a significance which represents the case-by-case situation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD 1993 (1993)
Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: ICDE 1995 (1995)
Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 1–17. Springer, Heidelberg (1996)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000 (May 2000)
Pei, J., Han, J.: CLOSET: An Efficiently Algorithm for Mining Frequent Closed Itemsets. In: DMKD 2000 (May 2000)
Pei, J., Han, J., Mortazavi-Asi, B., Pino, H.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix Projected Pattern Growth. In: ICDE 2001 (2001)
Wang, J., Han, J., Pei, J.: CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: ACM SIGKDD 2003 (August 2003)
Yun, U., Leggett, J.J.: WFIM: Weighted Frequent Itemset Mining with a weight range and a weight range and minimum weight. In: SDM 2005 (April 2005)
Yun, U., Leggett, J.J.: WLPMiner: Weighted Frequent Pattern Mining with Length-Decreasing Support Constraints. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 555–567. Springer, Heidelberg (2005)
Yun, U., Leggett, J.J.: WIP: Weighted Interesting Patterns with a strong weight and/or support affinity. In: SDM 2006 (April 2006)
Yun, U., Leggett, J.J.: WSpan: Weighted Sequential Pattern mining in large sequence databases. In: Proc. of the Third Int’l Conf. on IEEE Intelligent Systems (September 2006)
Yun, U.: Mining Lossless Closed Frequent Patterns with Weight Constraints. Knowledge Based Systems 20, 86–97 (2007)
Yun, U.: WIS: Weighted Interesting Sequential Pattern Mining with a Similar Level of Support and/or Weight. ENRI Journal 29(3) (June 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, E., Kim, Y., Kim, I., Yoon, J., Lim, J., Kim, U. (2012). CWFM: Closed Contingency Weighted Frequent Itemsets Mining. In: Perner, P. (eds) Advances in Data Mining. Applications and Theoretical Aspects. ICDM 2012. Lecture Notes in Computer Science(), vol 7377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31488-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-31488-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31487-2
Online ISBN: 978-3-642-31488-9
eBook Packages: Computer ScienceComputer Science (R0)