摘要
找出众多关联规则中用户感兴趣的关联规则 ,除靠最小支持度和最小可信度外 ,把相似性计算融合到通过剪枝选出用户感兴趣规则的模板理论中 .提出一种基于相似性的关联规则启发式发现方法 .
To find the association rules of concern to clients among numerous discovered association rules, it is not enough to rely simply on the minimal support and minimal confidence. The similarity into the template method is introduced, which finds the rules of concern by pruning. A heuristic way of finding association rules is presented, based on similarity. This method well tackles these unreasonable pruning problems that owe themselves to illegibility in descriptions in the template method.
出处
《北京理工大学学报》
EI
CAS
CSCD
北大核心
2002年第1期98-100,120,共4页
Transactions of Beijing Institute of Technology
