Fast Mining Maximum Frequent Itemsets

微信服务号

微信订阅号

2025-5-17- 13

Home
About JOS
Editorial Board
Instructions
Ethics Statement
Archive
Contact
Chinese

Home > Archive>Volume 12, Issue 2, 2001 >293-297 Online First

PDF HTML XML Export Cite reminder

Fast Mining Maximum Frequent Itemsets
DOI:
                        
                    
Author:
                        Lu Song-fengLu Song-feng

Find this author on CNKI
Find this author on BaiDu
Search for this author on this site
Lu Zheng-dingLu Zheng-ding

Find this author on CNKI
Find this author on BaiDu
Search for this author on this site

                    
Affiliation:
Clc Number:
Fund Project:

Article

Figures

Metrics

Reference [4]

Related [20]

Cited by [98]

Materials

Comments

Abstract:

Discovering maximum frequent itemsets is a key problem in many data mining applications. In this paper,the DMFI (discovery maximum frequent itemsets) algorithm which combines the bottom-up and top-down searches is proposed to solve this problem. Using the unique ordering method and efficient pruning strategy, the number of candidete itemsets is greatly decrcased, therefore CPU time is reduced remarkably.

Key words:data mining; knowledge discovery; association rule; maximum frequent itemset: minimum support

Reference

[1]Agrawal, R., Srikant, R. Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C., eds. Proceedings of the 20th International Conference on Very Large Databases. San Francisco: Morgan Kaufmann Publishers, 1994. 487～499.

[2]Agrawal, R., Srikant, R. Mining sequential patterns. In: Yu, P.S., Chen, A.L.P., eds. Proceedings of the 11th International Conference on Data Engineering. Los Alamitos, CA: IEEE Computer Society, 1995. 3～14.

[3]Bayardo, R. Efficiently mining long patterns from databases. In: Haas, L.M., Tiwary, A., eds. Proceedings of the ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 1998. 85～93.

[4]Lin, Dao-I, Kedem, Z.M. Pincer-Search: a new algorithm for discovering the maximum frequent set. In: Schek, H.J., Saltor, F., Ramos, I., et al, eds. Proceedings of the 6th European Conference on Extending Database Technology. Heidelberg: Springer-Verlag, 1998. 105～119.

[1]Lu Song-feng and Lu Zheng-ding.Fast Mining Maximum Frequent Itemsets[J].Journal of Software,2001,12(2):293-297.

[2]LU Jie-Ping,YANG Ming,SUN Zhi-Hui and JU Shi-Guang.Fast Mining of Global Maximum Frequent Itemsets[J].Journal of Software,2005,16(4):553-560.

[3]SONG Yu-Qing,ZHU Yu-Quan,SUN Zhi-Hui and CHEN Geng.An Algorithm and Its Updating Algorithm Based on FP-Tree for Mining Maximum Frequent Itemsets[J].Journal of Software,2003,14(9):1586-1592.

[4]SONG Guo-jie,TANG Shi-wei,YANG Dong-qing,WANG Teng-jiao and YE Heng-qiang.An Algorithm of Mining Personal Moving Patterns in a Wireless Communication Environment[J].Journal of Software,2002,13(8):1465-1471.

[5]YANG Junrui.Inverse Heuristic Mining Maximum Frequent Itemsets[J].Computer Engineering,2004,30(14):116-118.

[6]SONG Hai-sheng.A Fast Algorithm for Mining Maximum Frequent Item Sets[J].Application Research of Computers,2004,21(3):45-46.

[7]QIAN Jin.Research and Prospect on Technology of Maximum Frequent Itemsets Mining[J].Microcomputer Applications,2005,26(6):652-654.

[8]WANG Le,WANG Shui,CHEN Bo,DONG Peng.Algorithm for mining maximum frequent itemset based on intersection pruning[J].Computer Engineering and Applications,2009,45(13):156-159.

[9]Wang Liang,Jiang Lihong.Fast Algorithm for Discovering Maximum Frequent Pattern[J].Computer Engineering and Applications,2006,42(17):177-179.

[10]MEI Jun,ZHENG Gang.An Algorithm for Mining Maximum Frequent Item Sets Based on FP-tree[J].Modem Computer,2009(9):33-36.

[11]CHEN Xu-hui,JIANG Hong.Algorithm for mining maximal frequent item sets based on bi-directional searches[J].Computer Engineering and Design,2007,28(14):3288-3290.

[12]FANG Gang.Algorithm of long frequent item sets mining based on binary[J].Computer Engineering and Design,2008,29(24).

[13]HE Bo (School of Computer Science , Engineering,Chongqing University of Technology,Chongqing ,China..Fast mining of global maximum frequent itemsets in distributed database[J].Control and Decision,2011,26(8):1214-1218,1223.

[14]YANG Pengkun,PENG Hui,ZHOU Xiaofeng,SUN Yuqing.FP-MFIA: improved algorithm for mining maximum frequent itemsets based on frequent-pattern tree[J].Journal of Computer Applications,2015,35(3):775-778.

[15]Jiang Han,Jia Jiong.Fast Mining of Maximum Frequent Itemsets Based on FP-Tree[J].Journal of Computer Research and Development,2007,44(Z2):334-349.

[16]ZHANG Xin,LIAO Pin,GUO Bo.A New Algorithm of Mining Maximal Frequent Itemsets Based on Conditional Matrix[J].Computer Simulation,2010,27(11).

[17]ZHANG Zhi-gang,HUANG Liu-sheng,JIN Zong-an,XIANG Li-ping.Maximal Frequent Itemset Mining Based on Parent-child Equivalency Pruning Strategy[J].Computer Engineering,2013,39(4).

[18]JI Gen-Lin,YANG Ming,SONG Yu-qing,SUN Zhi-hui.Fast Updating Maximum Frequent Itemsets[J].Chinese Journal of Computers,2005,28(1):128-135.

[19]HU Jian,WU Mao mao.An improved algorithm for mining maximal frequent itemsets over data streams[J].Computer Engineering & Science,2014,36(5):963-970.

[20]WANG Won,XIE Huo-sheng.Fast Algorithm for mining constrained maximal frequent patterns[J].Control & Automation,2009,25(15).

Cited by

[1]CUI Xiao-Jun.An Efficient Algorithm of Generating Frequent Itemsets Based on Dividing Items[J].Journal of Xiangfan Vocational and Technical College,2006,5(5):3-4.

[2]ZHANG Shun-zhong,WANG Shu-mei,HUANG He-yang,CHEN Zhao-xiong.Genetic Algorithms Based on Variable Neighborhood Search for Mining Long Frequent Itemsets[J].Journal of Chinese Information Processing,2006,20(6):10-16.

[3]LI Li - heng,ZHANG Cheng- jiang,YAN Chao- sheng.Analysis of the discipline of compatibility of medicines in compound[J].Information on Traditional Chinese Medicine,2006,23(4):4-5.

[4]SONG Wei-lin, XU Hui-min.Improvement of DMFIA algorithm based on mining of maximal frequent item sequence sets[J].Computer Engineering and Design,2007,28(7):1493-1496,1500.

[5]Yang Kai ,Zhang Xiaoping, Ma Yuan (College of Computer Engineering.An Efficient Algorithm of Mining Association Rules Based on Dividing Attributes[J].Computer Engineering and Applications,2005,41(31):157-159.

[6]JI Gen,Lin,1),2),YANG Ming,1),2),SONG Yu,Qing,1),SUN Zhi,Hui,1),1).Fast Updating Maximum Frequent Itemsets[J].Chinese Journal of Computers,2005,28(1):128-135.

[7]Yan Yuejin,Li Zhoujun,and Chen Huowang.A Depth-First Search Algorithm for Mining Maximal Frequent Itemsets[J].Journal of Computer Research and Development,2005,42(3):462-467.

[8]Song Yuqing1,2,Zhu Yuquan2,Sun Zhihui1,and Yang Hebiao21.An Algorithm and Its Updating Algorithm Based on Frequent Pattern Tree for Mining Constrained Maximum Frequent Itemsets[J].Journal of Computer Research and Development,2005,42(5):777-783.

[9]LEI Hong-yan~1,ZOU Han-bin~2.An Algorithm for Interactive Mining Maximal Frequent Itemset Based on Inverted Matrix[J].Computer and Modernization,2005(3):1-4.

[10]LIU Nai-li,LI Yu-chen,MA Lei.Algorithm for mining maximum frequent itemsets based on FP-tree[J].journal of Computer Applications,2005,25(5):998-1000.

[11]LI Qing-feng~.Study for Mining Maximally Frequent Item Sets in Association Rule[J].Application Research of Computers,2005,22(1):93-95,98.

[12]YAN Yue-Jin+,LI Zhou-Jun,CHEN Huo-Wang.Efficiently Mining of Maximal Frequent Item Sets Based on FP-Tree[J].Journal of Software,2005,16(2):215-222.

[13]LU Jie-Ping1+,YANG Ming1,SUN Zhi-Hui1,JU Shi-Guang2 1.Fast Mining of Global Maximum Frequent Itemsets[J].Journal of Software,2005,16(4):553-560.

[14]QIAN Jin.Research and Prospect on Technology of Maximum Frequent Itemsets Mining[J].Microcomputer Applications,2005,26(6):652-654.

[15]YANG Junrui.Inverse Heuristic Mining Maximum Frequent Itemsets[J].Computer Engineering,2004,30(14):116-118.

[16]徐慧英　朱信忠　熊岳山.一种基于FP-Tree的关联规则数据挖掘改进算法及实现[J].Computer Science,2004,31(Z2):206-209.

[17]陈晴光,李际军.Realization Tactics of Associated Rule Exploration and Dynamic Updating for Automotive ERP System[J].Machinery,2004,42(6):69-72.

[18]杨君锐　赵群礼.An Algorithm for Mining Maximum Frequent Itemsets without Candidate Generation[J].Microelectronics & Computer,2004,21(11):125-128.

[19]杨君锐.New algorithm of fast mining maximum frequent itemsets[J].JOurnal of Chang’an University:Natural Science Edition,2004,24(6):102-105.

[20]李宏　杜剑峰　陈松乔.Mining Association Rules with Item Constraints in Distributed Database[J].Journal of Central South University:Science and Technology,2004,35(6):998-1003.

[21]袁鼎荣李波.频繁项集挖掘技术述评[J].Journal of Guangxi University For Nationalities(Natural Science Edition),2005,11(1):86-90.

[22]杨旭东宋余庆朱玉全.基于位串数组的最大频繁项目集挖掘算法[J].Journal of East China Shipbuilding Institute(Natural Science Edition),2005,19(1):32-36.

[23]ZHOU Yu-min, DENG Wei-bin.Incremental Updating Algorithm for Maximum Frequent Itemsets Based on FP-tree[J].Journal of Chongqing Institute of Technology,2007,21(9):5-98,128.

[24]XIAO Wen,JU Shi-guang,ZHU Jin-wei,XIN Yan,LIU Zhi-feng.Two-dimensional Maximal Frequent Itemset Mining Algorithm in Traditional Chinese Medicine Field[J].Mini-micro Systems,2007,28(12):2193-2198.

[25]刘金岭.数据挖掘技术在商品销售预测方面的应用[J].Market Modernization,2008(5):31-32.

[26]FENG Feng.A Fast Updating Algorithm for Mining Maximum Frequent Itemsets[J].Journal of Hefei University :Natural Sciences,2007,17(4):46-49.

[27]SONG Yu-Qing1,ZHU Yu-Quan1,2+,SUN Zhi-Hui1,CHEN Geng1 1.An Algorithm and Its Updating Algorithm Based on FP-Tree for Mining Maximum Frequent Itemsets[J].Journal of Software,2003,14(9):1586-1592.

[28]WANG TAO,BAI SIXUE.Study of Maximum Frequent Item Sets based on web log mining[J].Control & Automation,2007,23(15):139-140.

[29]吴聪聪　李忠哗　何丕廉.A Mining Algoritm of Maximum Frequent Itemsets and Updating Based on Matrix[J].Microelectronics & Computer,2007,24(12):29-31.

[30]陈健美　朱玉全　宋顺林　桂长青　宋余庆.Research on Algorithm for Mining Global Closed Itemsets[J].Computer Science,2008,35(1):193-195.

[31]李清峰　周鲜成　王莉　周伟林.Mining maximal frequent patterns using minimal combination algorithm[J].Application Research of Computers,2008,25(3):702-704.

[32]姜晗　贾泂.Fast Mining of Maximum Frequent Itemsets Based on FP-Tree[J].Journal of Computer Research and Development,2007,44(Z2):334-349.

[33]娄会东　苏瑞　金建军.Data mining on the exploration of pattern and rule[J].JOURNAL OF HENAN POLYTECHNIC UNIVERSITY,2007,26(4):467-471.

[34]CHEN Jian-mei,ZHU Yu-quan,NI Wei-wei,SONG Yu-qing,SONG Shun-lin,GUI Chang-qing.An Efficient Algorithm for Updating Global Frequent Closed Itemsets[J].Mini-micro Systems,2008,29(7).

[35]WU Hua-rui,ZHANG Feng-xia,ZHAO Chun-jiang.An algorithm for mining association rules with multiple minimum supports[J].Journal of Harbin Institute of Technology,2008,40(9).

[36]ZHANG Zhong-ping,SONG Xiao-hui,SONG Shao-ying.Algorithm for mining maximal frequent itemsets based on OUS[J].Computer Engineering and Applications,2008,44(24):148-150.

[37]JIANG Han,JIA Jiong,XU Feng.Mining of maximum frequent itemsets and frequent closed itemsets based on frequent itemsets[J].Computer Engineering and Applications,2008,44(28):146-148.

[38]SONG Jie,LIU Hua,TAN Qing,GU Jun-hua.Application of ACS for mining maximum frequent itemsets[J].Computer Engineering and Design,2008,29(20).

[39]郑海明.Research on Maximal Frequent Item FP-MFI Algorithm Based on FP-tree[J].Modem Computer,2008(10).

[40]LI Jun-li.A Kind Connection Rule Scoop out Technique of Atrix Hand over to Gather Calculate Way[J].Journal of Xinyang Teachers College(Natural Science Edition),2008,21(4).

[41]ZHENG Bin.Frequent Pattern Mining Based on SQL Technology[J].Journal of Zhongyuan Institute of Technology,2008,19(5).

[42]ZHOU Yu-min,DENG Wei-bin.Incremental Updating Algorithm for Maximum Frequent Itemsets Based on FP-tree[J].Journal of Chongqing Institute of Technology,2007,21(5):95-98,128.

[43]Zhao Qun-li.An Integrated Updating Algorithm for Mining Maximal Frequent Itemsets Based on FP-Tree[J].Journal of Anhui Institute of Education,2006,24(3):42-47.

[44]XIE Zhi-qiang,ZHU Meng-jie,YANG Jing.Maximum frequent itemsets mining algorithm based on improved FP-tree[J].Application Research of Computers,2009,26(2):502-505.

[45]方刚.Algorithm of long frequent item sets mining based on binary[J].Computer Engineering and Design,2008,29(24).

[46]段仰广,韦玉科.An Efficient Algorithm for Mining Maximal Frequent Patterns Based on Sorted FP-TREE[J].Journal of Guangdong University of Technology,2009,26(2).

[47]FANG Gang,XIONG Jiang.Algorithm of intercrossing mining association rules based on binary[J].Computer Engineering and Applications,2009,45(7):141-145.

[48]LUO Ke,ZHANG Xue-mao.An efficient frequent itemset mining algorithm[J].Journal of Changsha University of Science and Technology:Natural Science,2006,3(3):84-90.

[49]钱进.Research on Maximum Frequent Itemsets Mining Technology[J].职教通讯(江苏技术师范学院学报),2004,10(4).

[50]WEI Yu-ming,YUAN Ding-rong,CHEN Hong-chao.A new algorithm for mining frequent sets[J].Journal of Guangxi University of Technology,2003,14(2):38-41.

[51]HE Jing,WANG Lizhen,ZOU Likun,ZHANG Zhongyu.A Sequence-based Algorithm for the Fast Discovery of Maximum Frequent Itemsets[J].Computer Engineering,2003,29(16):62-64.

[52]Jiang Yuquan.Incremental Updating Algorithm for Mining Maximum Frequent Item sets[J].Computer Engineering and Applications,2003,39(24):187-188,201.

[53]Yang Ping.A Fast Mining Algoritm of Maximum Frequent Itemsets Based on F-matrix[J].Computer Engineering and Applications,2003,39(34):197-200.

[54]YUAN Ding-Rong ZHANG Shi-Chao.An Algorithm of Mining Frequent Set Based on Frequent Link[J].Computer Science,2003,30(7):165-166.

[55]YANG Ming,SUN Zhi,Hui,and JI Gen,Lin.Fast Mining of Global Frequent Itemsets[J].Journal of Computer Research and Development,2003,40(4):620-626.

[56]宋晶晶,姜保庆,关丽霞.在单向FP—tree上挖掘最大频繁项集[J].Modem Computer,2010(1):19-24.

[57]ZHANG Ji-xiang,LI Gui-jie.A Bit String Array-Based Mining Algorithm for Maximum Frequent Itemset[J].Computer Engineering & Science,2006,28(6):90-91.

[58]ZHANG Feng-xia1,WU Hua-rui2,YANG Bao-zhu3.Research for agriculture expert system based on component grid[J].Computer Engineering and Design,2006,27(6):924-927.

[59]WANG Tao-wei,HU Xi-wei,CHAI Ben-cheng.Research on frequent itemsets based on SQL[J].Computer Engineering and Design,2006,27(23):4494-4497.

[60]LI Wei/a>,LI Xian-guo /a>.Study of Improved Algorithm for Mining Based on Frequent Pattern Array[J].Science Technology and Engineering,2010,10(4).

[61]Wang Liang,Jiang Lihong.Fast Algorithm for Discovering Maximum Frequent Pattern[J].Computer Engineering and Applications,2006,42(17):177-179.

[62]惠亮,钱雪忠.Non-check mining algorithm of maximum frequent patterns in association rules based on FP-tree[J].journal of Computer Applications,2010,30(7).

[63]WANG Tao-wei.The Study of Frequent Access Pages Mining Based on Web Log[J].Computer Systems& Applications,2006(10):30-34.

[64]任永功,张亮,付玉.Algorithm Based on FP-tree for Mining Frequent Closed Itemsets[J].Mini-micro Systems,2010,31(2).

[65]王运鹏　胡修林　阮幼林.Fast Algorithm for Mining Maximum Frequent Patterns[J].Application Research of Computers,2006,23(10):86-88.

[66]CUI Hai-li,YUAN Zhao-shan.A fast algorithm for mining maximum frequent itemsets[J].Journal of Hefei University of Technology(Natural Science),2006,29(11):1392-1395.

[67]LEI Hong-yan1,2,ZOU Han-bin2.An Method of Mining Association Rule without Minimal Support[J].Journal of Hunan University of Arts and Science:Natural Science Edition,2005,17(2):65-67.

[68]HUANG Shu-zhuang.An Analysis and Comparison of Frequent Itemsets Mining Algorithm[J].Journal of Dezhou University,2005,21(6):65-71.

[69]QIAN Jin.Research on Maximum Frequent Itemsets Mining Technology[J].Journal of Jiangsu Teachers University of Technology,2004,10(4):61-64.

[70]YUAN Ding-rong~1,LI Bo~2.Commentary About Technology of Mining Frequent Itemsets[J].Journal of Guangxi University For Nationalities(Natural Science Edition),2005,11(1):86-90.

[71]杨旭东　宋余庆　朱玉全.Mining Algorithm for Maximum Frequent Itemsets Based on Bit String Array[J].Journal of Jiangsu University of Science and Technology:Natural Science Edition,2005,19(1):32-36.

[72]杨君锐,赵群礼.An algorithm of the updating mining for mining maximum frequent itemsets based on FP-Tree[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2004,32(11):88-90.

[73]DONG PING, XU JIE ,SU LIPING.A improved FP-growth mining algorithm based on TFP-tree[J].Control & Automation,2007,23(33):139-140,97.

[74]Li Zhonghua, Ren Chunlong, He Pilian.AN FP-TREE BASED INCREMENTAL UPDATING ALGORITHM FOR MAXIMAL FREQUENT PATTERNS MINING[J].Computer Applications and Software,2007,24(5):47-49.

[75]Li Zhonghua, Wu Congcong, Dai Weidi,He Pilian.AN ALGORITHM FOR MINING MAXIMUM FREQUENT ITEMSETS BASED ON FP-ARRAY[J].Computer Applications and Software,2007,24(7):5-46,53.

[76]SONG Wei-lin, XU Hui-min.Improvement of ISS_DM algorithm based on mining of maximal frequent item sequence sets[J].Computer Engineering and Design,2007,28(3):500-503.

[77]CHEN Xu-hui, JIANG Hong.Algorithm for mining maximal frequent item sets based on bi-directional searches[J].Computer Engineering and Design,2007,28(14):3288-3290.

[78]LI Zhong-hua, WU Cong-cong, HE Pi-lian.An Algorithm for Mining Constrained Maximum Frequent Itemsets[J].Microelectronics & Computer,2007,24(11):70-72,76.

[79]邵勇,陈波,史宝东,刘长征.Fast Update Algorithm for Association Rule[J].Computer Engineering,2009,35(19):62-64,68.

[80]Zhou Haiyan.The concept of maximum frequent itemsets for mining of association rules[J].Computers and Applied Chemistry,2009,26(11).

[81]ZHAO Qun-Li,LU Pu(Department of Computer Science , Technology,Hefei Normal University,Hefei 230061,China).An Algorithm for Mining Maximum Frequent Itemsets Based on T-tree[J].Journal of Anhui Institute of Education,2009,27(6).

[82]周海岩.Maximal frequent item set mining with establishment of frequent item set vectors[J].System Engineering and Electronics,2009,31(10).

[83]阮群生,李豫颖,刘锡铃.基于哈希表与线性表建立FP-Tree的改进算法[J].Journal of Yangtze University,2010(1):76-79.

[84]蒋翠清,胡俊妍.Algorithm for mining maximum frequent itemsets based on FP-tree[J].Journal of Hefei University of Technology(Natural Science),2010,33(9).

[85]琚春华,许翀寰.Maximal Frequent Itemsets in Data Stream Mining Based on Orderly-Compound Policy[J].Journal of the China Society for Scientific andTechnical Information,2010,29(5).

[86]Yuan Dingrong,Yan Xiaowei.ANALYZING AND STUDYING ABOUT ALGORITHM OF MINING MAXIMUM FREQUENT ITEMSET[J].Computer Applications and Software,2005,22(12):21-23,40.

[87]WANG Xiao-xiang,PENG Yu-qing,GU Jun-hua.Optimization algorithm of fast and effectively mining maximum frequent itemsets[J].Journal of Zhengzhou Institute of Light Industry(Natural Science),2005,20(1):92-94.

[88]HUANGPU Gang~1,WANG Ning_bo~2.Application of data mining in the research field of esophagus cancer and cardiac cancer[J].Journal of Zhengzhou Institute of Light Industry(Natural Science),2005,20(2):90-93.

[89]CHENG Can,LIANG Jun,ZHANG Chao-ying.Algorithm for Mining Frequent ltem Sets Based on Genetic Particle Swarm Optimization[J].Modem Computer,2009(1).

[90]MEI Jun,ZHENG Gang.An Algorithm for Mining Maximum Frequent Item Sets Based on FP-tree[J].Modem Computer,2009(9):33-36.

[91]ZHANG Xin,LIAO Pin,GUO Bo.A New Algorithm of Mining Maximal Frequent Itemsets Based on Conditional Matrix[J].Computer Simulation,2010,27(11).

[92]HUANG Hongxing,WANG Xiuli,HUANG Xipei.Modified ant colony optimization for mining maximal frequent itemsets[J].Computer Engineering and Applications,2011,47(13):161-165.

[93]HE Bo (School of Computer Science , Engineering,Chongqing University of Technology,Chongqing ,China..Fast mining of global maximum frequent itemsets in distributed database[J].Control and Decision,2011,26(8):1214-1218,1223.

[94]Yan Wei,Zhao Jie,Li Haibo.Research on Agriculture Data Maximal Frequent Itemsets Updating Mining Algorithm[J].Journal of Agricultural Mechanization Research,2011,33(8).

[95]QIAN Xue-zhong,HUI Liang.Algorithm for mining maximum frequent itemsets based on decreasing dimension of frequent itemset in association rules[J].journal of Computer Applications,2011,31(5).

[96]HE Bo.Fast algorithm for mining global maximum frequent itemsets based on FP-tree[J].Computer Integrated Manufacturing Systems,2011,17(7).

[97]PAN Yan-yan.A study and analysis of DHP algorithm for association rules[J].Journal of Foshan University(Natural Science Edition),2012,30(2):30-32.

[98]Yang Qingxia,He Mingxiang,Qiu Dongdong,Nie Baojun.A New Algorithm for Mining Maximum Frequent Itemsets Based on FP-Tree[J].CHINA SCIENCE AND TECHNOLOGY INFORMATION,2012(14):88-89.

Comments

分享到微博

Submit

Get Citation

路松锋,卢正鼎.快速开采最大频繁项目集.软件学报,2001,12(2):293-297

Copy

微信扫一扫：分享

微信里点“发现”，扫一下

二维码便可将本文分享至朋友圈。

Article Metrics

Abstract:5013
PDF: 5570
HTML: 0
Cited by: 0

History

Received:July 30,1999
Revised:December 08,1999
Adopted:
Online:
Published:

Links:Institute of Software, CASChina Computer FederationCASNSFC

You are the first2045175Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063