MAMBO: Discovering Association Rules Based on Conditional Independencies
暂无分享,去创建一个
[1] Kai Lai Chung,et al. Markov Chains with Stationary Transition Probabilities , 1961 .
[2] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[3] J. York,et al. Bayesian Graphical Models for Discrete Data , 1995 .
[4] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[5] Edith Cohen,et al. Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[6] J. N. R. Jeffers,et al. Graphical Models in Applied Multivariate Statistics. , 1990 .
[7] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[8] A. Dawid,et al. Hyper Markov Laws in the Statistical Analysis of Decomposable Graphical Models , 1993 .
[9] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[10] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .
[11] U. M. Feyyad. Data mining and knowledge discovery: making sense out of data , 1996 .
[12] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.