作者: RS Thakur , RC Jain , KR Pardasani
关键词: K-optimal pattern discovery 、 Computer science 、 Table (database) 、 Data mining 、 Database transaction 、 Hierarchy 、 Level crossing 、 Association (object-oriented programming) 、 Extension (predicate logic) 、 Association rule learning 、 Database
摘要: Existing algorithms for mining association rule at multiple concept level, restricted strong among the same level of a hierarchy. However level-crossing may lead to discovery different In this study, top-down progressive deepening method is developed rules in large transaction databases by extension some existing multiple-level techniques. This using reduced support and refine table each level.