CSpace  > 中国科学院计算技术研究所期刊论文  > 英文
Efficient mining of association rules by reducing the number of passes over the database
Li, QZ; Wang, HY; Yan, ZM; Ma, SH
2001-03-01
发表期刊JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
ISSN1000-9000
卷号16期号:2页码:182-188
摘要This paper introduces a new algorithm of mining association rules. The algorithm RP counts the itemsets with different sizes in the same pass of scanning over the database by dividing the database into m partitions. The total number of passes over the database is only (k + 2m - 2)/m, where k is the longest size in the itemsets. It is much less than k.
关键词data mining association rule itemset large itemset
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Hardware & Architecture ; Computer Science, Software Engineering
WOS记录号WOS:000167726400009
出版者SCIENCE PRESS
引用统计
被引频次:2[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/13433
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Li, QZ
作者单位1.Chinese Acad Sci, Comp Technol Inst, Beijing 100080, Peoples R China
2.Shandong Univ, Dept Comp Sci, Jinan 250100, Peoples R China
推荐引用方式
GB/T 7714
Li, QZ,Wang, HY,Yan, ZM,et al. Efficient mining of association rules by reducing the number of passes over the database[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2001,16(2):182-188.
APA Li, QZ,Wang, HY,Yan, ZM,&Ma, SH.(2001).Efficient mining of association rules by reducing the number of passes over the database.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,16(2),182-188.
MLA Li, QZ,et al."Efficient mining of association rules by reducing the number of passes over the database".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 16.2(2001):182-188.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Li, QZ]的文章
[Wang, HY]的文章
[Yan, ZM]的文章
百度学术
百度学术中相似的文章
[Li, QZ]的文章
[Wang, HY]的文章
[Yan, ZM]的文章
必应学术
必应学术中相似的文章
[Li, QZ]的文章
[Wang, HY]的文章
[Yan, ZM]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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