粗糙集代数关系的图结构分析  

Graphic structure analysis for algebraic relationship of rough sets

作　　者：何童[1] 史开泉[1] 

机构地区：[1]山东大学数学与系统科学学院,山东济南250100

出　　处：《系统工程与电子技术》2008年第9期1679-1682,共4页Systems Engineering and Electronics

基　　金：山东省自然科学基金(Y2004A04);福建省自然科学基金(Z0511049)资助课题

摘　　要：粗糙图理论是知识发现、知识挖掘的新的理论工具。结合粗糙图理论,构造了基于代数算子的粗糙图结构,将分析多个粗糙集之间的代数关系映射为相应粗糙图的结构分析。结合粗糙图理论中的类最短路算法,以情感计算中挖掘性格规律为例说明了该方法的应用过程。粗糙集代数关系的图结构分析是粗糙集理论中又一研究方向。Rough graph theory is a new theory in knowledge discovery and knowledge mining. By combining with the rough graph theory, the rough graph structure based on algebraic operator is constructed, and algebraic relationship analysis among several rough sets is changed into the structure analysis of corresponding rough graph. Furthermore, the class shortest path algorithm of rough graph theory is introduced to the analysis. Meanwhile, by taking the individual character law mining in affective computing as an example, an application process of this method is given. The graphic structure analysis for algebraic relationship of rough sets is a new research direction of the rough set theory.

关 键 词：粗糙集 代数关系 粗糙图 类最短路算法 

分 类 号：O159[理学—数学]