IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2023i1p362-d1310936.html
   My bibliography  Save this article

An E-Commerce Personalized Recommendation Algorithm Based on Multiple Social Relationships

Author

Listed:
  • Sheng Bin

    (College of Computer Science & Technology, Qingdao University, Qingdao 266071, China)

Abstract

Environmental e-commerce is a sustainability-oriented e-commerce model. To address the problem of data sparsity and the lack of diversity in traditional e-commerce recommendation algorithms, a new collaborative filtering recommendation algorithm based on multiple social relationships is proposed in environmental e-commerce. In real social networks, there were many relationships between users. On the basis of the traditional matrix decomposition model, the proposed algorithm integrates multiple social relationships between users into the user feature matrix, and then the multiple social relationships between users and the user rating preference similarity were used to jointly predict the user’s rating value for commodity, thus the personalized recommendation for users was achieved. In order to verify the superiority of the proposed algorithm, in this paper, two open datasets were used to compare the performance of several recommendation algorithms. The experimental results show that compared with the traditional social recommendation algorithms, the proposed algorithm improves recommendation accuracy and diversity. In real environmental e-commerce recommendation systems, the proposed algorithm can provide users with more personalized recommendation results, and reduce the arbitrariness of customer purchases and frequent returns in reality.

Suggested Citation

  • Sheng Bin, 2023. "An E-Commerce Personalized Recommendation Algorithm Based on Multiple Social Relationships," Sustainability, MDPI, vol. 16(1), pages 1-17, December.
  • Handle: RePEc:gam:jsusta:v:16:y:2023:i:1:p:362-:d:1310936
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/1/362/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/16/1/362/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sheng Bin & Gengxin Sun, 2021. "Matrix Factorization Recommendation Algorithm Based on Multiple Social Relationships," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-8, February.
    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.

      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:gam:jsusta:v:16:y:2023:i:1:p:362-:d:1310936. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.