復雜網(wǎng)絡的社團結構分析-資料下載頁
2025-06-13 03:18本頁面
【正文】 相應的算法，這一算法不會產(chǎn)生resolution limit 和 misidentification 現(xiàn)象 XiangSun Zhang, Zhenping Li, RuiSheng Wang, Yong Wang. A binatorial model and algorithm for globally searching munity structure in plex works Journal of Combinatorial Optimization (JCO), 2022. DOI: A new OR model ? Problem definition: Given a work, the munity identification problem is to partition the work into as many nonoverlapping subworks as possible such that each subwork satisfies a given munity definition. 24 以上文字定義可以用一個整數(shù)線性規(guī)劃來描述 ? 我們證明了這個模型是 NPhard . 25 A qualified mincut (QMC) algorithm ? A heuristic principle is given to find a feasible partition with the largest number of munities. ? It is realized by a mincut operation: A mincut operation is called qualified if the two resulting subworks satisfy the module definition. ? The munity identification problem can be solved based on a series of qualified mincut operations. 26 Experiment results (artificial works) Rings of cliques Uneven adhoc work 27 Experiment results (real works) Football team work Jazz musician work 28 致謝 This work is cooperated with Dr. 李珍萍， Dr. 王瑞省， Dr. 王勇， Dr. 張世華， Dr. 王吉光， Dr. 張俊華 This work is supported by 國家自然科學重點基金 10631070 973項目 2066CB503905 國家自然科學基金項目 60873205 29 30 ? 歡迎訪問 ZHANGroup, 本報告可在該網(wǎng)頁上下載
教學教案相關推薦
鄂ICP備17016276號-1