检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]信息工程大学,河南郑州450001
出 处:《计算机应用与软件》2018年第1期269-275,共7页Computer Applications and Software
基 金:国家重点研发计划项目(2016YFB0501900)
摘 要:针对现有用户行为序列模式挖掘方法的单一支持度局限性问题,提出一种基于前缀树结构的多支持度序列模式挖掘方法。设计一种多支持度条件下的前缀树结构MSLP-tree,并基于此结构提出一种序列模式增长算法MSLP-growth。通过考虑各数据项不同最小支持度,获取更精确的频繁序列模式,在确保挖掘结果的准确性和完整性的前提下,大大压缩搜索空间,缩短挖掘时间。实验结果表明,相较于MS-GSP算法,MSLP-growth算法具有更高的挖掘效率和可扩展性。Aiming at the limitation of the single support threshold of most current sequential pattern mining methods, a sequential pattern mining method with multiple minimum supports based on prefix tree structure was proposed. We designed a prefix tree structure MSLP-tree with multiple supports and proposed a sequential pattern growth algorithm based on this structure, which was called MSLP-growth. The algorithm obtained the precise frequent sequential patterns by considering the varied minimum support of each item. In the premise of ensuring the accuracy and integrity of the mining results, the storage space was greatly reduced and the search time was shortened. Experimental results showed that compared with MS-GSP algorithm, MSLP-growth algorithm had higher mining efficiency and scalability.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.97