Abstract: At present, lots of algorithms are Apriori and its transformative. These traditional algorithms often suffer from the bottleneck of items generation and confirm difficultly a suitable minimum support.In this paper, a new algorithm called base-weight is proposed to solve the above problems.

摘要： 目前,已经提出了许多挖掘关联规则的算法,其中最著名的是Apriori算法及其变型。这些传统的算法大多存在项集生成瓶颈和难以确定合适的支持度阈值的问题,并且没有考虑数据库的被分析项的各自不同的重要性。为了解决这些问题,该文提出了一种新的关联挖掘算法。

关键词: 数据挖掘, 关联规则, 权值

CLC Number: 

• TP311.13