[1] Agrawal R, Smkant R. Fast Algorithms for Mining Association Rules[C]//Proc. of the 20th International Conference on Very Large Databases. Santiago, Chile: [s. n.], 1994: 487-499. [2] Han Jiawei, Pei Jian. Mining Frequent Patterns by Pattern-growth: Methodology and Implications[C]//Proc. of ACM SIGKDD’00. [S. l.]: ACM Press, 2000: 14-20. [3] Yuan Yubo, Huang Tingzhu. A Matrix Algorithm for Mining Association Rules[C]//Proc. of ICIC’05. Hefei, China: [s. n.], 2005. [4] 李成军, 杨天奇. 一种改进的加权关联规则挖掘方法[J]. 计算机工程, 2010, 36(7): 55-57. [5] Agrawal R, Srikant R. Mining Quantitative Association Rules in Large Relational Table[C]//Proc. of ACM SIGMOD’96. Montreal, Australia: [s. n.], 1996. [6] Pedrycz W. Fuzzy Sets Technology in Knowledge Discovery[J]. Fuzzy Sets and Systems, 1998, 98(3): 279-290. [7] Ishibuchi H, Nakashima T, Yamamoto T. Fuzzy Association Rules for Handling Continuous Attributes[C]//Proc. of IEEE ISIE’01. Pusan, Korea: IEEE Press, 2001: 118-121. [8] Kuok Chan-Man, Fu Ada, Wong Man-Hon. Mining Fuzzy Association Rules in Database[C]//Proc. of ACM SIGMOD’98. [S. l.]: ACM Press, 1998: 41-46. [9] Fu Ada, Wong Man-Hon, Sze Siu-Chun, et al. Finding Fuzzy Sets for the Mining of Association Rules for Numerical Attributes[C]// Proc. of IDEL’98. Hong Kong, China: [s. n.], 1998: 263-268. [10] Xu Lei, Krzyzak A, Oja E. Rival Penalized Competitive Learning for Clustering Analysis, RBF Net, and Curve Detection[J]. IEEE Transactions on Neural Networks, 1993, 4(4): 636-649. [11] Kaya M, Alhajj R, Polat F, et al. Efficient Automated Mining of Fuzzy Association Rules[C]//Proc. of International Conf. on Database and Expert Systems with Applications. Aix en Provence, France: [s. n.], 2002. [12] Lee Chyi-Yeong, Hong Tzung-Pei, Lin Wenyang. Mining Association Rules with Multiple Minimum Supports Using Maximum Constraints[J]. International Journal of Approximate Reasoning, 2005, 40(1/2): 44-54. [13] Hong Tzung-Pei, Kuo Chan-Sheng, Chi Sheng-Chai. Mining Association Rules from Quantitative Data[J]. Intelligent Data Analysis, 1999, 3(5): 363-376.
|