计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (5): 8-9.
• 博士论坛 • 上一篇 下一篇
吴卫江,李国和
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
WU Wei-jiang,LI Guo-he
Received:
Revised:
Online:
Published:
Contact:
摘要： 随着电信事业的发展，电信社群网的分析逐渐兴起。根据电信数据的特点，以关系数据库为基础，实现了一个极大连通子图求解算法（MCSG）。该算法利用等价类的概念实现了图数据分层处理，利用边标识法表示极大连通子图，确保了结果中顶点和边信息的完整性。实验表明，MCSG算法有效实现了对电信社群网的分割。
关键词: 电信社群网, 极大连通子图, 算法
Abstract: With the development of telecommunications，analysis of telecom society network rises gradually.According to the characteristics of telecom data，an algorithm（MCSG） of searching maximal connected subgraph was proposed based on relational database.This algorithm realized hierachical processing of graph data with concept of equivalent class.Maximal connected subgraph was expressed with edge identifier pattern，thus，the information integrity of vertices and edges can be insured.From experiment results，algorithm MCSG realized splitting telecom society network effectively.
Key words: telecom society network, maximal connected subgraph, algorithm
吴卫江,李国和. 一种基于极大连通子图的电信社群网分割算法[J]. 计算机工程与应用, 2008, 44(5): 8-9.
WU Wei-jiang,LI Guo-he. Algorithm of splitting telecom society network based on maximal connected subgraph[J]. Computer Engineering and Applications, 2008, 44(5): 8-9.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2008/V44/I5/8
