Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

A New Incremental Learning Algorithm with Probabilistic Weights Using Extended Data Expression

  • Received : 2013.03.19
  • Accepted : 2013.07.12
  • Published : 2013.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

New incremental learning algorithm using extended data expression, based on probabilistic compounding, is presented in this paper. Incremental learning algorithm generates an ensemble of weak classifiers and compounds these classifiers to a strong classifier, using a weighted majority voting, to improve classification performance. We introduce new probabilistic weighted majority voting founded on extended data expression. In this case class distribution of the output is used to compound classifiers. UChoo, a decision tree classifier for extended data expression, is used as a base classifier, as it allows obtaining extended output expression that defines class distribution of the output. Extended data expression and UChoo classifier are powerful techniques in classification and rule refinement problem. In this paper extended data expression is applied to obtain probabilistic results with probabilistic majority voting. To show performance advantages, new algorithm is compared with Learn++, an incremental ensemble-based algorithm.

Keywords

References

  1. R. P. W. Duin, "The combining classifier: to train or not to train?," in Proceedings of the 16th International Conference on Pattern Recognition, Quebec, Canada, pp. 765-770, 2002.
  2. J. M. Kong, D. H. Seo, and W. D. Lee, "Rule refinement with extended data expression," in Proceedings of the 6th International Conference on Machine Learning and Applications, Cincinnati: OH, pp. 310-315, 2007.
  3. D. H. Kim, D. H. Lee, and W. D. Lee, "Classifier using extended data expression," in Proceedings of the IEEE Mountain Workshop on Adaptive and Learning Systems, Logan: UT, pp. 154-159, 2006.
  4. R. Polikar, "Bootstrap-inspired techniques in computational intelligence," IEEE Signal Processing Magazine, vol. 24, no. 4, pp. 59-72, 2007. https://doi.org/10.1109/MSP.2007.4286565
  5. R. Polikar, L. Udpa, S. S. Udpa, and V. Honavar, "Learn++: an incremental learning algorithm for multilayer perceptron networks," in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Istanbul, Turkey, pp. 3414-3417, 2000.
  6. R. Polikar, L. Udpa, S. S. Udpa, and V. Honavar, "Learn++: an incremental learning algorithm for supervised neural networks," IEEE Transactions on Systems, Man, and Cybernetics Part C: Applications and Reviews, vol. 31, no. 4, pp. 497-508, 2001.
  7. J. R. Quinlan, "Bagging, boosting, and C4.5," in Proceedings of the 13th National Conference on Artificial Intelligence, Portland: OR, pp. 725-730, 1996.
  8. R. E. Schapire, "The boosting approach to machine learning: an overview," in MSRI Workshop on Nonlinear Estimation and Classification, Berkeley: CA, 2002.
  9. Y. L. Murphey, Z. Chen, and L. Feldkamp, "Incremental neural learning using AdaBoost," in Proceedings of the International Joint Conference on Neural Networks, Honolulu: HI, pp. 2304- 2308, 2002.
  10. UCI machine learning repository [Internet]. Available: http://archive.ics.uci.edu/ml/.

Cited by

  1. Application Examples Applying Extended Data Expression Technique to Classification Problems vol.9, pp.12, 2013, https://doi.org/10.15207/jkcs.2018.9.12.009