Rough Set is a valid mathematical theory developed in recent years, which has been applied successfully in such fields as machine learning, data mining, intelligent data analyzing and control algorithm acquiring. In t...Rough Set is a valid mathematical theory developed in recent years, which has been applied successfully in such fields as machine learning, data mining, intelligent data analyzing and control algorithm acquiring. In this paper, the authors discuss the reduction of knowledge using conditional entropy in rough set theory. First, the changing tendency of the conditional entropy of decision attributes giving condition attributes is studied from the viewpoint of information. Next, a new reduction algorithm based on conditional entropy is developed. Furthermore, our simulation results show that the algorithm can find the minimal reduction in most cases.展开更多
The method and steps of acquiring evaluation rules based on the knowledge reduction theory of rough sets is discussed, and the distilling process and approach for the evaluation rules of mechanical product structure d...The method and steps of acquiring evaluation rules based on the knowledge reduction theory of rough sets is discussed, and the distilling process and approach for the evaluation rules of mechanical product structure design is described by using hydraulic torque converter as an example. Practice shows that this approach to a certain extent simplifies the knowledge base structure and reasoning process in comparison with the case-based reasoning method in the aspect of setting up evaluation rule base and carrying out reasoning to realize the mechanical product evaluation.展开更多
Feature selection is the pretreatment of data mining. Heuristic search algorithms are often used for this subject. Many heuristic search algorithms are based on discernibility matrices, which only consider the differe...Feature selection is the pretreatment of data mining. Heuristic search algorithms are often used for this subject. Many heuristic search algorithms are based on discernibility matrices, which only consider the difference in information system. Because the similar characteristics are not revealed in discernibility matrix, the result may not be the simplest rules. Although differencesimilitude（DS） methods take both of the difference and the similitude into account, the existing search strategy will cause some important features to be ignored. An improved DS based algorithm is proposed to solve this problem in this paper. An attribute rank function, which considers both of the difference and similitude in feature selection, is defined in the improved algorithm. Experiments show that it is an effective algorithm, especially for large-scale databases. The time complexity of the algorithm is O（｜ C ｜^2｜U ｜^2）.展开更多
It is helpful for people to understand the essence of rough set theory to study the concepts and operations of rough set theory from its information view. In this paper we address knowledge expression and knowledge re...It is helpful for people to understand the essence of rough set theory to study the concepts and operations of rough set theory from its information view. In this paper we address knowledge expression and knowledge reduction in incomplete infolvnation systems from the information view of rough set theory. First, by extending information entropy-based measures in complete information systems, two new measures of incomplete entropy and incomplete conditional entropy are presented for incomplete information systems. And then, based on these measures the problem of knowledge reduction in incomplete information systems is analyzed and the reduct definitions in incomplete information system and incomplete decision table are proposed respectively. Finally, the reduct definitions based on incomplete entropy and the reduct definitions based on similarity relation are compared. Two equivalent relationships between them are proved by theorems and an in equivalent relationship between them is illustrated by an example. The work of this paper extends the research of rough set theory from information view to incomplete information systems and establishes the theoretical basis for seeking efficient algorithm of knowledge acquisition in incomplete information systems.展开更多
This paper proposes an approach for functional knowledge representation based on problem reduction,which represents the organization of problem-solving activities in two levels:reduction and reasoning.The former makes...This paper proposes an approach for functional knowledge representation based on problem reduction,which represents the organization of problem-solving activities in two levels:reduction and reasoning.The former makes the functional plans for problem-solving while the latter constructs functional units, called handlers,for executing subproblems designated by these plans.This approach emphasizes that the representation of domain knowledge should be closely combined with(rather than separated from)its use therefore provides a set of reasoning-level primitives to construct handlers and formulate the control strate- gies for executing them.As reduction-level primitives,handlers are used to construct handler-associative networks,which become the executable representation of problem-reduction graphs,in order to realize the problem-solving methods suited to domain features.Besides,handlers and their control slots can be used to focus the attention of knowledge acquisition and reasoning control.展开更多
文摘Rough Set is a valid mathematical theory developed in recent years, which has been applied successfully in such fields as machine learning, data mining, intelligent data analyzing and control algorithm acquiring. In this paper, the authors discuss the reduction of knowledge using conditional entropy in rough set theory. First, the changing tendency of the conditional entropy of decision attributes giving condition attributes is studied from the viewpoint of information. Next, a new reduction algorithm based on conditional entropy is developed. Furthermore, our simulation results show that the algorithm can find the minimal reduction in most cases.
文摘The method and steps of acquiring evaluation rules based on the knowledge reduction theory of rough sets is discussed, and the distilling process and approach for the evaluation rules of mechanical product structure design is described by using hydraulic torque converter as an example. Practice shows that this approach to a certain extent simplifies the knowledge base structure and reasoning process in comparison with the case-based reasoning method in the aspect of setting up evaluation rule base and carrying out reasoning to realize the mechanical product evaluation.
基金Supported by the National Natural Science Foundation of China (90204008)Chen-Guang Plan of Wuhan City(20055003059-3)
文摘Feature selection is the pretreatment of data mining. Heuristic search algorithms are often used for this subject. Many heuristic search algorithms are based on discernibility matrices, which only consider the difference in information system. Because the similar characteristics are not revealed in discernibility matrix, the result may not be the simplest rules. Although differencesimilitude（DS） methods take both of the difference and the similitude into account, the existing search strategy will cause some important features to be ignored. An improved DS based algorithm is proposed to solve this problem in this paper. An attribute rank function, which considers both of the difference and similitude in feature selection, is defined in the improved algorithm. Experiments show that it is an effective algorithm, especially for large-scale databases. The time complexity of the algorithm is O（｜ C ｜^2｜U ｜^2）.
基金Sponsored by the Youth Natural Science Foundation of Yantai Normal University.
文摘It is helpful for people to understand the essence of rough set theory to study the concepts and operations of rough set theory from its information view. In this paper we address knowledge expression and knowledge reduction in incomplete infolvnation systems from the information view of rough set theory. First, by extending information entropy-based measures in complete information systems, two new measures of incomplete entropy and incomplete conditional entropy are presented for incomplete information systems. And then, based on these measures the problem of knowledge reduction in incomplete information systems is analyzed and the reduct definitions in incomplete information system and incomplete decision table are proposed respectively. Finally, the reduct definitions based on incomplete entropy and the reduct definitions based on similarity relation are compared. Two equivalent relationships between them are proved by theorems and an in equivalent relationship between them is illustrated by an example. The work of this paper extends the research of rough set theory from information view to incomplete information systems and establishes the theoretical basis for seeking efficient algorithm of knowledge acquisition in incomplete information systems.
基金This research was supported by National High-tech Program(863 Program)of P.R.China.
文摘This paper proposes an approach for functional knowledge representation based on problem reduction,which represents the organization of problem-solving activities in two levels:reduction and reasoning.The former makes the functional plans for problem-solving while the latter constructs functional units, called handlers,for executing subproblems designated by these plans.This approach emphasizes that the representation of domain knowledge should be closely combined with(rather than separated from)its use therefore provides a set of reasoning-level primitives to construct handlers and formulate the control strate- gies for executing them.As reduction-level primitives,handlers are used to construct handler-associative networks,which become the executable representation of problem-reduction graphs,in order to realize the problem-solving methods suited to domain features.Besides,handlers and their control slots can be used to focus the attention of knowledge acquisition and reasoning control.
