Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of East China Shipbuilding Institute(Natural Science Edition)》 2005-01
Add to Favorite Get Latest Update

Mining Algorithm for Maximum Frequent Itemsets Based on Bit String Array

YANG Xu-dong, SONG Yu-qing, ZHU Yu-quan (School of Computer Science and Communications Eng., Jiangsu University, Zhenjiang Jiangsu 212013, China)  
Based on the association rule mining algorithm with bit string array,a fast algorithm for mining maximum frequent itemsets with bit string array(BSA-MFIA) is proposed.It scans transaction database D twice and creates the bit string array constructed by “0” and “1”.The bit string array is very suitable for compressing,coding and storing.It may save the storage of the memory efficiently.Then,the maximum frequent itemsets can be mined by using the simple bit operations.As a result,the algorithm not only facilitates the implementation,but also improves the mining efficiency.
【Fund】: 国家自然科学基金(70371015)
【CateGory Index】: TP311
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
Chinese Journal Full-text Database 2 Hits
1 Meng Xiangping 1 Qian Jin 2 Feng Lei 1 Zheng Wen 1 Zhang Weijun 11 (Department of Electrical Engineering,Changchun Institute of Technology,Changchun130012) 2 (Department of Information Engineering,Northeast China Institute of Electric Power Engineering,Jilin132012);Bit String Array-based Association Rules Mining Algorithm[J];Computer Engineering and Applications;2004-08
2 LU Song feng,\ LU Zheng ding(College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China);Fast Mining Maximum Frequent Itemsets[J];Journal of Software;2001-02
Chinese Journal Full-text Database 10 Hits
1 Zhao Qun-li(Department of Computer Science and Technology,Anhui Institute of Education,Hefei,230061);An Integrated Updating Algorithm for Mining Maximal Frequent Itemsets Based on FP-Tree[J];Journal of Anhui Institute of Education;2006-03
2 LEI Hong-yan1,2, ZOU Han-bin2 (1 College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan Hubei 430074; 2 Department of Computer Science , Hunan University of Arts and Science, Changde Huna 415000);An Method of Mining Association Rule without Minimal Support[J];;2005-02
3 QIAN Jin(Department of Computer Science and Technology, Jiangsu Teachers University of Technology, Changzhou 213001, China);Research on Maximum Frequent Itemsets Mining Technology[J];Journal of Jiangsu Teachers University of Technology;2004-04
4 Duan Yang-guang,Wei Yu-ke(Faculty of Computer,Guangdong University of Technology,Guangzhou 510006,China);An Efficient Algorithm for Mining Maximal Frequent Patterns Based on Sorted FP-TREE[J];Journal of Guangdong University of Technology;2009-02
5 WEI Yu-ming, YUAN Ding-rong, CHEN Hong-chao(Faculty of Mathematics and Computer Science, Guangxi Normal University,Guangxi Guilin, 541004, China);A new algorithm for mining frequent sets[J];Journal of Guangxi Institute of Technology;2003-02
6 YUAN Ding-rong~1,LI Bo~2 (1.Faculty of Mathematics Computer Science, Guangxi Normal University , Guilin 541004,China; 2.Dept.of Foreign Language,Guangxi Normal University , Guilin 541004,China);Commentary About Technology of Mining Frequent Itemsets[J];Journal of Guangxi University For Nationalities(Natural Science Edition);2005-01
7 ZHAO Qun-Li;LU Pu(Department of Computer Science and Technology,Hefei Normal University,Hefei 230061,China);An Algorithm for Mining Maximum Frequent Itemsets Based on T-tree[J];Journal of Hefei Teachers College;2009-06
8 MEI Deng-hua,CAI Shao-wei(South China University of Technology,Guangzhou 510006,China);Algorithm for mining maximal frequent itemsets based on layer[J];Electronic Design Engineering;2010-03
9 RUAN Qun-sheng,LI Yu-ying,LIU Xi-ling (Ningde Teachers College,NingDe 352100);A New Algorithm of FP-tree Establishment on the Basis of Hash Table and Linear Ojbect Table[J];Journal of Yangtze University(Natural Science Edition) Sci & Eng V;2010-01
10 WU Hua-rui1,ZHANG Feng-xia2,ZHAO Chun-jiang3(1.College of Computer Science,Beijing University of Technology,Beijing 100022,China;2.School of Mathematics Science,Liaocheng University,Liaocheng 252059,China;3.National Engineering Research Center for Information Technology in Agriculture,Beijing 100097,China);An algorithm for mining association rules with multiple minimum supports[J];Journal of Harbin Institute of Technology;2008-09
China Proceedings of conference Full-text Database 4 Hits
1 ;An Algorithm Based on Frequent Pattern Tree for Mining Maximum Frequent Itemsets[A];[C];2002
2 ;A Fast Algorithm for Discovering Maximal Frequent Itemsets Based on Frequent Pattern List[A];[C];2005
3 Wang Wen and Xie Huosheng (College of Mathematics and Computer Science,Fuzhou University,Fuzhou 350002);Algorithm for Mining Maximal Frequent Patterns Based on FP-Tree and Symmetrical Matrix[A];[C];2008
4 YANG Jun-Rui~1,ZHAO Qun-Li~1,and DU Jian~2 1(Department of Computer Science,Xi'an University of Science & Technology,Xi'an 710054) 2(School of Automobile,Chang'an University,Xi'an 710064);Research on the Incremental Updating Methods for Mining Maximum Frequent Itemsets[A];[C];2004
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved