Rao Dong-ning, Wang Jun-xing, Wei lai, et al. Parallel Minimal Cut Set Algorithm and Its Application in Financial Social Networks[J]. 2018, 35(2): 46-50.
Rao Dong-ning, Wang Jun-xing, Wei lai, et al. Parallel Minimal Cut Set Algorithm and Its Application in Financial Social Networks[J]. 2018, 35(2): 46-50.DOI: 10.12052/gdutxb.170146.
Parallel Minimal Cut Set Algorithm and Its Application in Financial Social Networks
Effective financial supervision has become a necessary guarantee for sound development of economy. Supervising the whole financial social network effectively would become possible if a set of key nodes which carry all the information flow in the financial social network can be found. The scale of social network is often quite large
so parallel algorithms for large-scale graph processing are necessary. A Pregel-based parallel algorithm for the minimal cut set problem is proposed. The experiment is conducted on Apache Spark platform. All data used in the experiment is from the BoardEx database. Experiment results show that the algorithm has a good performance in large-scale social network graph processing. With this parallel algorithm
minimal cut sets of financial social network graphs can be obtained so that effective financial supervision can be implemented.
关键词
Keywords
references
GHEMAWAT S, GOBIOFF H, LEUNG S T. The Google file system[C] //ROBBERT V R. SIGOPS Operating Systems Review. NY: ACM Press, 2003, 37(5): 29-43.
DEAN J, GHEMAWAT S. MapReduce: simplified data processing on large clusters[J]. Communications of the ACM, 2008, 51(1): 107-113.
CHANG F, DEAN J, GHEMAWAT S, et al . Bigtable: A distributed storage system for structured data[J ] . ACM Transactions on Computer Systems (TOCS), 2008, 26(2): 4.
MALEWICZ G, AUSTERN M H, BIK A J C, et al. Pregel: a system for large-scale graph processing[C] //AHMED E. Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data. NY: ACM Press, 2010: 135-146.
LI C, TU Y Q. The improvement of China's financial supervision system after the global financial crisis[J]. Journal of Nanjing Audit University, 2011, 8(1): 21-26.
张圣. 互联网金融监管的必要性与核心原则[J]. 时代金融, 2016(23): 25.
WANG P. Research about reform of finance supervision under new situation[J]. Law Science Magazine, 2011, 32(10): 44-47.
HE J F. On the legal paths to the internet financial regulation of our country[J]. Jinan Journal(Philosophy and Social Sciences), 2016, 38(1): 58-65.
赵江红. 金融腐败的对策思考[J]. 现代经济信息, 2010, (7): 149+152.
HAVELIWALA T H. Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search[J]. IEEE Transactions on Knowledge and Data Engineering, 2003, 15(4): 784-796.
RICHARDSON M, DOMINGOS P. The intelligent surfer: Probabilistic combination of link and content information in pagerank[C] //THOMAS G D. Advances in Neural Information Processing Systems.Cambridge: MIT Press, 2002: 1441-1448.
ZHANG L, MA F Y. Accelerated ranking: a new method to improve Web structure mining quality[J]. Journal of Computer Research and Development, 2004, 41(1): 98-103.
RAO D N, WEN Y L, WEI L, et al . A weighted centrality algorithm for social networks based on Spark Platform in Different Cultural environments[J ] . Journal of Guangdong University of Technology, 2017, 34(3): 15-20.
ZENG X L, WU B. Parallelized recommendation algorithm in location-based social network[J]. Journal of Computer Applications, 2016, 36(2): 316-323.
CHEN J, LI K, TANG Z, et al . A parallel random forest algorithm for big data in a Spark cloud computing environment[J ] . IEEE Transactions on Parallel and Distributed Systems, 2017, 28(4): 919-933.
HAN M, DAUDJEE K, AMMAR K, et al . An experimental comparison of pregel-like graph processing systems[J ] . Proceedings of the VLDB Endowment, 2014, 7(12): 1047-1058.
KARP R M, WIGDERSON A. A fast parallel algorithm for the maximal independent set problem[J]. Journal of the ACM (JACM), 1985, 32(4): 762-773.
LUBY M. A simple parallel algorithm for the maximal independent set problem[J]. SIAM Journal on Computing, 1986, 15(4): 1036-1053.