[1]叶海琴,廖 利,王意锋,等.一种新的频繁模式挖掘算法[J].南京理工大学学报(自然科学版),2016,40(01):29.
 Ye Haiqin,Liao Li,Wang Yifeng,et al.New frequent patterns mining algorithm[J].Journal of Nanjing University of Science and Technology,2016,40(01):29.
点击复制

一种新的频繁模式挖掘算法
分享到:

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

卷:
40卷
期数:
2016年01期
页码:
29
栏目:
出版日期:
2016-02-29

文章信息/Info

Title:
New frequent patterns mining algorithm
作者:
叶海琴1廖 利1王意锋2张爱玲3
1.周口师范学院 计算机科学与技术学院,河南 周口 466001; 2.73658部队,安徽 滁州 239421; 3.71352部队 自动化站,河南 安阳 455000
Author(s):
Ye Haiqin1Liao Li1Wang Yifeng2Zhang Ailing3
1.School of Computer Science and Technology,Zhoukou Normal University,Zhoukou 466001,China; 2.73658 Troops,PLA,Chuzhou 239421,China; 3.Automation Station,71352 Troops,PLA,Anyang 55000,China
关键词:
频繁模式 挖掘算法 比特串 支持度 典型集 事务集
Keywords:
frequent patterns mining algorithms bit strings support typical sets transaction sets
分类号:
TP311
摘要:
为了适应由于进行添加、删除、修改操作而频繁变化的数据库以及加速支持度求解过程,该文提出了一种新的频繁模式挖掘算法。该算法将顾客的一次购买行为转化为比特串,通过对比特串的操作,逐渐更新事务集的典型集,从而适应目前数据库的频繁变化。典型集中包含了所有模式,根据支持度阈值可以从典型集中快速找到频繁模式。通过实例分析了该算法面对频繁变化数据库的过程,表明了该算法具有很强的适应数据库变化的能力,并能够根据给定的支持度阈值快速求出所需的频繁模式,仿真实验验证了该算法的有效性和可行性。
Abstract:
In order to adapt to the frequent changes of the database by adding,deleting or modifying operations and speeding up the solving process of support,this paper proposes a new frequent patterns mining algorithm.To adapt to the frequent changes in the current database,customers’ once purchase behavior is converted into a bit string and the typical set of transaction sets is updated gradually by the operation on bit strings in this paper.The typical set includes all patterns.Frequent patterns can be found quickly from the typical set according to the support threshold.An example is used to analyse the process of the algorithm in the face of the frequent change database.It shows that the algorithm has strong ability of adapting to changes in the database and can find the frequent patterns quickly according to the given support threshold.Simulation results verify the effectiveness and feasibility of the algorithm.

参考文献/References:

[1] Agrawal R,Imielinaki T,Swami A.Mining association rules between sets of items in large databases[C]//Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data.Washington D C,USA:ACM Press,1993:207-216.
[2]Yuan M,Ouyang Y X,Xiong Z.A text categorization method using extended vector space model by frequent term sets[J].Journal of Information Science and Engineering,2013,29(1):99-114.
[3]陈晓云,陈袆,王雷,等.基于分类规则树的频繁模式文本分类[J].软件学报,2006,17(5):1017-1025.

Chen Xiaoyun,Chen Yi,Wang Lei,et al.Text categorization based on classification rules tree by frequent patterns[J].Journal of Software,2006,17(5):1017-1025.
[4]Kim H D,Park D H,Lu Y,et al.Enriching text representation with frequent pattern mining for probabilistic topic modeling[J].Proceedings of the American Society for Information Science and Technology,2012,49(1):1-10.
[5]张辉,徐新文,李国辉.新闻事件多维频繁模式挖掘——基于多维属性索引树方法[J].系统工程,2014,32(3):143-148.
Zhang Hui,Xu Xinwen,Li Guohui.Mining multi-dimensional frequent pattern for news event based on multi-dimensional attribute index tree[J].Systems Engineering,2014,32(3):143-148.
[6]陈辉.一种基于位图计算并行挖掘大数据频繁模式算法[J].小型微型计算机系统,2014,35(7):1599-1603.Chen Hui.Parallel mining frequent patterns in big data based on bitmap computation[J].Journal of Chinese Computer Systems,2014,35(7):1599-1603.
[7]郑麟.一种直接生成频繁项集的分治Apriori算法[J].计算机应用与软件,2014,31(4):297-301.Zheng Lin.A divied-and-conquer Apriori algorithm directly generating frequent itemsets[J].Computer Applications and Software,2014,31(4):297-301.
[8]Malpani K,Pal P R.An efficient algorithms for generating frequent pattern using logical table with AND,OR operation[J].Computer Science and Telecommunications,2013,37(1):24-30.
[9]胡绿慧,任玉兰,何振林.基于划分和压缩数据库的改进Apriori算法[J].成都理工大学学报(自然科学版),2015,42(1):110-114.
Hu Lühui,Ren Yulan,He Zhenlin.Improved Apriori algorithm based on classification and database compression[J].Journal of Chengdu University of Technology(Science & Technology Edition),2015,42(1):110-114.
[10]刘双跃,杨蕾,彭丽.基于改进Apriori算法的煤矿物态隐患系统设计与应用[J].煤炭技术,2015,34(4):318-320.
Liu Shuangyue,Yang Lei,Peng Li.Design and application of coal mine state hidden danger system based on data mining[J].Coal Technology,2015,34(4):318-320.
[11]崔旭,刘小丽.基于粗糙集的改进Apriori算法研究[J].计算机仿真,2013,30(1):329-332.Cui Xu,Liu Xiaoli.Improved Apriori algorithm based on rough set[J].Computer Simulation,2013,30(1):329-332.
[12]刘芝怡,常睿.基于矩阵的不确定数据频繁项集快速挖掘算法[J].南京理工大学学报,2015,39(4):420-425.Liu Zhiyi,Chang Rui.Fast algorithm of frequent itemset mining based on matrix from uncertain data[J].Journal of Nanjing University of Science and Technology,2015,39(4):420-425.
[13]Prasad K S N,Ramakrishna S.Frequent pattern mining and current state of the art[J].International Journal of Computer Applications,2011,26(7):33-39.
[14]Jayanthi B,Duraiswamy K.A novel algorithm for cross level frequent pattern mining in multidatasets[J].International Journal of Computer Applications,2012,37(6):30-35.
[15]付冬梅,王志强.基于FP-tree和约束概念格的关联规则挖掘算法及应用研究[J].计算机应用研究,2014,31(4):1013-1019.
Fu Dongmei,Wang Zhiqiang.Mining algorithm of association rule based on FP-tree and constrained concept lattice and application research[J].Application Research of Computers,2014,31(4):1013-1019.
[16]Patro S N,Mishra S,Khuntia P,et al.Construction of FP tree using Huffman coding[J].International Journal of Computer Science Issues,2012,9(3):446-469.
[17]杨鹏坤,彭慧,周晓锋,等.改进的基于频繁模式树的最大频繁项集挖掘算法——FP-MFIA[J].计算机应用,2015,35(3):775-778.
Yang Pengkun,Peng Hui,Zhou Xiaofeng,et al.FP-MFIA:improved algorithm for mining maximum frequent itemsets based on frequent-pattern tree[J].Journal of Computer Applications,2015,35(3):775-778.
[18]Sharma Y,Tech M,SATI V M P,et al.Analysis and implementation of FP & Q-FP tree with minimum CPU utilization in association rule mining[J].International Journal of Computing,Communications and Networking,2012,1(1):39-44.
[19]阴爱英.基于线程并行计算的Apriori算法[J].西安科技大学学报,2014,34(1):71-74.
Yin Aiying.Apriori algorithm based on thread parallel computing[J].Journal of Xi’an University of Science and Technology,2014,34(1):71-74.
[20]林长方,吴扬扬,黄仲开,等.基于MapReduce的Apriori算法并行化[J].江南大学学报(自然科学版),2014,13(4):411-415.
Lin Changfang,Wu Yangyang,Huang Zhongkai,et al.Parallel research of Apriori algorithm based on MapReduce[J].Journal of Jiangnan University(Natural Science Edition),2014,13(4):411-415.

相似文献/References:

[1]叶海琴,孟彩霞,王意锋,等.一种基于MapReduce的频繁模式挖掘算法[J].南京理工大学学报(自然科学版),2018,42(01):62.[doi:10.14177/j.cnki.32-1397n.2018.42.01.009]
 Ye Haiqin,Meng Caixia,Wang Yifeng,et al.Frequent pattern mining algorithm based on MapReduce[J].Journal of Nanjing University of Science and Technology,2018,42(01):62.[doi:10.14177/j.cnki.32-1397n.2018.42.01.009]

备注/Memo

备注/Memo:
收稿日期:2015-09-07 修回日期:2015-10-30
基金项目:国家自然科学基金(U1504613); 河南省软科学研究项目(142400411220); 河南省科技厅基础前沿项目(142300410432); 河南省高等学校重点科研项目(15B520031)
作者简介:叶海琴(1980-),女,讲师,主要研究方向:个性化推荐、网络信息技术,E-mail:onlyyhq@126.com。
引文格式:叶海琴,廖利,王意锋,等.一种新的频繁模式挖掘算法[J].南京理工大学学报,2016,40(1):29-34.
投稿网址:http://zrxuebao.njust.edu.cn
DOI:10.14177/j.cnki.32-1397n.2016.40.01.005
更新日期/Last Update: 2016-02-29