Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12678
Title: Rough sets and ordinal reducts
Authors: Lee, JWT
Yeung, DS
Tsang, ECC
Keywords: Ordinal reduct
Rough set
Issue Date: 2006
Publisher: Springer
Source: Soft computing, 2006, v. 10, no. 1, p. 27-33 How to cite?
Journal: Soft computing 
Abstract: Rough set theory has been successfully applied in selecting attributes to improve the effectiveness in deriving decision trees/rules for decisions and classification problems. When decisions involve ordinal classes, the rough set reduction process should try to preserve the order relation generated by the decision classes. Previous works on rough sets when applied to ordinal decision systems still focus on preserving the information relating to the decision classes and not the underlying order relation. In this paper, we propose a new way of evaluating and finding reducts involving ordinal decision classes which focus on the order generated by the ordinal decision classes.
URI: http://hdl.handle.net/10397/12678
ISSN: 1432-7643
DOI: 10.1007/s00500-005-0460-5
Appears in Collections:Journal/Magazine Article

SFX Query Show full item record

SCOPUSTM   
Citations

13
Last Week
0
Last month
0
Citations as of Dec 15, 2017

WEB OF SCIENCETM
Citations

14
Last Week
0
Last month
0
Citations as of Dec 17, 2017

Page view(s)

36
Last Week
0
Last month
Citations as of Dec 11, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.