Feature selection for monotonic classification via maximizing monotonic dependency

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Monotonic classification is a special task in machine learning and pattern recognition. As to monotonic classification, it is assumed that both features and decision are ordinal and there is the monotonicity constraints between the features and decision. Little work has been focused on feature selection for this type of tasks although a number of feature selection algorithms have been introduced for nominal classification problems. However these techniques can not be applied to monotonic classification as they do not consider the monotonicity constraints. In this work, we present a technique to compute the quality of features for monotonic classification. Using gradient directing search method, this method trains a feature weight vector by maximizing the fuzzy monotonic dependency, which was defined in fuzzy preference rough sets. We conduct some experiments to compare the classification performances of the proposed method with some other techniques. The experimental results show the effectiveness of the proposed algorithm. © 2014 Copyright: the authors.

Cite

CITATION STYLE

APA

Pan, W., Hu, Q., Song, Y., & Yu, D. (2014). Feature selection for monotonic classification via maximizing monotonic dependency. International Journal of Computational Intelligence Systems, 7(3), 543–555. https://doi.org/10.1080/18756891.2013.869903

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free