Mining Actionable Knowledge Using Reordering Based Diversified Actionable Decision Trees
暂无分享,去创建一个
Yanchun Zhang | Hua Wang | Jiangang Ma | Rui Zhou | Sathiyabhama Balasubramaniam | Yueai Zhao | Frank Whittaker | Sarathkumar Rangarajan | Sudha Subramani | Yanchun Zhang | F. Whittaker | Jiangang Ma | Rui Zhou | Sudha Subramani | Hua Wang | Sathiyabhama Balasubramaniam | Yueai Zhao | Sarathkumar Rangarajan
[1] Vasantha Kalyani David,et al. Optimized feature extraction and actionable knowledge discovery for Customer Relationship Management (CRM) , 2012, CCSEIT '12.
[2] Cao Longbing. Introduction to Domain Driven Data Mining , 2009 .
[3] Leo Breiman,et al. Bagging Predictors , 1996, Machine Learning.
[4] Huiqing Liu,et al. Ensembles of cascading trees , 2003, Third IEEE International Conference on Data Mining.
[5] Yixin Chen,et al. Optimal Action Extraction for Random Forests and Boosted Trees , 2015, KDD.
[6] Charles X. Ling,et al. Using AUC and accuracy in evaluating learning algorithms , 2005, IEEE Transactions on Knowledge and Data Engineering.
[7] Jiawei Han,et al. Data Mining: Concepts and Techniques , 2000 .
[8] Naoki Abe,et al. Sequential cost-sensitive decision making with reinforcement learning , 2002, KDD.
[9] Pedro M. Domingos. MetaCost: a general method for making classifiers cost-sensitive , 1999, KDD '99.
[10] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.
[11] B.N. Lakshmi,et al. A conceptual overview of data mining , 2011, 2011 National Conference on Innovations in Emerging Technology.