IDEAS home Printed from https://ideas.repec.org/a/spr/elcore/v21y2021i4d10.1007_s10660-019-09395-y.html
   My bibliography  Save this article

Towards effective discovery of natural communities in complex networks and implications in e-commerce

Author

Listed:
  • Swarup Chattopadhyay

    (Indian Statistical Institute
    Indian Institute of Engineering Science and Technology)

  • Tanmay Basu

    (University of Birmingham)

  • Asit K. Das

    (Indian Institute of Engineering Science and Technology)

  • Kuntal Ghosh

    (Indian Statistical Institute)

  • Late C. A. Murthy

    (Indian Statistical Institute)

Abstract

Automated community detection is an important problem in the study of complex networks. The idea of community detection is closely related to the concept of data clustering in pattern recognition. Data clustering refers to the task of grouping similar objects and segregating dissimilar objects. The community detection problem can be thought of as finding groups of densely interconnected nodes with few connections to nodes outside the group. A node similarity measure is proposed here that finds the similarity between two nodes by considering both neighbors and non-neighbors of these two nodes. Subsequently, a method is introduced for identifying communities in complex networks using this node similarity measure and the notion of data clustering. The significant characteristic of the proposed method is that it does not need any prior knowledge about the actual communities of a network. Extensive experiments on several real world and artificial networks with known ground-truth communities are reported. The proposed method is compared with various state of the art community detection algorithms by using several criteria, viz. normalized mutual information, f-measure etc. Moreover, it has been successfully applied in improving the effectiveness of a recommender system which is rapidly becoming a crucial tool in e-commerce applications. The empirical results suggest that the proposed technique has the potential to improve the performance of a recommender system and hence it may be useful for other e-commerce applications.

Suggested Citation

  • Swarup Chattopadhyay & Tanmay Basu & Asit K. Das & Kuntal Ghosh & Late C. A. Murthy, 2021. "Towards effective discovery of natural communities in complex networks and implications in e-commerce," Electronic Commerce Research, Springer, vol. 21(4), pages 917-954, December.
    • Handle: RePEc:spr:elcore:v:21:y:2021:i:4:d:10.1007_s10660-019-09395-y
    DOI: 10.1007/s10660-019-09395-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10660-019-09395-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10660-019-09395-y?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Jitendra Kumar Rout & Kim-Kwang Raymond Choo & Amiya Kumar Dash & Sambit Bakshi & Sanjay Kumar Jena & Karen L. Williams, 2018. "A model for sentiment and emotion analysis of unstructured social media text," Electronic Commerce Research, Springer, vol. 18(1), pages 181-199, March.
    2. Henry Small, 1973. "Co‐citation in the scientific literature: A new measure of the relationship between two documents," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 24(4), pages 265-269, July.
    3. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    4. Chattopadhyay, Swarup & Basu, Tanmay & Das, Asit K. & Ghosh, Kuntal & Murthy, C.A., 2019. "A similarity based generalized modularity measure towards effective community discovery in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 527(C).
    5. Yong-Yeol Ahn & James P. Bagrow & Sune Lehmann, 2010. "Link communities reveal multiscale complexity in networks," Nature, Nature, vol. 466(7307), pages 761-764, August.
    6. Dong Wang & Jiexun Li & Kaiquan Xu & Yizhen Wu, 2017. "Sentiment community detection: exploring sentiments and relationships in social networks," Electronic Commerce Research, Springer, vol. 17(1), pages 103-132, March.
    7. Tao Zhou & Linyuan Lü & Yi-Cheng Zhang, 2009. "Predicting missing links via local information," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 71(4), pages 623-630, October.
    8. Andrea Lancichinetti & Filippo Radicchi & José J Ramasco & Santo Fortunato, 2011. "Finding Statistically Significant Communities in Networks," PLOS ONE, Public Library of Science, vol. 6(4), pages 1-18, April.
    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. Andreas Spitz & Anna Gimmler & Thorsten Stoeck & Katharina Anna Zweig & Emőke-Ágnes Horvát, 2016. "Assessing Low-Intensity Relationships in Complex Networks," PLOS ONE, Public Library of Science, vol. 11(4), pages 1-17, April.
    2. Gao, Yang & Zhang, Hongli & Zhang, Yue, 2019. "Overlapping communities from lines and triangles in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 455-466.
    3. Zhou, Wen & Jia, Yifan, 2017. "Predicting links based on knowledge dissemination in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 561-568.
    4. Eustace, Justine & Wang, Xingyuan & Cui, Yaozu, 2015. "Overlapping community detection using neighborhood ratio matrix," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 421(C), pages 510-521.
    5. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    6. Zhu, Zhen & Morrison, Greg & Puliga, Michelangelo & Chessa, Alessandro & Riccaboni, Massimo, 2018. "The similarity of global value chains: A network-based measure," Network Science, Cambridge University Press, vol. 6(4), pages 607-632, December.
    7. Chen, Ling-Jiao & Zhang, Zi-Ke & Liu, Jin-Hu & Gao, Jian & Zhou, Tao, 2017. "A vertex similarity index for better personalized recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 607-615.
    8. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2012. "Self-similar scaling of density in complex real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2794-2802.
    9. Najari, Shaghayegh & Salehi, Mostafa & Ranjbar, Vahid & Jalili, Mahdi, 2019. "Link prediction in multiplex networks based on interlayer similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    10. Liu, Chuang & Zhou, Wei-Xing, 2012. "Heterogeneity in initial resource configurations improves a network-based hybrid recommendation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(22), pages 5704-5711.
    11. Shenshen Bai & Longjie Li & Jianjun Cheng & Shijin Xu & Xiaoyun Chen, 2018. "Predicting Missing Links Based on a New Triangle Structure," Complexity, Hindawi, vol. 2018, pages 1-11, December.
    12. Liu, Shuxin & Ji, Xinsheng & Liu, Caixia & Bai, Yi, 2017. "Extended resource allocation index for link prediction of complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 174-183.
    13. Sherkat, Ehsan & Rahgozar, Maseud & Asadpour, Masoud, 2015. "Structural link prediction based on ant colony approach in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 80-94.
    14. Xia, Yongxiang & Pang, Wenbo & Zhang, Xuejun, 2021. "Mining relationships between performance of link prediction algorithms and network structure," Chaos, Solitons & Fractals, Elsevier, vol. 153(P2).
    15. Wu, Zhihao & Lin, Youfang & Wan, Huaiyu & Tian, Shengfeng & Hu, Keyun, 2012. "Efficient overlapping community detection in huge real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(7), pages 2475-2490.
    16. Qiaoran Yang & Zhiliang Dong & Yichi Zhang & Man Li & Ziyi Liang & Chao Ding, 2021. "Who Will Establish New Trade Relations? Looking for Potential Relationship in International Nickel Trade," Sustainability, MDPI, vol. 13(21), pages 1-15, October.
    17. Weihua Lei & Luiz G. A. Alves & Luís A. Nunes Amaral, 2022. "Forecasting the evolution of fast-changing transportation networks using machine learning," Nature Communications, Nature, vol. 13(1), pages 1-12, December.
    18. Sanda Martinčić-Ipšić & Edvin Močibob & Matjaž Perc, 2017. "Link prediction on Twitter," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-21, July.
    19. Assouli, Nora & Benahmed, Khelifa & Gasbaoui, Brahim, 2021. "How to predict crime — informatics-inspired approach from link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 570(C).
    20. Rafiee, Samira & Salavati, Chiman & Abdollahpouri, Alireza, 2020. "CNDP: Link prediction based on common neighbors degree penalization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).

    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:spr:elcore:v:21:y:2021:i:4:d:10.1007_s10660-019-09395-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.