CORC  > 湖南大学
An efficient algorithm for mining sequential rules with interestingness measures
Thi-Thiet Pham; Jiawei Luo; Tzung-Pei Hong; Bay Vo
刊名International Journal of Innovative Computing, Information & Control
2013
卷号Vol.9 No.12页码:4811-4824
ISSN号1349-4198
URL标识查看原文
公开日期[db:dc_date_available]
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/6499225
专题湖南大学
推荐引用方式
GB/T 7714
Thi-Thiet Pham,Jiawei Luo,Tzung-Pei Hong,et al. An efficient algorithm for mining sequential rules with interestingness measures[J]. International Journal of Innovative Computing, Information & Control,2013,Vol.9 No.12:4811-4824.
APA Thi-Thiet Pham,Jiawei Luo,Tzung-Pei Hong,&Bay Vo.(2013).An efficient algorithm for mining sequential rules with interestingness measures.International Journal of Innovative Computing, Information & Control,Vol.9 No.12,4811-4824.
MLA Thi-Thiet Pham,et al."An efficient algorithm for mining sequential rules with interestingness measures".International Journal of Innovative Computing, Information & Control Vol.9 No.12(2013):4811-4824.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


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