An effective algorithm for mining positive and negative association rules

doi:10.1109/CSSE.2008.1199

IR > 计算机与通信学院

	An effective algorithm for mining positive and negative association rules
	Honglei, Zhu; Zhigang, Xu
	2008
会议名称	International Conference on Computer Science and Software Engineering, CSSE 2008
会议录名称	Proceedings - International Conference on Computer Science and Software Engineering, CSSE 2008
卷号	4
页码	455-458
会议日期	December 12, 2008 - December 14, 2008
会议地点	Wuhan, Hubei, China
出版者	IEEE Computer Society
摘要	Recently, mining negative association rules has received some attention and been proved to be useful in real world. This paper presents an efficient algorithm (PNAR) for mining both positive and negative association rules in databases. The algorithm extends traditional association rules to include negative association rules. When mining negative association rules, we adopt another minimum support threshold to mine frequent negative itemsets. With a correlation coefficient measure and pruning strategies, the algorithm can find all valid association rules quickly and overcome some limitations of the previous mining methods. The experimental results demonstrate its effectiveness and efficiency. © 2008 IEEE.
关键词	Data mining Software engineering Correlation coefficient Effective algorithms Effectiveness and efficiencies Frequent itemset Minimum support thresholds Mining methods Negative association rules Pruning strategy
DOI	10.1109/CSSE.2008.1199
收录类别	EI
语种	英语
EI入藏号	20110713665450
EI主题词	Association rules
来源库	Compendex
分类代码	723.1 Computer Programming - 723.2 Data Processing and Image Processing - 903.1 Information Sources and Analysis
引用统计	无
文献类型	会议论文
条目标识符	https://ir.lut.edu.cn/handle/2XXMBERH/116849
专题	计算机与通信学院
作者单位	School of Computer and Communication, Lanzhou University of Technology, LUT, GS, China
第一作者单位	兰州理工大学
推荐引用方式 GB/T 7714	Honglei, Zhu,Zhigang, Xu. An effective algorithm for mining positive and negative association rules[C]:IEEE Computer Society,2008:455-458.