IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v209y2025ics0167947325000489.html

Model-based edge clustering for weighted networks with a noise component

Author

Listed:
  • Li, Haomin
  • Sewell, Daniel K.

Abstract

Clustering is a fundamental task in network analysis, essential for uncovering hidden structures within complex systems. Edge clustering, which focuses on relationships between nodes rather than the nodes themselves, has gained increased attention in recent years. However, existing edge clustering algorithms often overlook the significance of edge weights, which can represent the strength or capacity of connections, and fail to account for noisy edges—connections that obscure the true structure of the network. To address these challenges, the Weighted Edge Clustering Adjusting for Noise (WECAN) model is introduced. This novel algorithm integrates edge weights into the clustering process and includes a noise component that filters out spurious edges. WECAN offers a data-driven approach to distinguishing between meaningful and noisy edges, avoiding the arbitrary thresholding commonly used in network analysis. Its effectiveness is demonstrated through simulation studies and applications to real-world datasets, showing significant improvements over traditional clustering methods. Additionally, the R package “WECAN”1 has been developed to facilitate its practical implementation.

Suggested Citation

  • Li, Haomin & Sewell, Daniel K., 2025. "Model-based edge clustering for weighted networks with a noise component," Computational Statistics & Data Analysis, Elsevier, vol. 209(C).
    • Handle: RePEc:eee:csdana:v:209:y:2025:i:c:s0167947325000489
    DOI: 10.1016/j.csda.2025.108172
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947325000489
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2025.108172?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Pham, Hanh T. D. & Sewell, Daniel K., 2024. "Automated detection of edge clusters via an overfitted mixture prior – CORRIGENDUM," Network Science, Cambridge University Press, vol. 12(2), pages 201-201, June.
    2. Eddelbuettel, Dirk & Sanderson, Conrad, 2014. "RcppArmadillo: Accelerating R with high-performance C++ linear algebra," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 1054-1063.
    3. T. S. Evans & R. Lambiotte, 2010. "Line graphs of weighted networks for overlapping communities," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 77(2), pages 265-272, September.
    4. Mark S. Handcock & Adrian E. Raftery & Jeremy M. Tantrum, 2007. "Model‐based clustering for social networks," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 170(2), pages 301-354, March.
    5. Pham, Hanh T. D. & Sewell, Daniel K., 2024. "Automated detection of edge clusters via an overfitted mixture prior," Network Science, Cambridge University Press, vol. 12(1), pages 88-106, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wilson J. Wright & Peter N. Neitlich & Alyssa E. Shiel & Mevin B. Hooten, 2022. "Mechanistic spatial models for heavy metal pollution," Environmetrics, John Wiley & Sons, Ltd., vol. 33(8), December.
    2. Laleh Tafakori & Armin Pourkhanali & Riccardo Rastelli, 2022. "Measuring systemic risk and contagion in the European financial network," Empirical Economics, Springer, vol. 63(1), pages 345-389, July.
    3. Samrachana Adhikari & Beau Dabbs, 2018. "Social Network Analysis in R: A Software Review," Journal of Educational and Behavioral Statistics, , vol. 43(2), pages 225-253, April.
    4. Guang Ouyang & Dipak K. Dey & Panpan Zhang, 2020. "Clique-Based Method for Social Network Clustering," Journal of Classification, Springer;The Classification Society, vol. 37(1), pages 254-274, April.
    5. Samrachana Adhikari & Tracy Sweet & Brian Junker, 2021. "Analysis of longitudinal advice‐seeking networks following implementation of high stakes testing," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 184(4), pages 1475-1500, October.
    6. Panknin, Lea & Boy, Karl-Friedrich & Henning, Christian H.C.A., 2024. "Can the European Green Deal be a game changer for sustainable food system transformation? A computational political economy approach," 2024 Annual Meeting, July 28-30, New Orleans, LA 343740, Agricultural and Applied Economics Association.
    7. François Bachoc & Marc G Genton & Klaus Nordhausen & Anne Ruiz-Gazen & Joni Virta, 2020. "Spatial blind source separation," Biometrika, Biometrika Trust, vol. 107(3), pages 627-646.
    8. Jin, Jiashun & Ke, Zheng Tracy & Luo, Shengming, 2024. "Mixed membership estimation for social networks," Journal of Econometrics, Elsevier, vol. 239(2).
    9. Wentao Qu & Xianchao Xiu & Huangyue Chen & Lingchen Kong, 2023. "A Survey on High-Dimensional Subspace Clustering," Mathematics, MDPI, vol. 11(2), pages 1-39, January.
    10. Xiaohui Liu & Yuzi Liu & Petra Laketa & Stanislav Nagy & Yuting Chen, 2025. "Exact and approximate computation of the scatter halfspace depth," Computational Statistics, Springer, vol. 40(1), pages 547-572, January.
    11. West, Robert M. & House, Allan O. & Keen, Justin & Ward, Vicky L., 2015. "Using the structure of social networks to map inter-agency relationships in public health services," Social Science & Medicine, Elsevier, vol. 145(C), pages 107-114.
    12. Napoleón Vargas Jurado & Kent M. Eskridge & Stephen D. Kachman & Ronald M. Lewis, 2018. "Using a Bayesian Hierarchical Linear Mixing Model to Estimate Botanical Mixtures," Journal of Agricultural, Biological and Environmental Statistics, Springer;The International Biometric Society;American Statistical Association, vol. 23(2), pages 190-207, June.
    13. Chiara Di Maria & Antonino Abbruzzo & Gianfranco Lovison, 2022. "Networks as mediating variables: a Bayesian latent space approach," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 31(4), pages 1015-1035, October.
    14. repec:ags:aaea22:343740 is not listed on IDEAS
    15. James Joseph Balamuta & Steven Andrew Culpepper, 2022. "Exploratory Restricted Latent Class Models with Monotonicity Requirements under PÒLYA–GAMMA Data Augmentation," Psychometrika, Springer;The Psychometric Society, vol. 87(3), pages 903-945, September.
    16. Athanasios C. Micheas & Jiaxun Chen, 2018. "sppmix: Poisson point process modeling using normal mixture models," Computational Statistics, Springer, vol. 33(4), pages 1767-1798, December.
    17. Chen, Mingli & Fernández-Val, Iván & Weidner, Martin, 2021. "Nonlinear factor models for network and panel data," Journal of Econometrics, Elsevier, vol. 220(2), pages 296-324.
    18. Andrii ROSKLADKA & Roman BAIEV, 2021. "Digitalization of data analysis tools as the key for success in the online trading markets," Access Journal, Access Press Publishing House, vol. 2(3), pages 222-233, September.
    19. Etienne Côme & Nicolas Jouvin & Pierre Latouche & Charles Bouveyron, 2021. "Hierarchical clustering with discrete latent variable models and the integrated classification likelihood," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(4), pages 957-986, December.
    20. Mihai C. Giurcanu, 2017. "Oracle M-Estimation for Time Series Models," Journal of Time Series Analysis, Wiley Blackwell, vol. 38(3), pages 479-504, May.
    21. Zhou, Xu & Liu, Yanheng & Wang, Jian & Li, Chun, 2017. "A density based link clustering algorithm for overlapping community detection in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 65-78.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:209:y:2025:i:c:s0167947325000489. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.