IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5864545.html
   My bibliography  Save this article

Friend Recommender System for Social Networks Based on Stacking Technique and Evolutionary Algorithm

Author

Listed:
  • Aida Ghorbani
  • Amir Daneshvar
  • Ladan Riazi
  • Reza Radfar
  • Shahzad Sarfraz

Abstract

In recent years, social networks have made significant progress and the number of people who use them to communicate is increasing day by day. The vast amount of information available on social networks has led to the importance of using friend recommender systems to discover knowledge about future communications. It is challenging to choose the best machine learning approach to address the recommender system issue since there are several strategies with various benefits and drawbacks. In light of this, a solution based on the stacking approach was put out in this study to provide a buddy recommendation system in social networks. Additionally, a decrease in system performance was caused by the large amount of information that was accessible and the inefficiency of some functions. To solve this problem, a particle swarm optimization (PSO) algorithm to select the most efficient features was used in our proposed method. To learn the model in the objective function of the particle swarm algorithm, a hybrid system based on stacking is proposed. In this method, two random forests and Extreme Gradient Boosting (XGBoost) had been used as the base classifiers. The results obtained from these base classifiers were used in the logistic regression algorithm, which has been applied sequentially. The suggested approach was able to effectively address this issue by combining the advantages of the applied strategies. The results of implementation and evaluation of the proposed system show the appropriate efficiency of this method compared with other studied techniques.

Suggested Citation

  • Aida Ghorbani & Amir Daneshvar & Ladan Riazi & Reza Radfar & Shahzad Sarfraz, 2022. "Friend Recommender System for Social Networks Based on Stacking Technique and Evolutionary Algorithm," Complexity, Hindawi, vol. 2022, pages 1-11, August.
  • Handle: RePEc:hin:complx:5864545
    DOI: 10.1155/2022/5864545
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2022/5864545.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2022/5864545.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/5864545?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
    ---><---

    More about this item

    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:hin:complx:5864545. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.