4Mohammed J. Zaki. Mining Non-Redundant Association Rules[J] 2004,Data Mining and Knowledge Discovery(3):223～248
二级参考文献12
1Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases [A]. In : Bunemuu P, Jajodia S// Proceedings of the 1993 SIGMOD Conference on Management of Data[C]. New York : NY ACM Press, 1993 : 207-216.
2Han Jia-wei, Pei Jian,Yin Yi-wen. Mining frequent patterns without candidate generation [A]. In:Dayal U, Gray P M D, Nishio S// Proceedings of the International Conference on Very Large Database[ C ]. San Francisco, CA : Morgan Kanfmann Press, 1999 : 420-431.
3R Agrawal, R Srikant. Fast algorithms for mining association rules. In: Proc of 1994 Int'l Conf on Very Large Data Bases.Santiago, Chili: VLDB Endowment, 1994. 487--499.
4J S Park, M S Chen, P S Yu. An effective Hash-based algorithm for mining association rules. In: Proc of 1995 ACM-SIGMOD Int'l Cord on Management of Data. San Jose, CA: ACM Press,1995. 175--186.
5S Brin, R Motwani, C Silvemtein. Beyond market basket:Generalizing association rules to correlations. In: Proe of 1997 ACM-SIGMOD Int'l Conf on Management of Data. Tucson, AZ:ACM Press, 1997. 265--276.
6R Agrawal, R Srikant. Mining sequential patterns. In: ICDE'95. Taipei, Taiwan: IEEE Computer Society Press, 1995. 3--14.
7G Dong, J Li. Efficient mining of emerging patterns: Discovering trends and differences. In: Proc of the 5th ACM SIGKDD Int'l Conf on Knowledge Discovery and Data Mining. San Diego, CA:ACM Press, 1999. 43~52.
8J Han, J Pei, Y Yin. Mining frequent patterns without candidate generation. In: Proe of 2000 ACM-SIGMOD Int'l Conf on Management of Data. Dallas, TX: ACM Press, 2000. 1--12.
9Artur Bykowski, Christophe Rigotti. A eondemsed representation to find frequent patterns. In: Proe of the 20th ACM SIGACT-SIGMOD-SIGART Symp on Principles of Database Systems(PODS 2001). Santa Barbara, CA: ACM Press, 2001. 267~273.
