Results 1 to 10 of about 782 (249)
Energies, 2018 In machine learning-based transient stability assessment (TSA) problems, the characteristics of the selected features have a significant impact on the performance of classifiers.
Bingyang Li, Jianmei Xiao, Xihuai Wang
doaj +4 more sources
Rule Acquisition Algorithm Based on Enriching Discernibility Matrix [PDF]
Jisuanji gongcheng, 2016 Currently,the discernibility matrix method which is based on HU is not only time-consuming but also takes up a lot of storage space,so that the efficiency of the method is not high.Some scholars use the method of pairwise comparisons between elements to ...
ZHU Jinhu,XU Zhangyan,QIAO Lijuan,XIE Xiaojun,WANG Ting
doaj +2 more sources
Incremental Attribute Reduction Algorithm Based on Binary Discernibility Matrix [PDF]
Jisuanji gongcheng, 2017 Incremental attribute reduction algorithm is one of the important research contents in the area of dyanmic data mining.To reduce the storage space of binary discernibility matrix,and by combining the advantages of the binary discernibility matrix that it
DING Mianwei,ZHANG Tengfei,MA Fumin
doaj +2 more sources
Information, 2018 The binary discernibility matrix, originally introduced by Felix and Ushio, is a binary matrix representation for storing discernible attributes that can distinguish different objects in decision systems. It is an effective approach for feature selection,
Nan Zhang +3 more
doaj +2 more sources
Accelerated Feature Selection via Discernibility Hashing: A Rough Set Approach [PDF]
EntropyAs a foundational analytical tool, the discernibility matrix plays a pivotal role in the systematic reduction of knowledge in rough set-based systems. Recent advancements in rough set theory have witnessed the proliferation of discernibility matrix-based
Sheng Luo +3 more
doaj +2 more sources
Using Covering Reduction to Identify Reducts for Object-Oriented Concept Lattices
Axioms, 2022 An object-oriented concept lattice, as an important generalization of classic concept lattices, is a bridge between formal concept analysis and rough set theory. This paper presents an application of covering reduction in formal concept analysis.
Guilong Liu
doaj +2 more sources
Incremental Algorithm for Attribute Reduction Based on Positive Region and Discernibility Element [PDF]
Jisuanji gongcheng, 2016 The reduction result should be updated continually with the dynamic changing of data in decision table.In order to improve the efficiency of attribute reduction while ensuring the simplest results,an improved decision table reduction algorithm is ...
LIU Taotao,MA Fumin,ZHANG Tengfei
doaj +2 more sources
Soft discernibility matrix and attribute reduction for information systems
Tongxin xuebao, 2009 A new concept of soft discernibility matrix was proposed, and related theorems were given. By using soft discernibility matrix,attribute reductions of incomplete information systems, fuzzy value information systems and vague sets value information ...
YAN De-qin1, LI Ke-qiu2, CHI Zhong-xian2
doaj +3 more sources
Attribute Reduction Algorithm Based on Structure Discernibility Matrix in Composite Information Systems [PDF]
ITM Web of Conferences, 2017 Attribute reduction, as an important preprocessing step for knowledge acquiring in data mining, is one of the key issues in rough set theory. It can only deal with attributes of a specific type in the information system by using a specific binary ...
Ge Mei-Jun, Fan Nian-Bai, Sun Tao
doaj +3 more sources
Allocation Reductions in Inconsistent Decision Tables Based on Dominance Relations
Fuzzy Information and Engineering, 2015 In recent years, many methods have been proposed in order to deal with inconsistent information systems based on indiscernibility relations in rough set theory. However, a little attention has been paid to inconsistent ordered decision tables.
Wen-Sheng Du, Bao-Qing Hu
doaj +2 more sources