期刊文献+
共找到13篇文章
< 1 >
每页显示 20 50 100
A Method for Data Classification Based on Discernibility Matrix and Discernibility Function 被引量:1
1
作者 SUN Shi-bao QIN Ke-yun 《Wuhan University Journal of Natural Sciences》 EI CAS 2006年第1期230-233,共4页
A method for data classification will influence the efficiency of classification. Attributes reduction based on discernibility matrix and discernibility function in rough sets can use in data classification, so we put... A method for data classification will influence the efficiency of classification. Attributes reduction based on discernibility matrix and discernibility function in rough sets can use in data classification, so we put forward a method for data classification. Namely, firstly, we use discernibility matrix and discernibility function to delete superfluous attributes in formation system and get a necessary attribute set. Secondly, we delete superfluous attribute values and get decision rules. Finally, we classify data by means of decision rules. The experiments show that data classification using this method is simpler in the structure, and can improve the efficiency of classification. 展开更多
关键词 discernibility matrix discernibility function attributes reduction data classification
下载PDF
Reduction Algorithms Based on Discernibility Matrix:The Ordered Attributes Method 被引量:130
2
作者 王珏 王驹 《Journal of Computer Science & Technology》 SCIE EI CSCD 2001年第6期489-504,共16页
In this paper, we present reduction algorithms based on the principle of Skowron's discernibility matrix - the ordered attributes method. The completeness of the algorithms for Pawlak reduct and the uniqueness for... In this paper, we present reduction algorithms based on the principle of Skowron's discernibility matrix - the ordered attributes method. The completeness of the algorithms for Pawlak reduct and the uniqueness for a given order of the attributes are proved. Since a discernibility matrix requires the size of the memory of U2, U is a universe of objects, it would be impossible to apply these algorithms directly to a massive object set. In order to solve the problem, a so-called quasi-discernibility matrix and two reduction algorithms are proposed. Although the proposed algorithms are incomplete for Pawlak reduct, their opimal paradigms ensure the completeness as long as they satisfy some conditions. Finally we consider the problem on the reduction of distributive object sets. 展开更多
关键词 rough set theory principle of discernibility matrix inductive machine learning
原文传递
Generalized binary discernibility matrix for attribute reduction in incomplete information systems 被引量:3
3
作者 Ma Fumin Zhang Tengfei 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2017年第4期57-68,75,共13页
To extract and express the knowledge hidden in information systems, discernibility matrix and its extensions were introduced and applied successfully in many real life applications. Binary discernibility matrix, as a ... To extract and express the knowledge hidden in information systems, discernibility matrix and its extensions were introduced and applied successfully in many real life applications. Binary discernibility matrix, as a representative approach, has many interesting superior properties and has been rapidly developed to find intuitive and easy to understand knowledge. However, at present, the binary discernibility matrix is mainly adopted in the complete information system. It is a challenging topic how to achieve the attribute reduction by using binary discernibility matrix in incomplete information system. A form of generalized binary discernibility matrix is further developed for a number of representative extended rough set models that deal with incomplete information systems. Some useful properties and criteria are introduced for judging the attribute core and attribute relative reduction. Thereafter, a new algorithm is formulated which supports attribute core and attribute relative reduction based on the generalized binary discernibility matrix. This algorithm is not only suitable for consistent information systems but also inconsistent information systems. The feasibility of the proposed methods was demonstrated by worked examples and experimental analysis. 展开更多
关键词 rough set generalized binary discernibility matrix attribute relative reduction incomplete information system
原文传递
Investigation on AQ11, ID3 and the Principle of Discernibility Matrix 被引量:2
4
作者 王珏 崔佳 赵凯 《Journal of Computer Science & Technology》 SCIE EI CSCD 2001年第1期1-12,共12页
The principle of discernibility matrix serves as a tool to discuss and analyze two algorithms of traditional inductive machine learning, AQ11 and ID3. The results are: (1) AQ11 and its family can be completely specifi... The principle of discernibility matrix serves as a tool to discuss and analyze two algorithms of traditional inductive machine learning, AQ11 and ID3. The results are: (1) AQ11 and its family can be completely specified by the principle of discernibility matrix; (2) ID3 can be partly, but not naturally, specified by the principle of discernibility matrix; and (3) The principle of discernibility matrix is employed to analyze Cendrowska sample set, and it shows the weaknesses of knowledge representation style of decision tree in theory. 展开更多
关键词 rough set theorys principle of discernibility matrix inductive ma- chine learning
原文传递
An improved reduction algorithm based on the degree of attribute discernibility 被引量:1
5
作者 张铮 Yu Daoyuan Li Peigen 《High Technology Letters》 EI CAS 2007年第3期244-248,共5页
This paper deals with the problem of attribute discernibility reduction and proposes some new concepts to rough set theory (RST) based on the discernibility matrix of Skowron, such as secondary core, regeneration ma... This paper deals with the problem of attribute discernibility reduction and proposes some new concepts to rough set theory (RST) based on the discernibility matrix of Skowron, such as secondary core, regeneration matrix and the degree of attribute discernibility (DAD). This paper puts forward an attribute reduction algorithm based on maximum discernibility degree, which opens up an effective way of gaining minimum attribute reduction of decision table. The efficacy of this algorithm has been verified by practical application in a diagnostic system of loader, which substantially decreases information gathering requirement and lowers the overall cost with no loss of accuracy. 展开更多
关键词 attribute reduction discernibility matrix degree of attribute discernibility (DAD) secondary core regeneration discernibility matrix
下载PDF
Attribute reduction algorithm based on discernibility for decision table
6
作者 曾凡智 卢炎生 黄国顺 《Journal of Shanghai University(English Edition)》 CAS 2008年第6期531-536,共6页
The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute ... The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute discernible matrix and its discernibility is first established for general information systems. Based on the idea that the equivalent discernible matrix has a same attribute reduction, existing matrices are modified and a formula of attribute discernibility associated with algebraic reduction for decision table is proposed. A heuristic attribute reduction algorithm based on attribute discernibility is presented. Experimental results indicate that the algorithm can more easily explore an optimal or sub-optimal reduction, and is efficient. 展开更多
关键词 decision table attribute reduction discernibility discernible matrix ALGORITHM
下载PDF
Extended Rough Set Model Based on Prior Probability and Valued Tolerance Relation
7
作者 Hao-Dong Zhu Hong-Chan Li 《Journal of Electronic Science and Technology》 CAS 2011年第1期46-50,共5页
Based on equivalence relation,the classical rough set theory is unable to deal with incomplete information systems.In this case,an extended rough set model based on valued tolerance relation and prior probability obta... Based on equivalence relation,the classical rough set theory is unable to deal with incomplete information systems.In this case,an extended rough set model based on valued tolerance relation and prior probability obtained from incomplete information systems is firstly founded.As a part of the model,the corresponding discernibility matrix and an attribute reduction of incomplete information system are then proposed.Finally,the extended rough set model and the proposed attribute reduction algorithm are verified under an incomplete information system. 展开更多
关键词 Attribute reduction discernibility matrix incomplete information system prior probability rough set.
下载PDF
Application of fractal theory in detecting low current faults of power distribution system in coal mines 被引量:5
8
作者 LIU Jian-hua LIANG Rui WANG Chong-lin FAN Di-peng 《Mining Science and Technology》 EI CAS 2009年第3期321-325,共5页
Single-phase low current grounding faults areoften seen in power distribution system of coal mines.These faults are difficult to reliably identify.We propose a new method of single-phase ground fault protection based ... Single-phase low current grounding faults areoften seen in power distribution system of coal mines.These faults are difficult to reliably identify.We propose a new method of single-phase ground fault protection based upon a discernible matrix of the fractal dimension associated with line currents.The method builds on existing selective protection methods.Faulted feeders are distinguished using differences in the zero-sequence transient current fractal dimension.The current signals were first processed through a fast Fourier transform and then the characteristics of a faulted line were identified using a discernible matrix.The method of calculation is illustrated.The results show that the method involves simple calculations, is easy to do and is highly accurate.It is, therefore, suitable for distribution networks having different neutral grounding modes. 展开更多
关键词 low current faults zero sequence transient current fractal dimension discernible matrix selective protection
下载PDF
Attribute reduction theory and approach to concept lattice 被引量:73
9
作者 ZHANG Wenxiu WEI Ling QI Jianjun 《Science in China(Series F)》 2005年第6期713-726,共14页
The theory of the concept lattice is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. This pa... The theory of the concept lattice is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. This paper proposes the theory of attribute reduction in the concept lattice, which extends the theory of the concept lattice. In this paper, the judgment theorems of consistent sets are examined, and the discernibility matrix of a formal context is introduced, by which we present an approach to attribute reduction in the concept lattice. The characteristics of three types of attributes are analyzed. 展开更多
关键词 formal context concept lattice attribute reduction discernibility matrix
原文传递
Attribute reduction theory of concept lattice based on decision formal contexts 被引量:38
10
作者 WEI Ling QI JianJun ZHANG WenXiu 《Science in China(Series F)》 2008年第7期910-923,共14页
The theory of concept lattices is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. Based on t... The theory of concept lattices is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. Based on the reduction theory of classical formal context, this paper proposes the definition of decision formal context and its reduction theory, which extends the reduction theory of concept lattices. In this paper, strong consistence and weak consistence of decision formal context are defined respectively. For strongly consistent decision formal context, the judgment theorems of consistent sets are examined, and approaches to reduction are given. For weakly consistent decision formal context, implication mapping is defined, and its reduction is studied. Finally, the relation between reducts of weakly consistent decision formal context and reducts of implication mapping is discussed. 展开更多
关键词 concept lattice decision formal context attribute reduction discernibility matrix implication mapping
原文传递
Second Attribute Algorithm Based on Tree Expression 被引量:3
11
作者 韩素青 王珏 《Journal of Computer Science & Technology》 SCIE EI CSCD 2006年第3期383-392,共10页
One view of finding a personalized solution of reduct in an information system is grounded on the viewpoint that attribute order can serve as a kind of semantic representation of user requirements. Thus the problem of... One view of finding a personalized solution of reduct in an information system is grounded on the viewpoint that attribute order can serve as a kind of semantic representation of user requirements. Thus the problem of finding personalized solutions can be transformed into computing the reduct on an attribute order. The second attribute theorem describes the relationship between the set of attribute orders and the set of reducts, and can be used to transform the problem of searching solutions to meet user requirements into the problem of modifying reduct based on a given attribute order. An algorithm is implied based on the second attribute theorem, with computation on the discernibility matrix. Its time complexity is O(n^2 × m) (n is the number of the objects and m the number of the attributes of an information system). This paper presents another effective second attribute algorithm for facilitating the use of the second attribute theorem, with computation on the tree expression of an information system. The time complexity of the new algorithm is linear in n. This algorithm is proved to be equivalent to the algorithm on the discernibility matrix. 展开更多
关键词 attribute order second attribute discernibility matrix tree expression
原文传递
Discretization Algorithm Based on Particle Swarm Optimization and Its Application in Attributes Reduction for Fault Data 被引量:1
12
作者 ZHENG Bo LI Yanfeng FU Guozhong 《Journal of Shanghai Jiaotong university(Science)》 EI 2018年第5期691-695,共5页
In order to increase the fault diagnosis efficiency and make the fault data mining be realized, the decision table containing numerical attributes must be discretized for further calculations. The discernibility matri... In order to increase the fault diagnosis efficiency and make the fault data mining be realized, the decision table containing numerical attributes must be discretized for further calculations. The discernibility matrix-based reduction method depends on whether the numerical attributes can be properly discretized or not.So a discretization algorithm based on particle swarm optimization(PSO) is proposed. Moreover, hybrid weights are adopted in the process of particles evolution. Comparative calculations for certain equipment are completed to demonstrate the effectiveness of the proposed algorithm. The results indicate that the proposed algorithm has better performance than other popular algorithms such as class-attribute interdependence maximization(CAIM)discretization method and entropy-based discretization method. 展开更多
关键词 attributes discretization fault data reduction discernibility matrix particle swarm optimization(PSO) hybrid weight
原文传递
Design of a new type of integrated classifier for network intrusion detection systems
13
作者 ZHU You-chan WANG Jian SHANG Li-biao 《Frontiers of Electrical and Electronic Engineering in China》 CSCD 2006年第4期475-479,共5页
Based on the analysis of the network intrusion detection model,a new design scheme for the integrated classifier is proposed.The attribute reduction algorithm of the discernibility matrix is used for the optimization ... Based on the analysis of the network intrusion detection model,a new design scheme for the integrated classifier is proposed.The attribute reduction algorithm of the discernibility matrix is used for the optimization design of reducing nodes of input and hidden layers.The experi-mental test result shows that this design is valid. 展开更多
关键词 intrusion detection system rough sets discernibility matrix integrated classifier
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部