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.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved