A relational perspective of attribute reduction in rough set-based data analysis

檔案

日期

2011-08-16

類型

期刊名稱

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

卷期與頁次

第 213 卷第 1 期,頁 270–278

ISSN

0377-2217

語言

英文

摘要

Attribute reduction is very important in rough set-based data analysis (RSDA) because it can be used to simplify the induced decision rules without reducing the classification accuracy. The notion of reduct plays a key role in rough set-based attribute reduction. In rough set theory, a reduct is generally defined as a minimal subset of attributes that can classify the same domain of objects as unambiguously as the original set of attributes. Nevertheless, from a relational perspective, RSDA relies on a kind of dependency principle. That is, the relationship between the class labels of a pair of objects depends on component-wise comparison of their condition attributes. The larger the number of condition attributes compared, the greater the probability that the dependency will hold. Thus, elimination of condition attributes may cause more object pairs to violate the dependency principle. Based on this observation, a reduct can be defined alternatively as a minimal subset of attributes that does not increase the number of objects violating the dependency principle. While the alternative definition coincides with the original one in ordinary RSDA, it is more easily generalized to cases of fuzzy RSDA and relational data analysis. (C) 2010 Elsevier B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Fan, T.-F., Liau, C.-J., & Liu, D.-R. (2011). A relational perspective of attribute reduction in rough set-based data analysis. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 213(1), 270–278. https://doi.org/10.1016/j.ejor.2010.08.017

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/20190