Title
A Nearest Hyperrectangle Monotonic Learning Method
Abstract
We can find real prediction learning problems whose class attribute is represented by ordinal values that should increase with some of the explaining attributes. They are known as classification problems with monotonicity constraints. In this contribution, our goal is to formalize the nearest hyperrectangle learning approach to manage monotonicity constraints. The idea behind it is to retain objects in R-n, which can be either single points or hyperrectangles or rules into a combined model. The approach is checked with experimental analysis involving wide range of monotonic data sets. The results reported, verified by nonparametric statistical tests, show that our approach is very competitive with wellknown techniques for monotonic classification.
Year
DOI
Venue
2016
10.1007/978-3-319-32034-2_26
Hybrid Artificial Intelligent Systems
Keywords
Field
DocType
Monotonic classification, Instance-based learning, Rule induction, Nested generalized examples
Hyperrectangle,Monotonic function,Data set,Instance-based learning,Ordinal number,Computer science,Nonparametric statistics,Rule induction,Artificial intelligence,Machine learning
Conference
Volume
ISSN
Citations 
9648
0302-9743
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Javier Gamez Garcia1353.71
José Ramón Cano240015.64
Salvador García3121934.57