Mining Binary Diagram Rules
暂无分享,去创建一个
Mining association rules was introduced as a novel framework of Data Mining by Agrawal et al. [1] and some e cient heuristic algorithms for mining all association rules have been devised [2]. Based on such research, some systems for mining association rules have been already in commerce and have succeeded in discovering a rule like \if a customer buys a swimsuit and a pair of ippers then the customer buys goggles too in 90% of the cases" from huge databases. This method is obviously applicable to genomic data and a successful result has been reported for nding simple association rules from signals found in mammalian promoter sequences [4]. In order to increase the diversity and expressibility of rules, we introduce a rule in a more general form, Binary Diagram Rule (BDR, shortly), so that a rule like \at teatime, if a person
[1] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[2] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[3] T. Takagi,et al. Mining Association Rules from Signals found in Mammalian Promoter Sequences , 1995 .
[4] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.