Results 231 to 240 of about 619 (257)
Some of the next articles are maybe not open access.
Granular computing-based binary discernibility matrix attribute reduction algorithm
2008 7th World Congress on Intelligent Control and Automation, 2008Granular computing (GrC) fuses theoretical research results such as rough sets, fuzzy sets, word computing, quotient space and interval computing. GrC is a new hotspot in artificial intelligence and information processing. Layer viewpoint is a concept in GrC and multi-layer GrC has great significance in the problem solving and knowledge structure of ...
null Jun Xie +3 more
openaire +1 more source
Attribute Reduction in Concept Lattice Based on Discernibility Matrix
2005As an effective tool for knowledge discovery, concept lattice has been successfully applied to various fields. One of the key problems of knowledge discovery is knowledge reduction. This paper studies attribute reduction in concept lattice. Using the idea similar to Skowron and Rauszer's discernibility matrix, the discernibility matrix and function of ...
Wen-Xiu Zhang, Ling Wei, Jian-Jun Qi
openaire +1 more source
A Symbolic Representation for Discernibility Matrix in Rough Set
Advanced Science and Technology Letters, 2014Generating discernibility matrix consumes huge time and space .To solve this problem, A new Binary Discernibility Matrix (BDM) induced from information table is defined, The concept of Binary Conjunction Matrix(BCM) is then introduced, Finally A novel method for discernibility matrix using Ordered binary decision diagrams(OBDD) is proposed in this ...
openaire +1 more source
Notice of Retraction: Attribute reduction based on improved discernibility matrix
2010 2nd International Conference on Computer Engineering and Technology, 2010The 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.
null Zhou Peng +2 more
openaire +1 more source
A Simplified Discernibility Matrix of the Attribute Reduction Method
2010 3rd International Conference on Information Management, Innovation Management and Industrial Engineering, 2010According to existing have defects discernibility matrix, and the attribute reduction algorithm for attribute reduction algorithm of complex process. This paper made part of optimization, based on the condition attributes classify the grouping generated representative data to simplify the discernibility matrix, and the order of the discernibility ...
Weilai Hao, Xuebin Zhang
openaire +1 more source
Research of Discernible Matrix-Based Algorithm for Attribute Value Reduction
2010 International Conference on Intelligent Computing and Cognitive Informatics, 2010The essence and process of attribute value reduction is analyzed from the view of logic. Then a new algorithm for attribute value reduction based on rough set is proposed by constructing a discernible matrix and the correctness and feasibility is proved.
Baowei Zhang, Na Wang
openaire +1 more source
An Efficient Algorithm for Attribute Reduction Based on Discernibility Matrix
2011 International Conference on Intelligent Computation and Bio-Medical Instrumentation, 2011A definition for reducing discernibility matrix is provided, and a reduction relative of discernibility set is analyzed to reduce the time complexity of attribute reduction algorithm based on traditional matrix. Use iterative idea to select the necessary condition attributes adding to this reduction relative. Optimize the reduction relative by complete
Juan Zhang, Ani Dong, Yi Niu, Huabei Nie
openaire +1 more source
Discernibility Matrix Enriching and Boolean-And Algorithm for Attributes Reduction
2014discernibility matrix and binary discernibility matrix method is easy to understand and design, which has aroused great concern by many scholar. Research shows that the two methods produce a large number of repeated and useless elements (if A is the subset of B, B is the useless element of A) on the fly. These repeated and useless elements occupy a lot
ZhangYan Xu +3 more
openaire +1 more source
Decision Rules Extraction Strategy Based on Bit Coded Discernibility Matrix
2006The rationality of a reduction approach for decision rules with discernibility matrix is analyzed and proved true theoretically. And a rules extraction strategy based on bit-coded discernibility matrix is presented. By bit-coding the description of discernibility matrix, the information is depicted by a series of binary code, which makes it easy to ...
Yuxia Qiu, Keming Xie, Gang Xie
openaire +1 more source
Constructing Discernibility Matrix for Different Reduction Objectives
INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences, 2013Zhiguo Huang -, Dong Yu -
openaire +1 more source