基于双库协同机制的挖掘关联规则算法Maradbcm

关联规则是数据挖掘中一种重要的模式，Aprori算法是挖掘关联规则的典型算法，而Apriori算法存在一定的缺点：数据库的全局搜索和产生大项集时使用支持度阈值会删除有意义的规则等。Maradbcm算法是在KDD内在机理研究 的基础上提出的一种新的挖掘关联规则算法，它可以克服Apriori算法的上述缺点，在简要地叙述了双库协同机制和Maradbcm算法后，将该算法应用于蘑菇数据库，结果显示该算法是有效的，它充分显示了内在机理研究对KDD主流发展的重要作用与影响，并为整个知识发现系统的研究提供了一条全新的路径。

MARADBCM: THE MINING ASSOCIATION RULES ALGORITHM BASED ON DOUBLE-BASE COOPERATING MECHANISM

Association rule is one of the important modes in data mining, and Apriori algorithm is a typical algorithm of mining association rule. However, it has disadvantages: globally searching the database and deleting significative rules by minimum support threshold during creating large itemset. The Maradbcm algorithm is a new algorithm of mining association rule, which is proposed based on the KDD's inner mechanism, and it can overcome the Apriori algorithm's disadvantage. After briefly describing the double-base cooperating mechanism and Maradbcm algorithm, the algorithm applies to mushroom database, and the result indicates that the algorithm is effective. This fully shows the important influence of inner mechanism on the KDD mainstream development, and provides a new path for the research of the whole knowledge discovery system.