基于Kullback-Leibler距离的循环经济园区网络重要节点识别方法  

Identification Method of Important Nodes in Circular Economy Park Network Based on Kullback-Leibler Distance

作　　者：毛泽天 Mao Zetian(School of Economics and Management Beijing University of Information Science and Technology,Beijing 100192)

机构地区：[1]北京信息科技大学经济管理学院,北京100192

出　　处：《现代工业经济和信息化》2018年第1期10-12,25,共4页Modern Industrial Economy and Informationization

基　　金：绿色发展大数据决策北京市重点实验室;北京知识管理研究基地和北京市教委科研计划项目"园区资源循环网络演化模型与系统研发(KM201711232016)";促进高校内涵发展-研究生科技创新项目-2017年经管学院研究生科技创新项目(512123503)

摘　　要：当前关于循环经济园区的研究主要集中在物质流、减量化等方面,对于园区拓扑结构的研究较少,而在拓扑结构的研究过程中,重要节点的识别是非常重要的。在现有研究的基础上,根据循环经济园区的特性,提出了园区的有向网络建模方法,然后将目前适用于无向网络节点重要度排序的K-L距离方法推导到有向网络,并将其应用于园区有向网络模型中。基于某园区的实验验证表明,通过本方法得出的重要节点识别结果具有一定参考价值。The current research on circular economy park is mainly focused on material flow,reduction and other aspects,but the research on the topology of the park is less,but in the process of the study of topology.The identifica tion of important nodes is very important.Based on the existing research and the characteristics of circular economy park,this paper proposes a directed network modeling method for the park.Then sort the importance of the node that is currently applicable to the undirected network The K-L distance method is deduced to the directed network and applied to the campus directed network model.The important node recognition results obtained by this method are of certain reference value.

关 键 词：Kullback-Leibler距离 循环经济园区 复杂网络 节点重要度 

分 类 号：F124[经济管理—世界经济]