We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
基于国际贸易网特性的贸易依赖派系过滤算法.
- Authors
郑 军; 张永庆; 黄 霞; 沈爱忠
- Abstract
In allusion to common complicate networks, current community partition algorithms may have limitations in applying to specific problems. In order to partition international trade communities exactly and reasonably, this paper presented an improved algorithm called dependence weighted clique percolation( DWCP). It took into account the influences of characteristics of real international trade networks,in which equal countries widely connect and depend with each other with quite different and fluctuant trade flows,constitute overlapping organizations and relatively stable trade communities. Then.it was used to find the trade communities on the Maritime Silk Road,and compared with several other common algorithms. The result proves the valid of this algorithm through comprehensively testing community structure identification, modularity degree,degree of consistent with reality and the interpretability.
- Publication
Application Research of Computers / Jisuanji Yingyong Yanjiu, 2017, Vol 34, Issue 12, p3708
- ISSN
1001-3695
- Publication type
Article
- DOI
10.3969/j.issn.1001-3695.2017.12.043