基于“新颖度”的关联挖掘算法  

An Association Rule mining Algorithm based on "novelty"

作　　者：陈刚 李秀[1] 刘文煌[1] 

机构地区：[1]清华大学自动化系国家CIMS工程技术研究中心,100084

出　　处：《微计算机信息》2006年第08X期1-3,共3页Control & Automation

基　　金：国家自然科学基金(70202008)

摘　　要：关联挖掘的目的是从大量数据中发现对用户有用、新颖、重要的关联规则。传统的关联挖掘算法会产生大量对用户而言显而易见的平凡规则,使那些真正对用户有用的新颖规则被淹没,而一些针对新颖性的改进算法往往又存在先验知识表达复杂且工作量极大的问题。在本文中,我们运用简单的分类树,引入“新颖度”的概念,对Apriori算法进行改进,得到了基于“新颖度”的关联挖掘算法,此算法既充分考虑了挖掘过程中得新颖性问题,又克服了先验知识表达过于复杂的困难。The objective of mining association rules is to find useful, novel and important association rules from large database. Traditional association rule mining algorithm may often produce too many obvious and non-novel rules to user, making really novel and interesting rules submerged. Some former way to solve novel problem need a lot of extra work to preprocess the data. In this paper, we introduce the concept of ＂novelty＂ and improve the algorithm into a new association algorithm based on ＂novelty＂ to overcome the above problems.

关 键 词：关联规则挖掘 APRIORI算法 新颖度 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]