Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12063
Title: Finding reducts for ordinal decision tables
Authors: Lee, JWT
Wang, XZ
Wang, JF
Keywords: Decision tables
Decision theory
Rough set theory
Issue Date: 2005
Publisher: IEEE
Source: Proceedings of 2005 International Conference on Machine Learning and Cybernetics, 2005, 18-21 August 2005, Guangzhou, China, v. 5, p. 3143-3147 How to cite?
Abstract: Since its introduction, rough set theory has demonstrated its usefulness in many applications where imprecise and inconsistent information is involved. An important area of its application is in the induction of decision rules for decision problems. Recently, there are studies for applying rough set theory in decision related to ordering where items are ordered by assigning to them an ordinal class label such as excellent, good, fair, bad. In this paper we examine a particular situation of ordinal decision which has not been considered in previous studies. We introduce some new concepts in relation to reducts of such ordinal decision systems and proposed a way to find these reducts using a concept similar to discernibility matrix.
URI: http://hdl.handle.net/10397/12063
ISBN: 0-7803-9091-1
DOI: 10.1109/ICMLC.2005.1527483
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

48
Last Week
4
Last month
Citations as of Aug 14, 2018

Google ScholarTM

Check

Altmetric


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