期刊文献+

RULES-IT: incremental transfer learning with RULES family

RULES-IT: incremental transfer learning with RULES family
原文传递
导出
摘要 In today's world of excessive development in technologies, sustainability and adaptability of computer applications is a challenge, and future prediction became significant. Therefore, strong artificial intelligence (AI) became important and, thus, statistical machine learning (ML) methods were applied to serve it. These methods are very difficult to understand, and they predict the future without showing how. However, understanding of how machines make their decision is also important, especially in information system domain. Consequently, incremental covering algorithms (CA) can be used to produce simple rules to make difficult decisions. Nevertheless, even though using simple CA as the base of strong AI agent would be a novel idea but doing so with the methods available in CA is not possible. It was found that having to accurately update the discovered rules based on new information in CA is a challenge and needs extra attention. In specific, incomplete data with missing classes is inappropriately considered, whereby the speed and data size was also a concern, and future none existing classes were neglected. Consequently, this paper will introduce a novel algorithm called RULES-IT, in order to solve the problems of incremental CA and introduce it into strong AI. This algorithm is the first incremental algorithm in its family, and CA as a whole, that transfer rules of different domains to improve the performance, generalize the induction, take advantage of past experience in different domain, and make the learner more intelligent. It is also the first to introduce intelligent aspectsinto incremental CA, including consciousness, subjective emotions, awareness, and adjustment. Furthermore, all decisions made can be understood due to the simple representation of repository as rules. Finally, RULES-IT performance will be benchmarked with six different methods and compared with its predecessors to see the effect of transferring rules in the learning process, and to prove how RULES-IT actually solved th In today's world of excessive development in technologies, sustainability and adaptability of computer applications is a challenge, and future prediction became significant. Therefore, strong artificial intelligence (AI) became important and, thus, statistical machine learning (ML) methods were applied to serve it. These methods are very difficult to understand, and they predict the future without showing how. However, understanding of how machines make their decision is also important, especially in information system domain. Consequently, incremental covering algorithms (CA) can be used to produce simple rules to make difficult decisions. Nevertheless, even though using simple CA as the base of strong AI agent would be a novel idea but doing so with the methods available in CA is not possible. It was found that having to accurately update the discovered rules based on new information in CA is a challenge and needs extra attention. In specific, incomplete data with missing classes is inappropriately considered, whereby the speed and data size was also a concern, and future none existing classes were neglected. Consequently, this paper will introduce a novel algorithm called RULES-IT, in order to solve the problems of incremental CA and introduce it into strong AI. This algorithm is the first incremental algorithm in its family, and CA as a whole, that transfer rules of different domains to improve the performance, generalize the induction, take advantage of past experience in different domain, and make the learner more intelligent. It is also the first to introduce intelligent aspectsinto incremental CA, including consciousness, subjective emotions, awareness, and adjustment. Furthermore, all decisions made can be understood due to the simple representation of repository as rules. Finally, RULES-IT performance will be benchmarked with six different methods and compared with its predecessors to see the effect of transferring rules in the learning process, and to prove how RULES-IT actually solved th
出处 《Frontiers of Computer Science》 SCIE EI CSCD 2014年第4期537-562,共26页 中国计算机科学前沿(英文版)
关键词 incremental learning transfer learning covering algorithms RULES family inductive learning incremental learning, transfer learning, covering algorithms, RULES family, inductive learning
  • 相关文献

参考文献3

二级参考文献29

  • 1Quinlan J R. Induction of decision trees[J].{H}Machine Learning,1986,(01):81-106. 被引量:1
  • 2Olaru C,Wehenkel L. A complete fuzzy decision tree technique[J].{H}Fuzzy Sets and Systems,2003,(02):221-254.doi:10.1016/S0165-0114(03)00089-7. 被引量:1
  • 3Quinlan J R. C4.5:programs for machine learning[M].{H}Morgan Kaufmann Publishers Inc,1993. 被引量:1
  • 4Baldwin J,Lawry J,Martin T. Mass assignment fuzzy ID3 with applications[A].1997.278-294. 被引量:1
  • 5Janikow C Z. Fuzzy decision trees:issues and methods[J].IEEE Transactions on Systems Man and Cybernetics Part B:Cybernetics,1998,(01):1-14. 被引量:1
  • 6Huang Z,Gedeon T D,Nikravesh M. Pattern trees induction:a new machine learning method[J].{H}IEEE Transactions on Fuzzy Systems,2008,(04):958-970. 被引量:1
  • 7Qin B,Xia Y,Li F. Dtu:a decision tree for uncertain data[J].Advances in Knowledge Discovery and Data Mining,2009.4-15. 被引量:1
  • 8Provost F,Domingos P. Tree induction for probability-based ranking[J].{H}Machine Learning,2003,(03):199-215.doi:10.1023/A:1024099825458. 被引量:1
  • 9Qin Z,Lawry J. Decision tree learning with fuzzy labels[J].{H}Information Sciences,2005,(01):91-129. 被引量:1
  • 10Qin Z,Lawry J. Prediction trees using linguistic modelling[A].2005. 被引量:1

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部