首页 | 本学科首页   官方微博 | 高级检索  
     检索      

粗糙集代数关系的图结构分析
引用本文:何童,史开泉.粗糙集代数关系的图结构分析[J].系统工程与电子技术,2008,30(9).
作者姓名:何童  史开泉
作者单位:山东大学数学与系统科学学院,山东,济南,250100
基金项目:山东省自然科学基金,福建省自然科学基金
摘    要:粗糙图理论是知识发现、知识挖掘的新的理论工具.结合粗糙图理论,构造了基于代数算子的粗糙图结构,将分析多个粗糙集之间的代数关系映射为相应粗糙图的结构分析.结合粗糙图理论中的类最短路算法,以情感计算中挖掘性格规律为例说明了该方法的应用过程.粗糙集代数关系的图结构分析是粗糙集理论中又一研究方向.

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

Graphic structure analysis for algebraic relationship of rough sets
HE Tong,SHI Kai-quan.Graphic structure analysis for algebraic relationship of rough sets[J].System Engineering and Electronics,2008,30(9).
Authors:HE Tong  SHI Kai-quan
Abstract: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.
Keywords:rough sets  algebraic relationship  rough graph  class shortest path algorithm
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号