Dominance-based rough set approach to incomplete ordered information systems

被引:73
作者
Du, Wen Sheng [1 ,2 ]
Hu, Bao Qing [1 ,2 ]
机构
[1] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Peoples R China
[2] Wuhan Univ, Computat Sci Hubei Key Lab, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
Dominance-based rough set approach; Incomplete ordered information system; Incomplete ordered decision table; Characteristic-based dominance relation; Attribute reduction; ATTRIBUTE REDUCTION; FEATURE-SELECTION; DECISION SYSTEMS; RULES; FUZZY; APPROXIMATIONS; KNOWLEDGE;
D O I
10.1016/j.ins.2016.01.098
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Dominance-based rough set approach has attracted much attention in practical applications ever since its inception. This theory has greatly promoted the research of multi criteria decision making problems involving preferential information. This paper mainly deals with approaches to attribute reduction in incomplete ordered information systems in which some attribute values may be lost or absent. By introducing a new kind of dominance relation, named the characteristic-based dominance relation, to incomplete ordered information systems, we expand the potential applications of dominance-based rough set approach. To eliminate information that is not essential, attribute reduction in the sense of reducing attributes is needed. An approach on the basis of the discernibility matrix and the discernibility function to computing all (relative) reducts is investigated in incomplete ordered information systems (consistent incomplete ordered decision tables). To reduce the computational burden, a heuristic algorithm with polynomial time complexity for finding a unique (relative) reduct is designed by using the inner and outer significance measures of each criterion candidate. Moreover, some numerical experiments are employed to verify the feasibility and effectiveness of the proposed algorithms. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:106 / 129
页数:24
相关论文
共 72 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[2]  
[Anonymous], 2000, NATURE STAT LEARNING, DOI DOI 10.1007/978-1-4757-3264-1
[3]  
[Anonymous], 1992, Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory, DOI DOI 10.1007/978-94-015-7975-9_21
[4]  
[Anonymous], 1985, Bull. Pol. Acad. Sci. Math
[5]  
Bache K., 2015, UCI MACHINE LEARNING
[6]  
Bazan J., 2003, ELECT NOTES THEORETI, V82, P1
[7]  
Blaszczynski Jerzy, 2012, Rough Sets and Current Trends in Computing. Proceedings 8th International Conference, RSCTC 2012, P56, DOI 10.1007/978-3-642-32115-3_6
[8]   Inductive discovery of laws using monotonic rules [J].
Blaszczynski, Jerzy ;
Greco, Salvatore ;
Slowinski, Roman .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2012, 25 (02) :284-294
[9]   Monotonic Variable Consistency Rough Set Approaches [J].
Blaszczynski, Jerzy ;
Greco, Salvatore ;
Slowinski, Roman ;
Szelag, Marcin .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2009, 50 (07) :979-999
[10]   Dominance-based decision rule induction for multicriteria ranking [J].
Chai, Junyi ;
Liu, James N. K. .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2013, 4 (05) :427-444