Abstract: It is a problem to mine quantitative association rules because the algorithms always generate too many association rules, owing to data segmentation used as one step in the overall process. The algorithm in this paper is based on the geometric properties of a two-dimensional grid. It reduces the large number of association rules by clustering the association rules generated, tendering the clustered rules much easier to interpret and visualize.

摘要： 由于数据分段在算法中的使用,对数量关联规则的挖掘经常存在着返回大量关联规则的问题。文章提出一种基于二维网格几何性质的聚类算法,对挖掘出的关联规则进行分类,减少最终得到的关联规则的数量,使结果更易于理解、更形象。

关键词: 数据挖掘, 数量关联规则, 聚类

CLC Number: 

• TP301.6