φ-频繁闭项目挖掘问题及其算法

The Problem ofφ-Frequency Closed Itemset Mining and Its Algorithm

摘要: 关联规则挖掘问题是数据挖掘领域一个重要的研究方向,φ-关联规则挖掘问题是它的一种推广形式。利用闭项目集的思想,提出了φ-频繁闭项目挖掘问题。它是φ-关联规则挖掘问题的一种替代,并给出了一种有效的挖掘算法,有效解决φ-关联规则挖掘问题中产生大量规则的问题。
- 数据库 /
- 数据处理 /
- φ-频繁闭项目集 /
- 关联规则 /
- 数据挖掘
Abstract: 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 efficientlysolve the problemofgeneratingtoomanyrules inφ-association rule mining.
- databases /
- data processing /
- φ-frequent closed itemset /
- association rule /
- data mining

点击查看大图