摘要
近来为了满足处理不确定数据库的需求,人们提出了不确定模式挖掘的概念,并设计了各种相关的算法,但是这些算法花费大量的处理时间,而且挖掘精度不佳.提出了基于极小数据结构不确定频繁模式挖掘算法,实验结果显示该算法能够节省大量的处理时间,提高挖掘精度.
To meet the needs of dealing with uncertain databases, people propose the concept of uncertain pattern mining and design various related methods, but the up-to-date algorithms cost a lot of time with poor mining accuracy. An algorithm for mining uncertain frequent patterns based on minimal data structure is proposed. Experimental results show that the algorithm can save a lot of processing time and improve the mining accuracy.
作者
李峰
LI Feng(College of Computer and Communication, Hunan Institute of Engineering, Xiangtan 411104, China)
出处
《湖南工程学院学报(自然科学版)》
2019年第2期36-39,共4页
Journal of Hunan Institute of Engineering(Natural Science Edition)
基金
湖南工程学院青年重点项目(XJ1504)
湖南省教育厅一般项目(17C0397)
关键词
极小数据结构
不确定频繁模式
挖掘算法
minimal data structure
uncertain frequent patterns
mining algorithm