CAJ | 학술논문

介绍了一种新的社团挖掘算法MFA（Maximum weighted edge First Algorithm），该算法是一个优先考虑边权值进行社团划分的算法，同时也继承了通过优化Q值进行社团划分的算法的优点。通过实验证明，该算法完全正确的将加权的Zachary网络划分为个数分别为16和18的两个社团，要远优于其他大部分社团划分算法。
개소료일충신적사단알굴산법MFA（Maximum weighted edge First Algorithm），해산법시일개우선고필변권치진행사단화분적산법，동시야계승료통과우화Q치진행사단화분적산법적우점。통과실험증명，해산법완전정학적장가권적Zachary망락화분위개수분별위16화18적량개사단，요원우우기타대부분사단화분산법。
A new community structure identification algorithm MFA(Maximum weighted edge First Algorithm)was introduced, who was a priority for community division algorithm with edge weights,at the same time the advantages of optimized Q was in-herited.The experimental proved,the Zachary network of weighting was divided two community structure of 16 and 18 correct-ly,it`s better than most of the other algorithm.