Life-long learning based on dynamic combination model

Applied Soft Computing Journal

Volumn 56, Issue , 2017, Pages 398-404

  Ren, Boya ^a   Wang, Hongzhi ^a   Li, Jianzhong ^a   Gao, Hong ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Data streams; Decision trees; Dynamic combination model; Life long learning; Machine learning

Indexed keywords

DATA MINING; DECISION TREES; LEARNING SYSTEMS;

COMBINATION METHOD; DATA DISTRIBUTION; DATA STREAM; DYNAMIC COMBINATION; INCREMENTAL LEARNING; LIFE LONG LEARNING; PRACTICAL SYSTEMS; STREAM DATA MINING;

TREES (MATHEMATICS);

EID: 85017151114     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2017.03.005     Document Type: Article

References (37)

1. [1] Bishop, C.M., Pattern Recognition and Machine Learning. 2006, Springer.
2. [2] Joshi, P., Kulkarni, P., Incremental learning: areas and methods-a survey. Int. J. Data Mining Knowl. Manag. Process 2:5 (2012), 43–51.
3. [3] Pan, S.J., Yang, Q., A survey on transfer learning. IEEE Trans. Knowl. Data Eng. 22:10 (2010), 1345–1359.
4. [4] Hulten, G., Spencer, L., Domingos, P., Mining time-changing data streams. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, 2001, 97–106.
5. [5] Polikar, R., Upda, L., Upda, S.S., Honavar, V., Learn++: an incremental learning algorithm for supervised neural networks. IEEE Trans. Syst. Man Cybern. C: Appl. Rev. 31:4 (2001), 497–508.
6. [6] Polikar, R., Byorick, J., Krause, S., Marino, A., Moreton, M., Learn++: a classifier independent incremental learning algorithm for supervised neural networks. Proceedings of the 2002 International Joint Conference on Neural Networks, IJCNN’02, Vol. 2, IEEE, 2002, 1742–1747.
7. [7] Dai, W., Yang, Q., Xue, G.-R., Yu, Y., Boosting for transfer learning. Proceedings of the 24th international conference on Machine learning, ACM, 2007, 193–200.
8. [8] Wang, H., Fan, W., Yu, P.S., Han, J., Mining concept-drifting data streams using ensemble classifiers. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, 2003, 226–235.
9. [9] Pietruczuk, L., Rutkowski, L., Jaworski, M., Duda, P., A method for automatic adjustment of ensemble size in stream data mining. International Joint Conference on Neural Networks (IJCNN), IEEE, 2016, 9–15.
10. [10] Vezhnevets, A., Vezhnevets, V., Modest adaboost-teaching adaboost to generalize better. Graphicon, Vol. 12 (5), 2005, 987–997.
11. [11] Silver, D.L., Yang, Q., Li, L., Lifelong machine learning systems: beyond learning algorithms. AAAI Spring Symposium: Lifelong Machine Learning, Vol. 13, Citeseer, 2013, 05.
12. [12] Thrun, S., Lifelong learning algorithms. Learning to Learn, 1998, Springer, 181–209.
13. [13] Thrun, S., Mitchell, T.M., Lifelong Robot Learning. 1995, Springer.
14. [14] Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka, E.R. Jr., Mitchell, T.M., Toward an architecture for never-ending language learning. Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Vol. 5, 2010, 3.
15. [15] Chen, Z., Liu, B., Topic modeling using topics from many domains, lifelong learning and big data. Proceedings of the 31st International Conference on Machine Learning (ICML-14), 2014, 703–711.
16. [16] Chen, Z., Liu, B., Mining topics in documents: standing on the shoulders of big data. Proceedings of the 20th ACM SIGKDD International Conference on KNOWLEDGE Discovery and Data Mining, ACM, 2014, 1116–1125.
17. [17] Silver, D.L., Mercer, R.E., The task rehearsal method of life-long learning: Overcoming impoverished data. Advances in Artificial Intelligence, 2002, Springer, 90–101.
18. [18] Silver, D.L., The parallel transfer of task knowledge using dynamic learning rates based on a measure of relatedness. Connect. Sci. 8:2 (1996), 277–294.
19. [19] Mesnil, G., Dauphin, Y., Glorot, X., Rifai, S., Bengio, Y., Goodfellow, I.J., Lavoie, E., Muller, X., Desjardins, G., Warde-Farley, D., et al. Unsupervised and transfer learning challenge: a deep learning approach. ICML Unsupervised Transf. Learn. 27 (2012), 97–110.
20. [20] Li, Z., Hoiem, D., Learning without forgetting. European Conference on Computer Vision, Springer, 2016, 614–629.
21. [21] A.A. Rusu, N.C. Rabinowitz, G. Desjardins, H. Soyer, J. Kirkpatrick, K. Kavukcuoglu, R. Pascanu, R. Hadsell, Progressive neural networks, arXiv preprint, arXiv:1606.04671.
22. [22] Pfahringer, B., Holmes, G., Kirkby, R., New options for hoeffding trees. Australasian Joint Conference on Artificial Intelligence, Springer, 2007, 90–99.
23. [23] Ruvolo, P., Eaton, E., Ella: an efficient lifelong learning algorithm. Proceedings of the Thirtieth International Conference on Machine Learning, ICML 28, 2013, 507–515.
24. [24] Ruvolo, P., Eaton, E., Scalable lifelong learning with active task selection. AAAI Spring Symposium: Lifelong Machine Learning, 2013, 602–610.
25. [25] Li, L., Yang, Q., Lifelong Machine Learning Test, AAAI, Workshop, 2015.
26. [26] Vapnik, V.N., Vapnik, V., Statistical Learning Theory, Vol. 1. 1998, Wiley New York.
27. [27] Huang, Y.S., Suen, C.Y., A method of combining multiple experts for the recognition of unconstrained handwritten numerals. IEEE Trans. Pattern Anal. Mach. Intell. 17:1 (1995), 90–94.
28. [28] Kolter, J.Z., Maloof, M., et al. Dynamic weighted majority: A new ensemble method for tracking concept drift. Third IEEE International Conference on Data Mining, ICDM 2003, IEEE, 2003, 123–130.
29. [29] Hssina, B., Merbouha, A., Ezzikouri, H., Erritali, M., A comparative study of decision tree id3 and c4. 5. Int. J. Adv. Comput. Sci. Appl., 4, 2014, 2.
30. [30] Quinlan, J.R., C4.5: Programs for Machine Learning. 2014, Elsevier.
31. [31] Esposito, F., Malerba, D., Semeraro, G., Kay, J., et al. A comparative analysis of methods for pruning decision trees. IEEE Trans. Pattern Anal. Mach. Intell. 19:5 (1997), 476–491.
32. [32] Helmbold, D.P., Schapire, R.E., Predicting nearly as well as the best pruning of a decision tree. Mach. Learn. 27:1 (1997), 51–68.
33. [33] Kearns, M.J., Mansour, Y., A fast, bottom-up decision tree pruning algorithm with near-optimal generalization. ICML, Vol. 98, Citeseer, 1998, 269–277.
34. [34] Lichman, M., UCI Machine Learning Repository. 2013 http://archive.ics.uci.edu/ml.
35. [35] Moro, S., Cortez, P., Rita, P., A data-driven approach to predict the success of bank telemarketing. Decis. Support Syst. 62 (2014), 22–31.
36. [36] Xanthopoulos, P., Razzaghi, T., A weighted support vector machine method for control chart pattern recognition. Comput. Ind. Eng. 70 (2014), 134–149.
37. [37] Demuth, H., Beale, M., Neural Network Toolbox, For Use with MATLAB. 2000, The MathWorks Inc.