并行最小割算法及其在金融社交网络中的应用

饶东宁; 王军星; 魏来; 王雅丽

doi:10.12052/gdutxb.170146

欢迎来到能源电力期刊网！

English Version 期刊登录

您当前的位置：

首页 >

文章列表页 >

并行最小割算法及其在金融社交网络中的应用

更新时间：2026-05-27

- 并行最小割算法及其在金融社交网络中的应用
- Parallel Minimal Cut Set Algorithm and Its Application in Financial Social Networks
- 广东工业大学学报 2018年35卷第2期页码：46-50
- 作者机构：
  
  1. 广东工业大学　计算机学院,广东,广州,510006
  2. 香港大学　经济与金融学院,香港,中国,999077
  3. 华南师范大学　经济与管理学院,广东,广州,510631
- 作者简介：
  
  饶东宁(1977–)，男，副教授，博士，主要研究方向为金融智能、智能规划
  王军星(1995–)，男，硕士研究生，主要研究方向为金融智能.E-mail：moenokiseki@foxmail.com
- 基金信息：
  
  中央高校基本科研业务费专项资金资助项目(21615438);广东省自然科学基金资助项目(2016A030313084，2016A030313700，2014A030313374);广东省科技计划项目(2015B010128007)
- DOI：10.12052/gdutxb.170146
  中图分类号： TP182
- 网络首发：2018-03-09，
  
  纸质出版：2018
- 稿件说明：
移动端阅览
饶东宁, 王军星, 魏来, 王雅丽. 并行最小割算法及其在金融社交网络中的应用[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.
饶东宁, 王军星, 魏来, 王雅丽. 并行最小割算法及其在金融社交网络中的应用[J]. 广东工业大学学报, 2018, 35(2): 46-50. DOI： 10.12052/gdutxb.170146.

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.

摘要

有效实施金融监管已成为金融健康发展的必要保证. 若能够在金融社交网络中

找到一部分承载网络中所有信息流动的关键节点

便能实现整个金融社交网络的有效监管. 金融社交网络图规模通常较大

须开发大规模图处理并行算法. 本文提出基于分布式图处理平台Pregel的并行最小割算法. 实验基于Apache Spark平台开展

所用数据均来自BoardEx数据库. 实验结果表明

在大规模社交网络图的处理中

该算法具有良好性能. 利用该并行算法得到金融社交网络图的最小割

便可有效实施金融监管.

Abstract

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.

梁彦. 基于分布式平台Spark和YARN的数据挖掘算法的并行化研究[D]. 广州: 中山大学数据科学与计算机学院, 2014.

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.

邱荣财. 基于Spark平台的CURE算法并行化设计与应用[D]. 广州: 华南理工大学计算机科学与工程学院, 2014.

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.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于多智能体强化学习的社交网络舆情增强一致性方法

n-度中心度与k-压力中心度及其并行算法

基于大数据运输集团生产运营决策系统的构建及应用

融合社交和标签信息的隐语义模型推荐算法

利用消费者浏览行为识别品牌竞争关系研究