Based on rough set of associative rules improve algorithm of data mining
According to information system theory and from the equivalent and support the concept of view, it is easy to find the frequency of collection and confirm the relevant rules of coarse. Under in-depth and systematic research on RS theory and associate rules mining algorithms, This paper make some improvement based on original algorithms. The first and the foremost, this paper proposes an efficient algorithm for counting core and a reduction algorithm of attributes based on discernibility matrix which can handle the knowledge system and make the extraction of decision-rules convinent. Secondly, it put forward a mining model of association rules with decision attributes based on Apriori,AprioriTid and AprioriHybrid algorithms,which also optimize them.
data miningt rough set t asscoiate rule
Zhangkun shaoliangshan
Business College Liaoning technical university Huludao, China
国际会议
太原
英文
236-239
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）