Algorithm for computing core based on incomplete decision table
Year: 2012
Type: article
Abstract: The computing core algorithm is one of the important researches in rough set theory.At present,most of the computing core algorithms are based on complete decision table.The research of computing core based on incomplete decision table is few.A way to compute binary discernibility matrix based on incomplete decision table is provided.On this condition,an algorithm for computing core is designed with the binary dicernibility matrix.It also proves theoretically that the core computed based on binary discernibility matrix is equal to the core based on positive region.The time complexity of the new algorithm is O(|C||U|2).An example is used to illustrate the correctness of the new algorithm.
Author: Yang Bing-ru
Institution: Guangxi Normal University
Language: English
Topic: Rough Sets and Fuzzy Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: rough set theory, positive region, time complexity
Open Access status: diamond
OpenAlex ID: W2381970321
