Ascent–descent variable neighborhood decomposition search for community detection by modularity maximization
Author:
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Link
http://link.springer.com/article/10.1007/s10479-017-2553-9/fulltext.html
Reference46 articles.
1. Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Perron, S., & Liberti, L. (2010). Column generation algorithms for exact modularity maximization in networks. Physical Review E, 82(4), 046–112.
2. Aloise, D., Caporossi, G., Hansen, P., Liberti, L., Perron, S., & Ruiz, M. (2013). Modularity maximization in networks by variable neighborhood search. Graph Partitioning and Graph Clustering, 588, 113–127.
3. Alpert, CJ., Yao, SZ. (1995). Spectral partitioning: the more eigenvectors, the better. In Proceedings of the 32nd annual ACM/IEEE design automation conference ( pp. 195–200). ACM
4. Bader, D. A., Meyerhenke, H., Sanders, P., & Wagner, D. (Eds.). (2013). Graph partitioning and graph clustering – 10th DIMACS implementation challenge, contemporary mathematics (Vol. 588). Boston: AMS.
5. Barber, M. J., & Clark, J. W. (2009). Detecting network communities by propagating labels under constraints. Physical Review E, 80(2), 026–129.
Cited by 21 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On finding the community with maximum persistence probability;4OR;2023-12-26
2. Variable Neighborhood Search: The power of change and simplicity;Computers & Operations Research;2023-07
3. How to Use K-means for Big Data Clustering?;Pattern Recognition;2023-05
4. Probabilistic Community Detection in Social Networks;IEEE Access;2023
5. Graph Regularized Nonnegative Matrix Factorization for Community Detection in Attributed Networks;IEEE Transactions on Network Science and Engineering;2023-01-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3