CAJ | 학술논문

；社团划分算法是复杂网络研究中的一个热点问题，为发现复杂网络中的社团结构，更好的研究复杂网络的社团性质，本文利用网络中聚集系数提出了一种新的社团划分的算法，该算法综合运用复杂网络中点和边的信息，根据节点和边的聚集系数，计算出节点问的连接紧密程度，由局部到整体来划分出所有的社团结构。传统的复杂网络社团划分算法通过获得全局网络的信息，但随着网络规模的增加，获得全局网络的信息的难度也随之增加，本文提出的新算法避免这一难度所带来的问题。将该算法应用到Zachary空手道俱乐部网络和海豚社会网络，测试结果证明了该算法的可行性。
；사단화분산법시복잡망락연구중적일개열점문제，위발현복잡망락중적사단결구，경호적연구복잡망락적사단성질，본문이용망락중취집계수제출료일충신적사단화분적산법，해산법종합운용복잡망락중점화변적신식，근거절점화변적취집계수，계산출절점문적련접긴밀정도，유국부도정체래화분출소유적사단결구。전통적복잡망락사단화분산법통과획득전국망락적신식，단수착망락규모적증가，획득전국망락적신식적난도야수지증가，본문제출적신산법피면저일난도소대래적문제。장해산법응용도Zachary공수도구악부망락화해돈사회망락，측시결과증명료해산법적가행성。
Community detecting has been a research topic in the complex network area to find community structures in complex network, and to have a better research the properties .of the community structures in complex network, the paper proposes a new algorithm using network clustering coefficient, the algorithm making use of theihformation of vertices and edges in Complex network, calculate thetight Connection degree, and find all community structures from local to the whole of network. The global information Ofthe whole network,which is required by the traditional community detecting algorithms, is hard to get when the scale of the network grows. The new algorithm proposed in the paper can avoid the difficulty of the problem. The algorithm is applied to the Zachary karate club network and dolphin social network. The tested results show the validity of the algorithm.