期刊：
Scientific World Journal,2014年2014:514369 ISSN：1537-744X
通讯作者：
Liu Wenjun
作者机构：
[Liu Wenjun; Li Qingguo] Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China.;[Liu Wenjun] Changsha Univ Sci & Technol, Sch Math & Comp Sci, Changsha 410076, Hunan, Peoples R China.
通讯机构：
[Liu Wenjun] H;Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China.
摘要：
Combining rough sets and fuzzy soft sets, we propose an algorithm to obtain the optimal decision program. In this algorithm, firstly, according to fuzzy soft sets, we build up information systems; secondly, we compute the significance of each parameter according to rough set theory; thirdly, combining subjective bias, we give an algorithm to obtain the comprehensive weight of each parameter; at last, we put forward a method to choose the optimal program. Example shows that the optimal algorithm is effective and rational.
期刊：
Journal of Convergence Information Technology,2012年7(23):442-449 ISSN：1975-9320
通讯作者：
Qing, G.(guoqingwyl@126.com)
作者机构：
[Wenjun, Liu] Department of Mathematics and Computing Science, Changsha University of Science and Technology, Changsha, Hunan 410004, China;[Qing, Guo] School of Mathematics, Hefei University of Technology, Hefei, Anhui 230009, China
关键词：
Attribute significance;Continuous domain;Minimum distance;Objective weight;Optimal program;Relative deviations;Rough set;Selection algorithm;Weight;Algorithms;Fuzzy clustering;Information systems;Optimization;Rough set theory
摘要：
First, according to fuzzy clustering and rough set theory, an attribute significance algorithm of a continuous domain information system is put forward; then, combining objective weight and subjective bias, we give an algorithm to obtain the comprehensive weight of each attribute; at last, we put forward a method to choose the optimal program according to the minimum distance of weighted relative deviation. During this optimal program selection algorithm, we think over not only the objective weight but also the subjective weight, so this algorithm is effective and rational.
摘要：
First, we give the definition of relative matrix of fuzzy relative, then, Combining the technology of fuzzy clustering and ideal of rough sets, a method to obtain the attribute reduct from an incomplete decision table which includes continuous, order and discrete attributes is put forward.. Example shows this algorithm is effective and feasible.
摘要：
Firstly, the author generalizes the indiscernible relation to similarity relation, gives a definition of lambda-discernibility matrix; secondly, an attribute reduct algorithm of decision table with continuous condition attributes is put forward; thirdly, an algorithm of computing significance of each condition attribute is put forward according to the properties of lambda-discernibility matrix; at last, the time complexity of the attribute reduct algorithm is analyzed and the rationality and effectiveness of this algorithm is accounted for through an example.
期刊：
Journal of Computational Information Systems,2008年4(2):595-602 ISSN：1553-9105
通讯作者：
Liu, W.(lliuwjzhlp@126.com)
作者机构：
[Liu, Wenjun] Department of Mathematics and Computing Science, Changsha University of Science and Technology, Changsha 410076, China
通讯机构：
Department of Mathematics and Computing Science, Changsha University of Science and Technology, China
关键词：
Data reduction;Fuzzy sets;Matrix algebra;Rough set theory;Attribute reduction;Rough sets;Decision tables
摘要：
In traditional rough set theory, it always used indiscernible relation classify objects, but, if the decision table with continuous attributes, classify objects with indiscernible relation is too strictly that each object maybe form a class. In this paper, first, the authors generalize the indiscernible relation to similarity relation, give a definition of λ-discernibility matrix; then, according to the properties of λ-discernibility matrix, an attribute reduction algorithm of decision table with continuous condition attributes is put forward; third, an algorithm of computing significance of each condition attribute is put forward; at last, the reasonable and available of those algorithms are account for by an example.
作者机构：
[刘文军] School of Mathematics and Computing Science,Changsha University of Science and Technology;[谷云东] Department of Mathematics and Phisics,North China Electirc Power University, Beijing;[李洪兴] Department of Mathematics,Beijing Normal University
作者机构：
[刘文军] Department of Mathematics and Computing Science,Changsha University of Science and Technology;[杨培亮] Department of Mathematics and Computer, Dali University
