基于Hadoop的电信频繁交往圈算法研究  

Research of Algorithms about Frequency Telecom SNA Based on Hadoop

作　　者：杨苗苗[1] 李跃辉[1] 刘静[1] 许静[1] YANG Miao-miao, LI Yue-hui, LIU Jing, XU Jing （College of Telecommunication and Information Engineering, NJUPT, Nanjing 210003,China）

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003

出　　处：《电脑知识与技术》2013年第10期6380-6384,共5页Computer Knowledge and Technology

摘　　要：通过研究电信社交网络的个人交往圈和客户群，结合有向图和无向图，采用邻接链表，挖掘极大团，提出基于Ma-pReduce的频繁交往圈算法F-Graph，不仅找到频繁交往圈和客户群中的核心用户，同时减小了算法复杂度。利于运营商做出更科学的决策，提高市场竞争力。In this paper, a new algorithm called F-Graph will be proposed to study the telecom SNA. Combining the directed graphs and the undirected graphs to find the maximal cliques to find the core customers of clusters and to reduce the complexity of the algorithms. Buy the way it will benefit the operators to make more informed decisions to improve market competitiveness.

关 键 词：HADOOP MAPREDUCE 数据挖掘 极大团 

分 类 号：TP301[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]