Instance based random forest with rotated feature space

Proceedings of the 2013 IEEE Symposium on Computational Intelligence and Ensemble Learning, CIEL 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013

Volumn , Issue , 2013, Pages 31-35

  Zhang, Le ^a   Ren, Ye ^a   Suganthan, P N ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ENSEMBLE METHODS; FEATURE SPACE; INSTANCE-BASED METHODS; RANDOM FORESTS; UCI REPOSITORY;

DECISION TREES;

ARTIFICIAL INTELLIGENCE;

EID: 84886785068     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIEL.2013.6613137     Document Type: Conference Paper

References (34)

1. L. Breiman, "Bagging predictors," Machine learning Journal, vol. 26(2), p. 123-140,1996.
2. Y. Freund and R. E. Shapire, "Experiments with a new boosting algorithm," Machine Learning: Proceedings of the Thirteenth International Conference (ICML'96). Morgan Kaufmann, 1996.
3. L Rokach, "Ensemble based classifiers," Artificial Intelligence Review, 2010-Springer.
4. J. Friedman, T. Hastie, and R. Tibshirani, "Additive LogisticRegression: A Statistical View of Boosting," Annals of Statistics,vol. 28, no. 2, pp. 337-374, 2000.
5. R. E. Schapire, "Theoretical Views of Boosting," Proc. FourthEuropean Conf. Computational Learning Theory, pp. 1-10, 1999.
6. R. E. Schapire, "The Boosting Approach to Machine Learning: AnOverview," Proc. MSRI Workshop Nonlinear Estimation and Classification, 2002.
7. Y. Freund and R. E. Schapire, "A Decision-Theoretic Generalizationof On-Line Learning and an Application to Boosting," J. Computer and System Sciences, vol. 55, no. 1, pp. 119-139, 1997.
8. R. E. Schapire, Y. Freund, P. Bartlett, and W. S. Lee, "Boosting theMargin: A New Explanation for the Effectiveness of VotingMethods," Annals of Statistics, vol. 26, no. 5, pp. 1651-1686, 1998.
9. E. L. Allwein, R. E. Schapire, and Y. Singer, "Reducing Multiclassto Binary: A Unifying Approach for Margin Classifiers," J. Machine Learning Research, vol. 1, pp. 113-141, 2000.
10. L. Breiman, "Arcing Classifiers," Annals of Statistics, vol. 26, no. 3,pp. 801-849, 1998.
11. L. Mason, P. L. Bartlet, and J. Baxter, "Improved Generalizationthrough Explicit Optimization of Margins," Machine Learning,vol. 38, no. 3, pp. 243-255, 2000.
12. P. Melville, N. Shah, L. Mihalkova, and R. J. Mooney, "Experimentswith Ensembles with Missing and Noisy Data," Proc Fifth Int. Workshop Multiple Classifier Systems, pp. 293-302, 2004.
13. R. E. Banfield, L. O. Hall, K. W. Bowyer et al, "A Comparison of EnsembleCreation Techniques," Proc Fifth Int. Workshop Multiple ClassifierSystems (MCS '04), 2004.
14. E. Bauer and R. Kohavi, "An Empirical Comparison of VotingClassification Algorithms: Bagging, Boosting, and Variants," Machine Learning, vol. 36, nos. 1-2, pp. 105-139, 1999.
15. T. G. Dietterich, "Ensemble Methods in Machine Learning," Proc. Conf. Multiple Classifier Systems, pp. 1-15, 2000.
16. T. K. Ho, "A Data Complexity Analysis of Comparative Advantagesof Decision Forest Constructors," Pattern Analysis andApplications, vol. 5, pp. 102-112, 2002.
17. L. Breiman, "Random forests,"Machine Learning Journal, vol. 45,no. 1,pp. 5-32, 2001.
18. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. "Classification and regression trees," Wadsworth Inc., Belmont, California, 1984.
19. M. R. Šikonja,"Improving Random Forests," Machine Learning: ECML 2004.
20. K. K. Kandaswamya, K. Chouet al., "AFP-Pred: A randomforest approach for predicting antifreeze proteins from sequence-derived properties," Journal of Theoretical Biology. vol. 270,pp. 56-62, 2011.
21. H. C. Nguyen, W Yong, Improving Classification Accuracy in Random Forest byUsing Feature Impurity and Bayesian Probability [PDF], Available :world-comp. org.
22. C. Chen, A. Liaw, L. Breiman, Using Random Forest to Learn Imbalanced Data [PDF], Available: www. stat. berkeley. edu/techreports/ 666. pdf.
23. J. Han and M. Kamber, Data Mining: concepts and Techniques, Morgan Kaufmann, 2001.
24. F. H. Foley and J. W. Sammon, "An Optimal Set of Discriminant Vectors," IEEE Trans. Computers, vol. 24, no. 3, pp. 281-289, Mar. 1975
25. K. Fukunaga and W. L. G. Koontz, "Application of the Karhunen-Loeve Expansion to Feature Selection and Ordering," IEEE Trans. Computers, vol. 19, no. 4, pp. 311-318, Apr. 1970.
26. J. Kittler and P. C. Young, "A New Approach to Feature Selection Based on the Karhunen-Loeve Expansion," Pattern Recognition,vol. 5, no. 4, pp. 335-352, Dec. 1973.
27. F. V. D. Heijden, R. P. W. Duin, D. de Ridder, and D. M. J. Tax, Classification, Parameter Estimation and State Estimation, Wiley, 2004.
28. A. Webb, Statistical Pattern Recognition. London: Arnold, 1999.
29. X. Z. Fern and C. E. Brodley, "Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach," Proc. 20th Int. Conf. Machine Learning (ICML), pp. 186-193, 2003.
30. Abhirana,Random Forest implement for Matlab[online]. available:http:// code. google. com/p/randomforest-matlab.
31. C. L. Blake and C. J. Merz, "UCI Repository of MachineLearning Databases," Dep. Inf. Comput. Sci.,Univ. Calfornia,Irvine,CA,1998. [ online]. Available: http://archive. ics. uci. edu/ml/datasets. html.
32. S. Kolenikovand G. Angeles, "The Use of Discrete data in PCA: Theory,Simulations,and Applications to Socioeconomic Indices," Proc. 2004 Joint Statistical Meeting, 2004.
33. X. D. Jiang, "Linear Subspace Learning-Based Dimensionality Reduction," IEEE Signal Processing Mag., vol. 28, no. 2, pp. 16-26, 2011.
34. Comon, P. Independent component analysis, a new concept. Signal Processing, 36(3), 287-314,1994.