Relative Unsupervised Discretization for Association Rule Mining
暂无分享,去创建一个
[1] Ron Kohavi,et al. Supervised and Unsupervised Discretization of Continuous Features , 1995, ICML.
[2] Gerhard Widmer,et al. Relative Unsupervised Discretization for Regresseion Problems , 2000, ECML.
[3] Kyuseok Shim,et al. Mining optimized support rules for numeric attributes , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).
[4] Theo Pavlidis,et al. Algorithms for Graphics and Imag , 1983 .
[5] Ivan Bratko,et al. Machine Learning and Data Mining; Methods and Applications , 1998 .
[6] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[7] Yehuda Lindell,et al. A Statistical Theory for Quantitative Association Rules , 1999, KDD.
[8] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[9] Ke Wang,et al. Interestingness-Based Interval Merger for Numeric Association Rules , 1998, KDD.
[10] Tomasz Imielinski,et al. Database Mining: A Performance Perspective , 1993, IEEE Trans. Knowl. Data Eng..
[11] Ramakrishnan Srikant,et al. Mining quantitative association rules in large relational tables , 1996, SIGMOD '96.
[12] T. Pavlidis. Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.