中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A fast algorithm for mining sequential patterns from large databases

文献类型:期刊论文

作者Chen, N; Chen, A; Zhou, LX; Liu, L
刊名JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
出版日期2001
卷号16期号:4页码:12,359-370
关键词Data Mining Knowledge Discovery Sequential Pattern Set Operation
ISSN号1000-9000
英文摘要Mining sequential patterns from large databases has been recognized by many researchers as an attractive task of data mining and knowledge discovery. Previous algorithms scan the databases for many times, which is often unendurable due to the very large amount of databases. In this paper, the authors introduce an effective algorithm for mining sequential patterns from large databases. In the algorithm, the original database is not used at all for counting the support of sequences after the first pass. Rather, a tidlist; structure generated in the previous pass is employed for the purpose based on set intersection operations, avoiding the multiple scans of the databases.
学科主题Computer Science ; Software Engineering ; Hardware & Architecture ; Computer Science
语种英语
WOS记录号WOS:000170049900006
公开日期2012-11-12
源URL[http://ir.casipm.ac.cn/handle/190111/5351]  
专题科技战略咨询研究院_中国科学院科技政策与管理科学研究所(1985年6月-2015年12月)
推荐引用方式
GB/T 7714
Chen, N,Chen, A,Zhou, LX,et al. A fast algorithm for mining sequential patterns from large databases[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2001,16(4):12,359-370.
APA Chen, N,Chen, A,Zhou, LX,&Liu, L.(2001).A fast algorithm for mining sequential patterns from large databases.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,16(4),12,359-370.
MLA Chen, N,et al."A fast algorithm for mining sequential patterns from large databases".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 16.4(2001):12,359-370.

入库方式: OAI收割

来源:科技战略咨询研究院

浏览0
下载0
收藏0
其他版本

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