南京理工大学学报（自然科学版）2016，Vol.40Issue(1)：29-34,6.DOI:10.14177/j.cnki.32-1397n.2016.40.01.005
一种新的频繁模式挖掘算法
New frequent patterns mining algorithm
摘要
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.关键词
频繁模式/挖掘算法/比特串/支持度/典型集/事务集Key words
frequent patterns/mining algorithms/bit strings/support/typical sets/transaction sets分类
信息技术与安全科学引用本文复制引用
叶海琴,廖利,王意锋,张爱玲..一种新的频繁模式挖掘算法[J].南京理工大学学报（自然科学版）,2016,40(1):29-34,6.基金项目
国家自然科学基金(U1504613) （U1504613）
河南省软科学研究项目(142400411220) （142400411220）
河南省科技厅基础前沿项目(142300410432) （142300410432）
河南省高等学校重点科研项目(15B520031) （15B520031）
