IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v507y2018icp99-109.html
   My bibliography  Save this article

Analysis on large-scale rating systems based on the signed network

Author

Listed:
  • Gu, Ke
  • Fan, Ying
  • Zeng, An
  • Zhou, Jianlin
  • Di, Zengru

Abstract

In many user–object online rating systems, it is obviously that the ratings usually show the users’ attitudes: like or dislike the objects. Inevitably there is a need to introduce the sign into the rating systems. We first focus on how to construct signed bipartite networks on rating systems and reveal the basic properties of them. We also analyze the basic motif of signed bipartite networks: quadrangle. Then we introduce a novel projection method Signed Common Neighbors (SCN) to get the projection to signed user-network. The basic statistics of the projections show that SCN can well reflect the roles of negative edges.

Suggested Citation

  • Gu, Ke & Fan, Ying & Zeng, An & Zhou, Jianlin & Di, Zengru, 2018. "Analysis on large-scale rating systems based on the signed network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 507(C), pages 99-109.
    • Handle: RePEc:eee:phsmap:v:507:y:2018:i:c:p:99-109
    DOI: 10.1016/j.physa.2018.05.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118305922
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2018.05.048?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. Liu, Xiao-Lu & Liu, Jian-Guo & Yang, Kai & Guo, Qiang & Han, Jing-Ti, 2017. "Identifying online user reputation of user–object bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 467(C), pages 508-516.
    2. Zhang, Peng & Wang, Jinliang & Li, Xiaojia & Li, Menghui & Di, Zengru & Fan, Ying, 2008. "Clustering coefficient and community structure of bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(27), pages 6869-6875.
    3. Li, Le & Gu, Ke & Zeng, An & Fan, Ying & Di, Zengru, 2018. "Modeling online social signed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 495(C), pages 345-352.
    4. Hao Liao & An Zeng & Rui Xiao & Zhuo-Ming Ren & Duan-Bing Chen & Yi-Cheng Zhang, 2014. "Ranking Reputation and Quality in Online Rating Systems," PLOS ONE, Public Library of Science, vol. 9(5), pages 1-7, May.
    5. 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.
    6. Li, Menghui & Fan, Ying & Chen, Jiawei & Gao, Liang & Di, Zengru & Wu, Jinshan, 2005. "Weighted networks of scientific communication: the measurement and topological role of weight," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 350(2), pages 643-656.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gu, Ke & Fan, Ying & Di, Zengru, 2020. "How to predict recommendation lists that users do not like," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    2. Zhang, Peng & Song, Xiaoyu & Xue, Leyang & Gu, Ke, 2019. "A new recommender algorithm on signed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 317-321.

    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. Chen, Ling-Jiao & Gao, Jian, 2018. "A trust-based recommendation method using network diffusion processes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 679-691.
    2. 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.
    3. Wu, Ying-Ying & Guo, Qiang & Liu, Jian-Guo & Zhang, Yi-Cheng, 2018. "Effect of the initial configuration for user–object reputation systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 502(C), pages 288-294.
    4. Cui, Yaozu & Wang, Xingyuan, 2016. "Detecting one-mode communities in bipartite networks by bipartite clustering triangular," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 307-315.
    5. Liao, Hao & Zeng, An & Zhang, Yi-Cheng, 2015. "Predicting missing links via correlation between nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 216-223.
    6. Sun, Hong-liang & Ch’ng, Eugene & Yong, Xi & Garibaldi, Jonathan M. & See, Simon & Chen, Duan-bing, 2018. "A fast community detection method in bipartite networks by distance dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 108-120.
    7. Wei, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    8. Ramadiah, Amanah & Caccioli, Fabio & Fricke, Daniel, 2020. "Reconstructing and stress testing credit networks," Journal of Economic Dynamics and Control, Elsevier, vol. 111(C).
    9. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    10. Park, Jinhee & Ahn, Hyeongjin & Kim, Dongjae & Park, Eunil, 2024. "GNN-IR: Examining graph neural networks for influencer recommendations in social media marketing," Journal of Retailing and Consumer Services, Elsevier, vol. 78(C).
    11. Shang, Ronghua & Zhang, Weitong & Jiao, Licheng & Stolkin, Rustam & Xue, Yu, 2017. "A community integration strategy based on an improved modularity density increment for large-scale networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 471-485.
    12. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    13. 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.
    14. Gu, Ke & Fan, Ying & Di, Zengru, 2020. "How to predict recommendation lists that users do not like," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    15. Ricardo S. Santos & Jose Soares & Pedro Carmona Marques & Helena V. G. Navas & José Moleiro Martins, 2021. "Integrating Business, Social, and Environmental Goals in Open Innovation through Partner Selection," Sustainability, MDPI, vol. 13(22), pages 1-25, November.
    16. 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.
    17. 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.
    18. 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).
    19. 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.
    20. 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.

    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:phsmap:v:507:y:2018:i:c:p:99-109. 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.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.