An introduction to inductive logic programming
Relational Data Mining
Classification trees for problems with monotonicity constraints
ACM SIGKDD Explorations Newsletter
Machine Learning
A Simple Approach to Ordinal Classification
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
On Top-k Search with No Random Access Using Small Memory
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Uncertainty Issues and Algorithms in Automating Process Connecting Web and User
Uncertainty Reasoning for the Semantic Web I
Intelligent Information Processing in Semantically Enriched Web
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Personalized faceted browsing for digital libraries
ECDL'07 Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries
| Hi-index | 0.00 |
Classification methods commonly assume unordered class values. In many practical applications – for example grading – there is a natural ordering between class values. Furthermore, some attribute values of classified objects can be ordered, too. The standard approach in this case is to convert the ordered values into a numeric quantity and apply a regression learner to the transformed data. This approach can be used just in case of linear ordering. The proposed method for such a classification lies on the boundary between ordinal classification trees, classification trees with monotonicity constraints and multi-relational classification trees. The advantage of the proposed method is that it is able to handle non-linear ordering on the class and attribute values. For the better understanding, we use a toy example from the semantic web environment – prediction of rules for the user's evaluation of hotels.