首页 | 本学科首页   官方微博 | 高级检索  
     


MoNGEL: monotonic nested generalized exemplar learning
Authors:Javier García  Habib M. Fardoun  Daniyal M. Alghazzawi  José-Ramón Cano  Salvador García
Affiliation:1.Department of Computer Science,University of Jaén,Jaén,Spain;2.Department of Information Systems, Faculty of Computing and Information Technology,King Abdulaziz University,Jeddah,Saudi Arabia;3.Department of Computer Science, EPS of Linares,University of Jaén,Linares,Spain;4.Department of Computer Science and Artificial Intelligence,University of Granada,Granada,Spain
Abstract:In supervised prediction problems, the response attribute depends on certain explanatory attributes. Some real problems require the response attribute to represent ordinal values that should increase with some of the explaining attributes. They are called classification problems with monotonicity constraints. In this paper, we aim at formalizing the approach to nested generalized exemplar learning with monotonicity constraints, proposing the monotonic nested generalized exemplar learning (MoNGEL) method. It accomplishes learning by storing objects in ({mathbb {R}}^n), hybridizing instance-based learning and rule learning into a combined model. An experimental analysis is carried out over a wide range of monotonic data sets. The results obtained have been verified by non-parametric statistical tests and show that MoNGEL outperforms well-known techniques for monotonic classification, such as ordinal learning model, ordinal stochastic dominance learner and k-nearest neighbor, considering accuracy, mean absolute error and simplicity of constructed models.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号