摘要
关联规则挖掘问题是数据挖掘领域一个重要的研究方向 ,φ 关联规则挖掘问题是它的一种推广形式。利用闭项目集的思想 ,提出了 φ 频繁闭项目挖掘问题。它是 φ 关联规则挖掘问题的一种替代 ,并给出了一种有效的挖掘算法 ,有效解决 φ
Association rule mining is an important research area in data mining, and φ association rule mining is one of its generalizations. Based on closed itemset, a problem of ((frequent closed itemset is studied, which is a substitute of the problem of φ association rule mining. Also, a mining algorithm is presented, which can efficiently solve the problem of generating too many rules in φ association rule mining.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2001年第3期225-228,共4页
Journal of Southwest Jiaotong University
基金
国家自然科学基金资助!(6 0 0 740 14)
