Boosted seed oversampling for local community ranking
作者：
Highlights：
• Example seed nodes may be too few and non-central to help produce high quality community ranks.
• Finding more seed nodes can improve the quality of ranking algorithms.
• Proposed a novel seed oversampling method to find more seed nodes.
• Proposed a boosting scheme to combine seed oversampling iterations.
• Produced higher quality ranks compared to the neighborhood inflation heuristic.
摘要
•Example seed nodes may be too few and non-central to help produce high quality community ranks.•Finding more seed nodes can improve the quality of ranking algorithms.•Proposed a novel seed oversampling method to find more seed nodes.•Proposed a boosting scheme to combine seed oversampling iterations.•Produced higher quality ranks compared to the neighborhood inflation heuristic.
论文关键词：Network ranking,Local communities,Seed oversampling,Unsupervised rank boosting
论文评审过程：Received 15 October 2018, Revised 17 April 2019, Accepted 3 June 2019, Available online 18 June 2019, Version of Record 13 January 2020.
论文官网地址：https://doi.org/10.1016/j.ipm.2019.06.002
