Attribute Reduction Algorithm Based on Structure Discernibility Matrix in Composite Information Systems
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 relation. However, there may be attributes of multipl...
Main Authors: | Ge Mei-Jun, Fan Nian-Bai, Sun Tao |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2017-01-01
|
Series: | ITM Web of Conferences |
Online Access: | https://doi.org/10.1051/itmconf/20171101016 |
Similar Items
-
Efficient Generation of Reducts and Discerns for Classification
by: Graham, James T.
Published: (2007) -
Discernibility Matrix and Its Application in Logical Optimization
by: YAN Xinyi, WEN Xin, CHEN Zehua
Published: (2021-07-01) -
A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata
by: Nan Zhang, et al.
Published: (2018-12-01) -
Discerning Potential and Impact Information
by: Mark Burgin
Published: (2020-05-01) -
Soft Incomplete Discernibility Matrix for Decision-Making Problems
by: Lue Li, et al.
Published: (2018-01-01)