Complex Relationship Mining Algorithm and Its Application

摘要：

　　Based on rough graph theory,this paper gives a new algorithm in rough network,which generalizes the classical algorithm of exploring maximum flow.This algorithm successfully deals with a kind of complex relationship mining problem between different relationship levels.Simulation shows the effectiveness of this algorithm.

关键词： Rough graph Rough Network Relationship mining Edmonds-Karp algorithm Class maximum flow algorithm

作者: He tong

作者单位: School of Applied Mathematics, Central University of Finance and Economics, Beijing 100081

会议类型: 国际会议

会议名称: 2012 2nd international Conference on Materials Science and Information Technology(2012第二届材料科学与信息技术国际会议)(MSIT2012)

会议地点: 西安

会议语种:英文

页码: 1736-1740

在线出版日期: 2012-08-24（万方平台首次上网日期，不代表论文的发表时间）