Next Article in Journal
Empirical Study on the Factors Influencing Process Innovation When Adopting Intelligent Robots at Small- and Medium-Sized Enterprises—The Role of Organizational Supports
Next Article in Special Issue
Multiple-Criteria Decision-Making (MCDM) Techniques for Business Processes Information Management
Previous Article in Journal
Low-Complexity Synchronization Scheme with Low-Resolution ADCs
Previous Article in Special Issue
Multiple Criteria Decision-Making in Heterogeneous Groups of Management Experts
Article Menu

Export Article

Open AccessArticle
Information 2018, 9(12), 314; https://doi.org/10.3390/info9120314

A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata

1
School of Computer and Control Engineering, Yantai University, 264005 Yantai, China
2
Department of Computer Science and Technology, Tongji University, 201804 Shanghai, China
*
Author to whom correspondence should be addressed.
Received: 30 October 2018 / Revised: 3 December 2018 / Accepted: 6 December 2018 / Published: 7 December 2018
Full-Text   |   PDF [421 KB, uploaded 17 December 2018]   |  

Abstract

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, knowledge representation and uncertainty reasoning. An original binary discernibility matrix usually contains redundant objects and attributes. These redundant objects and attributes may deteriorate the performance of feature selection and knowledge acquisition. To overcome this shortcoming, row relations and column relations in a binary discernibility matrix are defined in this paper. To compare the relationships of different rows (columns) quickly, we construct deterministic finite automata for a binary discernibility matrix. On this basis, a quick algorithm for binary discernibility matrix simplification using deterministic finite automata (BDMSDFA) is proposed. We make a comparison of BDMR (an algorithm of binary discernibility matrix reduction), IBDMR (an improved algorithm of binary discernibility matrix reduction) and BDMSDFA. Finally, theoretical analyses and experimental results indicate that the algorithm of BDMSDFA is effective and efficient. View Full-Text
Keywords: rough sets; binary discernibility matrices; deterministic finite automata rough sets; binary discernibility matrices; deterministic finite automata
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Zhang, N.; Li, B.; Zhang, Z.; Guo, Y. A Quick Algorithm for Binary Discernibility Matrix Simplification using Deterministic Finite Automata. Information 2018, 9, 314.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top