The comparison between classification trees through proximity measures
暂无分享,去创建一个
[1] R. Tibshirani,et al. Model Search by Bootstrap “Bumping” , 1999 .
[2] E. Ziegel,et al. Artificial intelligence and statistics , 1986 .
[3] Yoav Freund,et al. A Short Introduction to Boosting , 1999 .
[4] Leo Breiman,et al. Bagging Predictors , 1996, Machine Learning.
[5] Robert Tibshirani,et al. Model Search and Inference By Bootstrap "bumping , 1995 .
[6] Adrian F. M. Smith,et al. A Bayesian CART algorithm , 1998 .
[7] A comment on McCallum , 1983 .
[8] David L. Wallace,et al. A Method for Comparing Two Hierarchical Clusterings: Comment , 1983 .
[9] W. Shannon,et al. Combining classification trees using MLE. , 1999, Statistics in medicine.
[10] H. Chipman,et al. Bayesian CART Model Search , 1998 .
[11] A. Ciampi,et al. Recursive Partition in Biostatistics: Stability of Trees and Choice of the Most Stable Classification , 1988 .
[12] Ian T. Jolliffe,et al. A Method for Comparing Two Hierarchical Clusterings: Comment , 1983 .
[13] Leo Breiman,et al. Classification and Regression Trees , 1984 .
[14] Edward I. George,et al. Managing Multiple Models , 2001, AISTATS.
[15] Jacob Cohen. A Coefficient of Agreement for Nominal Scales , 1960 .
[16] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.