A Search Space Reduced Algorithm for Mining Frequent Patterns

淡江大學機構典藏 > 商管學院 > 企業管理學系暨研究所 > 期刊論文 > Item 987654321/92459

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/92459

题名:	A Search Space Reduced Algorithm for Mining Frequent Patterns
作者:	Yen, Show-Jane;Wang, Chiu-Kuang;Ouyang, Liang-Yuh
贡献者:	淡江大學企業管理學系;淡江大學管理科學學系
关键词:	data mining;frequent pattern;frequent itemset;FP-tree;transaction database
日期:	2012-01
上传时间:	2013-10-14 16:21:06 (UTC+8)
出版者:	臺北市：中央研究院資訊科學研究所
摘要:	Mining frequent patterns is to discover the groups of items appearing always together excess of a user specified threshold. Many approaches have been proposed for mining frequent patterns by applying the FP-tree structure to improve the efficiency of the FP-Growth algorithm which needs to recursively construct sub-trees. Although these approaches do not need to recursively construct many sub-trees, they also suffer the problem of a large search space, such that the performances for the previous approaches degrade when the database is massive or the threshold for mining frequent patterns is low. In order to reduce the search space and speed up the mining process, we propose an efficient algorithm for mining frequent patterns based on frequent pattern tree. Our algorithm generates a subtree for each frequent item and then generates candidates in batch from this sub-tree. For each candidate generation, our algorithm only generates a small set of candidates, which can significantly reduce the search space. The experimental results also show that our algorithm outperforms the previous approaches.
關聯:	Journal of Information Science and Engineering 28(1), pp.177-191
显示于类别:	[管理科學學系暨研究所] 期刊論文 [企業管理學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
201201_12.pdf	期刊論文	670Kb	Adobe PDF	627	检视/开启
index.html		0Kb	HTML	117	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....