A Mining Algorithm of Single-Dimensional Boolean Association Rules Based on Rough Set
(1.College of Physics Science & Information Engineering,Jishou University.Jishou 416000,Hunan China;2.College of Information Management & Engineering,Jishou University,Zhangjiajie 427000,Hunan China)
ZHUO Yue-Ming, QIN Zun-Yue, HU Bin. A Mining Algorithm of Single-Dimensional Boolean Association Rules Based on Rough Set[J]. journal6, 2006, 27(4): 64-67.
[1] AGRAWAL R,SRIKANT R.Fast Algorithms for Mining Association Rules [A].BOCCA J B,JARKE M,ZANIOLO C,ets.Proceedings of the 20th International Conference on VLDB [C].SanFrancisco:Morgan Kaufmann Publishers,1994.[2] AGRAWAL R,SRIKANT R.Mining Sequential Patterns [A].YU P S,CHEN A L P,eds.Proceedings of the 11th International Conference on Data Engineering [C].Los Alamitos,CA:IEEE Computer Society,1995.[3] BAYARDO R J.Efficiently Mining Long Patterns from Databases [A].HASS L M,TIWARY A,eds.Proceedings of the ACM SIGMOD InternationalConference on Management of Data [C].New York:ACM Press,1998.[4] DAO-I LIN,ZVI M KEDEM.Pincer-Search:A New Algorithm for Discovering the Maximum Frequent Set (1997) Lecture Notes in Computer Science [A].Proceedings of the 6th European Conference on Extending Database Technology Heidelberg:Springverlag,1998.[5] 吉根林,杨明,宋余庆,等.最大频繁项目集的快速更新 [J].软件学报,2005,28(1):128-135.[6] 曾黄麟.智能计算 [M].重庆:重庆大学出版社,2004.[7] 范明,孟小峰.数据挖掘概念与技术 [M].北京:机械工业出版社,2005.