摘要在Apriori算法基础上,提出一种基于事务矩阵的改进算法。On the basis of the classical algorithm for mining association rules,an improved algorithm is proposed based on transaction matrix.
2Agarwal R, Imielinski T, Swami A. Mining Associaiton Rules Between Sots of Items in Large Databttscs [A]. In: Proceeding of 1993 SIGMOD International Conterence on Management of Data [C].New York: ACM Press, 1993:207-216.
3Park J S, Chen M S, Yu P S. Using a Hash-based Method with Transaction Trimming for Mining Associations Rules[J]. IEEE Transactions on Knowledge and Data Engineering, 1997, (9):813-825.
4Agarwal R, Agarwal C. A Tree Projection Algorithm for Generation of Frequent Itemsets[J]. Journal of Parallel and Distributed Compuling,2001, (Special Issue on High Performance Data Mining): 1-23.
5Han Jiawei, Pei Ham Yin Yiwen. Mining Frequent Patterns Without Candidate Generation[A]. In: Proceeding of 2000 ACM SIGMOID International Conference on Management of Data [C]. New York:ACM Press, 2000: 1-12.
6HanJiawei KamberM.Data Mining:Concepts and Techniques[M].北京:高等教育出版社,2001..
7Berry M, Linoff G. Data Mining Techniques[M]. John Wiler, 1997.
9Agrawal R, Srikant R. Mining sequential patterns: [IBM Research Report]. 1995
10Agrawal R, Imielinski T, Swami A. Mining association rules between sets in large databases, In: Proc. the ACM SIGMOD Conf,Management of Data, May 1993, 207-216
