粗糙网络及其应用  

Rough network and its application

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

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

出　　处：《系统工程与电子技术》2009年第3期588-592,共5页Systems Engineering and Electronics

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

摘　　要：粗糙图理论是知识发现、知识挖掘的新的理论工具。对粗糙图理论做进一步的研究,首先给出了有向粗糙图的定义,并进一步定义了粗糙网络及粗糙网络中的类流,又讨论了有向粗糙图及粗糙网络的表示形式。通过推广传统最大流算法,给出了粗糙网络中的类最大流算法,并将其应用于新的一类关系挖掘问题中。Rough graph theory is a new theory tools in knowledge discovery and knowledge mining. This paper makes further research on rough graph. The definition of directed rough graphs is given, and both the rough network and their expression form are also given. Furthermore, an algorithm of exploring class maximum flow in the rough network is presented, which generalizes the classical algorithm of exploring maximum flow. Finally, this paper successfully solves a new kind of relationship mining problem by using the algorithm.

关 键 词：粗糙图 有向粗糙图 粗糙网络 类最大流算法 关系挖掘 

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