[1]宋朋涛,李超,徐莉婷,等.基于个人计算机的智能家居边缘计算系统[J].计算机工程,2017,43(11):1-7.
[2]ZHANG Le,SUGANTHAN P N.Random forests with ensemble of feature spaces[J].Pattern Recognition,2014,47(10):3429-3437.
[3]GOPIKA D,AZHAGUSUNDARI B.A novel approach on ensemble classifiers with fast rotation forest algorithm[J].International Journal of Innovative Research in Computer and Communication Engineering,2014,2(8):25-30.
[4]周文谊,王吉源.一种模糊森林学习方法及其行人检测应用[J].计算机工程,2017,43(3):304-308,315.
[5]BREIMAN L.Bagging predictors[J].Machine Learning,1996,24(2):123-140.
[6]HAN Jiawei.Data mining:concepts and techniques[M].San Francisco,USA:Morgan Kaufmann Publishers Inc.,2005.
[7]LOH W Y.Classification and regression trees[J].Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2011,1(1):14-23.
[8]FREUND Y,SCHAPIRE R E.Experiments with a new boosting algorithm[EB/OL].[2017-12-15].https://cseweb.ucsd.edu/~yfreund/papers/boostingexperiments.pdf.
[9]HO T K.The random subspace method for constructing decision forests[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1998,20(8):832-844.
[10]BREIMAN L.Random forests[J].Machine Learning,2001,45(1):5-32.
[11]FAWAGREH K,GABER M M,ELYAN E.Random forests:from early developments to recent advancements[J].Systems Science and Control Engineering,2014,2(1):602-609.
[12]BERNARD S,ADAM S,HEUTTE L.Dynamic random forests[J].Pattern Recognition Letters,2012,33(12):1580-1586.
[13]MARTNEZ-MUOZ G,SUREZ A.Out-of-bag estima-tion of the optimal sample size in Bagging[J].Pattern Recognition,2010,43(1):143-152.
[14]QUINLAN J R.C4.5:programs for machine learning[M].San Francisco,USA:Morgan Kaufmann Publishers Inc.,1992.
[15]MARGINEANTU D D,DIETTERICH T G.Pruning adaptive boosting[C]//Proceedings of the 14th Interna-tional Conference on Machine Learning.San Francisco,USA:Morgan Kaufmann Publishers Inc.,1997:211-218. |