Efficiently Mining Maximal Frequent Mutually Associated Patterns

Mutually associated pattern mining can find such type of patterns whose any two sub-patterns are associated. However, like frequent pattern mining, when the minimum association threshold is set to be low, it still generates a large number of mutually associated patterns. The huge number of patterns produced not only reduces the mining efficiency, but also makes it very difficult for a human user to analyze in order to identify interesting/useful ones. In this paper, a new task of maximal frequent mutually associated pattern mining is proposed, which can dramatically decrease the number of patterns produced without information loss due to the downward closure property of the association measure and meanwhile improve the mining efficiency. Experimental results show that maximal frequent mutually associated pattern mining is quite a necessary approach to lessening the number of results and increasing the performance of the algorithm. Also, experimental results show that the techniques developed are much effective especially for very large and dense datasets.

[1]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[2]  Jiawei Han,et al.  CCMine: Efficient Mining of Confidence-Closed Correlated Patterns , 2004, PAKDD.

[3]  Heikki Mannila,et al.  Discovery of Frequent Episodes in Event Sequences , 1997, Data Mining and Knowledge Discovery.

[4]  Jiawei Han,et al.  CoMine: efficient mining of correlated patterns , 2003, Third IEEE International Conference on Data Mining.

[5]  Jiawei Han,et al.  Efficient mining of partial periodic patterns in time series database , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[6]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[7]  Edward Omiecinski,et al.  Alternative Interest Measures for Mining Associations in Databases , 2003, IEEE Trans. Knowl. Data Eng..

[8]  Heikki Mannila,et al.  Efficient Algorithms for Discovering Association Rules , 1994, KDD Workshop.