Computer Science ›› 2018, Vol. 45 ›› Issue (2): 103-108.doi: 10.11896/j.issn.1002-137X.2018.02.018

Previous Articles     Next Articles

Parallel Algorithm for Mining User Frequent Communication Relationship

ZHU Peng-yu, BAO Pei-ming and JI Gen-lin   

  • Online:2018-02-15 Published:2018-11-13

Abstract: With the rapid development of mobile communication technology and Internet,mobile communication equipment has become a portable tool for most people.A parallel algorithm PMFCS was proposed for mining frequent communication sub-graph of mass communication data.The algorithm is based on the Apriori algorithm and sub-graph connect principle.It uses Spark to distribute all the edges to each computing node,then the 1th-order frequent candidate sub-graphs are distributed to each node,the 1th-order frequent candidate sub-graphs are counted at each node,and the 1th-order sub-graphs are got by summarizing candidate sub-graphs.PMFCS iteratively connects the (k-1)th-order sub-graph and the 1th-order sub-graph to generate kth-order candidate sub-graphs.Subsequently,the algorithm terminates until the kth-order frequent sub-graph set is empty.The experimental results show that PMFCS can mine the frequent communication sub-graph efficiently and quickly.

Key words: Communication network,Frequent sub-graph,Frequent communication relationship

[1] ZAHARIA M,CHOWDHURY M,DAS T,et al.Resilient distributed datasets:A fault-tolerant abstraction for in-memory cluster computing[C]∥Proceedings of the 9th USENIX Confe-rence on Networked Systems Design and Implementation.USENIX Association,2012:2.
[2] DEAN J,GHEMAWAT S.MapReduce:simplified data proces-sing on large clusters[J].Communications of the ACM,2008,51(1):107-113.
[3] NATU M,SADAPHAL V,PATIL S,et al.Mining frequentsubgraphs to extract communication patterns in data-centres[C]∥International Conference on Distributed Computing and Networking.Springer Berlin Heidelberg,2011:239-250.
[4] AGRAWAL R,SRIKANT R.Fast algorithms for mining associa-tion rules[C]∥Proceedings of the 20th VLDB Conference.1994:487-499.
[5] NIRMALA P,SULOCHANA L R,RETHNASAMY N.Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks[J].Know-ledge and Information Systems,2016,6(1):213-239.
[6] PARISUTHMA N,RETHNASAMY N.An algorithm to search edge relaxed query graph with minimum support threshold in large communication networks[C]∥International Conference on Communication Systems and Networks.IEEE,2016:1-6.
[7] INOKUCHI A,WASHIO T,MOTODA H.An apriori-based algorithm for mining frequent substructures from graph data[C]∥European Conference on Principles of Data Mining and Know-ledge Discovery.Springer Berlin Heidelberg,2000:13-23.
[8] KURAMOCHI M,KARYPIS G.Frequent subgraph discovery[C]∥Proceedings of IEEE International Conference on Data Mining.IEEE,2001:313-320.
[9] YAN X,HAN J.gspan:Graph-based substructure pattern mi-ning[C]∥International Conference on Data Mining.IEEE,2002:721-724.
[10] HUAN J,WANG W,PRINS J.Efficient mining of frequent subgraphs in the presence of isomorphism[C]∥International Conference on Data Mining.IEEE,2003:549-552.
[11] WANG W,ZHOU H F,YUAN Q Q,et al.Mining frequent patterns based on graph theory[J].Journal of Computer Research and Development,2005,2(2):230-235.(in Chinese) 汪卫,周皓峰,袁晴晴,等.基于图论的频繁模式挖掘[J].计算机研究与发展,2005,2(2):230-235.
[12] LI X T,LI J Z,GAO H.An efficient frequent subgraphmining algorithm[J].Journal of Software,2007,8(10):2469-2480.(in Chinese) 李先通,李建中,高宏.一种高效频繁子图挖掘算法[J].软件学报,2007,8(10):2469-2480.
[13] BHUIYAN M A,AL HASAN M.FSM-H:Frequent subgraph mining algorithm in Hadoop[C]∥International Congress on Big Data.IEEE,2014:9-16.
[14] LU W,CHEN G,TUNG A K H,et al.Efficiently extracting frequent subgraphs using mapreduce[C]∥International Confe-rence on Big Data.IEEE,2013:639-647.
[15] Reality commons.

No related articles found!
Full text



No Suggested Reading articles found!