| 注册
首页|期刊导航|计算机应用研究|一种快速挖掘top-k高效用模式的算法

一种快速挖掘top-k高效用模式的算法

吴倩 王林平 罗相洲 崔建群 王海

计算机应用研究2017,Vol.34Issue(11):3303-3307,5.
计算机应用研究2017,Vol.34Issue(11):3303-3307,5.DOI:10.3969/j.issn.1001-3695.2017.11.023

一种快速挖掘top-k高效用模式的算法

Algorithm for fast discovery of top-k high utility patterns

吴倩 1王林平 1罗相洲 1崔建群 1王海2

作者信息

  • 1. 华中师范大学计算机学院,武汉430079
  • 2. 华中师范大学科技处,武汉430079
  • 折叠

摘要

Abstract

High utility pattern mining is a fundamental research in data mining,in which more and more algorithms about top-k high utility pattern mining algorithms are proposed,where k refers to the number of high utility patterns that users need to mine.It can be classified into two types:two-phase algorithm and single-phase algorithm.The former generated a huge number of candidates in mining process,which was the primary factor to decreasing the performance of algorithm;the latter mined top-k high utility patterns without candidate generation.To mine the k of the most valuable patterns more efficiently,this paper proposed a single-phase algorithm TKHUP.The proposed algorithm used four effective strategies to save time and space consumption during mining process.A large number of experiments indicates that the performance of TKHUP is the state-of-the-art topk high utility mining algorithm on time.

关键词

高效用模式/top-k模式挖掘/效用挖掘/数据挖掘

Key words

high utility pattern/top-k pattern mining/utility mining/data mining

分类

信息技术与安全科学

引用本文复制引用

吴倩,王林平,罗相洲,崔建群,王海..一种快速挖掘top-k高效用模式的算法[J].计算机应用研究,2017,34(11):3303-3307,5.

基金项目

国家自然科学基金资助项目(61370108) (61370108)

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量0
|
下载量0
段落导航相关论文