CORC  > 湖南大学
An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees
Thi–Thiet Pham; Jiawei Luo; Bay Vo
刊名International Journal of Intelligent Information and Database Systems
2013
卷号Vol.7 No.4页码:324-339
关键词closed sequential patterns sequential generator patterns prefix trees data mining
ISSN号1751-5858
URL标识查看原文
公开日期[db:dc_date_available]
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/6497879
专题湖南大学
作者单位1.School of Information Science and Engineering, Hunan University, Changsha City, Hunan Province, 410082, China
2.Faculty of Information Technology, Industrial University of Ho Chi Minh City, 12 Nguyen Van Bao, GoVap, Ho Chi Minh City, Vietnam
3.Information Technology College, 12 Tran Dinh Thao, Tan Phu, Ho Chi Minh City, Vietnam
推荐引用方式
GB/T 7714
Thi–Thiet Pham,Jiawei Luo,Bay Vo. An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees[J]. International Journal of Intelligent Information and Database Systems,2013,Vol.7 No.4:324-339.
APA Thi–Thiet Pham,Jiawei Luo,&Bay Vo.(2013).An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees.International Journal of Intelligent Information and Database Systems,Vol.7 No.4,324-339.
MLA Thi–Thiet Pham,et al."An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees".International Journal of Intelligent Information and Database Systems Vol.7 No.4(2013):324-339.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace