Results 261 to 270 of about 2,610,867 (326)

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

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

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

The method of attribute reduction based on discernibility matrix

2010 International Conference on Computer Application and System Modeling (ICCASM 2010), 2010
With respect to decision table, especially the inconsistent ones. On the basis of equivalent partitions, This paper quantifies the elements in the same class deduced by condition attribute belonging to different decision attribute classes, generates the discernibility matrix and measures the indexes of attribute significance reasonable, and then uses ...
null Lv Yue-jin, null Liu Hong-mei, null Jiang Jian-jun   +2 more
openaire   +1 more source

Efficient Attribute Reduction Algorithm Based on Skowron Discernibility Matrix

2009 International Workshop on Intelligent Systems and Applications, 2009
The elements of discernibility matrix are used as the heuristic information by all the existing attribute reduction algorithms based on discernibility matrix. The time and space complexities of this kind of algorithms are O(\C\ 2 |U\ 2 ). To lower the time and space complexities, the simplified decision table and simplified discernibility matrix is ...
Zhangyan Xu, Liyu Huang, Bingru Yang
openaire   +1 more source

Discernibility Matrix-Based Attribute Reduction Algorithm of Decision Table

Advanced Materials Research, 2012
A discernibility matrix-based attribute reduction algorithm of decision table is introduced in this paper, which takes the importance of attributes as the heuristic message. This method solves the problem of the attribute selection when the frequencies of decision table attributes are equal.
Ying He, Dan He
openaire   +1 more source