一种基于极大连通子图的电信社群网分割算法

Algorithm of splitting telecom society network based on maximal connected subgraph

随着电信事业的发展,电信社群网的分析逐渐兴起。根据电信数据的特点,以关系数据库为基础,实现了一个极大连通子图求解算法(MCSG)。该算法利用等价类的概念实现了图数据分层处理,利用边标识法表示极大连通子图,确保了结果中顶点和边信息的完整性。实验表明,MCSG算法有效实现了对电信社群网的分割。

With the development of telecommunications,analysis of telecom society network rises gradually.According to the char acteristics 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.