Results 211 to 220 of about 619 (257)

Attribute reduction based on improved discernibility matrix

2010 2nd IEEE International Conference on Information Management and Engineering, 2010
The attribute reduction based on information entropy is different to that based on positive region in inconsistent information system. The problem of discernibility matrix in algebra view is analyzed, and an new discernibility matrix based on information entropy is proposed in this paper.
Zhou Peng, Li Zhishu, Huang Zhiguo
openaire   +1 more source

A New Discernibility Matrix and Function

2006
In the paper, we define a new discernibility matrix and function between two decision tables. They are extension of Hu's improved discernibility matrix and function such that the reducts and the cores of decision tables could be calculated by parts of them. The method of new discernibility matrix and function may be applied to the cases of large amount
Dayong Deng, Houkuan Huang
openaire   +1 more source

Discernibility Matrix Approach to Exception Analysis

2002
Exception plays an important role in Knowledge Discovery in Databases (KDD). As far as data description is concerned, exception could serve as the complement to rule to form concise representation about data set. More importantly, exception may provide more information than rule for people to understand the data set.
Min Zhao, Jue Wang
openaire   +1 more source

Evaluation of discernibility matrix based reduct computation techniques

2013 5th International Conference on Computer Science and Information Technology, 2013
Rough set theory provides some principles that are used for data classification and knowledge reduction. Reduct is one of the main concepts that can be used for feature set reduction and for data classification. Finding the reduct set is computationally expensive for data sets with large number of attributes.
Enas A. AliKhashashneh, Qasem A. Al-Radaideh   +1 more
openaire   +1 more source

Discernable matrix and its application in decision rules

2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008
Decision rules acquisition is based on attribute reduction, and Skowron?s discernable matrix is one of the most important methods of core finding and reduction. Basing on Skowron?s discernable matrix researching attribute reduction of decision system, this paper puts forward an algorithm for acquisition of decision rules and its application with ...
null Zheng Shufu, null Liao Fengchai, null Shi Kaiquan   +2 more
openaire   +1 more source

Multilabel Feature Selection Based on Relative Discernibility Pair Matrix

IEEE Transactions on Fuzzy Systems, 2022
In multi-label learning, the curse of dimensionality is one of major challenges. Existing single-label feature selection methods cannot be directly applied to multi-label data, and multi-label feature selections have thus been widely studied. As an effective granular computing tool, rough set theory has been applied to multi-label feature selections ...
Erliang Yao, Deyu Li, Yanhui Zhai, Chao Zhang   +3 more
openaire   +1 more source

A discernibility matrix for the topological reduction

International Journal of Machine Learning and Cybernetics, 2011
Discernibility matrices play an important role in the attribute reduction of information systems. The reduction of a family of general relations, which preserves the topological base, is an extension of the attribute reduction of information systems. In this paper, we construct a new discernibility matrix for the topological reduction of a family of ...
openaire   +1 more source

Efficient Attribute Reduction Based on Discernibility Matrix

2007
To reduce the time complexity of attribute reduction algorithm based on discernibility matrix, a simplified decision table is first introduced, and an algorithm with time complexity O(|C||U|) is designed for calculating the simplified decision table. And then, a new measure of the significance of an attribute is defined for reducing the search space of
Zhangyan Xu, Chengqi Zhang, Shichao Zhang, Wei Song, Bingru Yang   +4 more
openaire   +1 more source

Rule generating based on relative Discernibility Matrix

2012 International Conference on Computer Science and Information Processing (CSIP), 2012
The concept of relative decision is put forward and the method for finding absolute reduction decision rule through combining rules of relative decisional condition sets is given in this paper. In the process of decision table reduction, the relative Discernibility Matrix between decision categories should be created in order to decide the relative ...
openaire   +1 more source

Finding all the absolute reductions based on discernibility matrix

2005 International Conference on Machine Learning and Cybernetics, 2005
Rough-set-based-method to simplify a decision table is of great importance. We can calculate the absolute reductions and relative reductions and core through the discernibility matrix, but the numeration is very complex and the archival memory is very large.
null Hua Li, null Jie Zhu
openaire   +1 more source