Research Article

Network Embedding For Link Prediction in Bipartite Networks

Number: 27 November 30, 2021
EN TR

Network Embedding For Link Prediction in Bipartite Networks

Abstract

Many social networks have a bipartite nature. Link prediction in social networks has been the focus of interest for many researchers recently. Network embedding, which maps each node in the network to a low-dimensional feature vector is used to solve many problems. The aim of this study is to investigate how network embedding enhance the link prediction performance in bipartite networks. A network embedding and a supervised learning based link prediction model has been presented for bipartite networks. The input of the supervised learning model is learned embedding vectors of node pairs obtained from network embedding method. The target feature of prediction is a binary label indicating the existence or absence of a link between these node pairs. Ensemble learning algorithms have been applied for supervised link prediction. The experiments performed on two bipartite social networks built from public datasets led promising results with 0.939 and 0.974 AUC values. Random Forest models trained with embedding vectors obtained from BiNE method achieved the highest performances.

Keywords

References

  1. Breiman, L. (2001). 2001 4_Method_Random_Forest. Machine Learning.
  2. Bütün, E., Kaya, M., & Alhajj, R. (2018). Extension of neighbor-based link prediction methods for directed, weighted and temporal social networks. Information Sciences, 463–464, 152–165. https://doi.org/10.1016/j.ins.2018.06.051
  3. Chen, T., & Guestrin, C. (2016). XGBoost: A scalable tree boosting system. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. https://doi.org/10.1145/2939672.2939785
  4. Erdem, E., & Bozkurt, F. (2021). A comparison of various supervised machine learning techniques for prostate cancer prediction. Avrupa Bilim ve Teknoloji Dergisi, 21, 610–620.
  5. Fawcett, T. (2006). An introduction to ROC analysis. Pattern recognition letters, 27(8), 861-874.
  6. Gao, M., He, X., Chen, L., Liu, T., Zhang, J., & Zhou, A. (2018). Learning Vertex Representations for Bipartite Networks. 1–14.
  7. Goodreads. (2021). https://www.goodreads.com/
  8. Gori, M., & Pucci, A. (2007). ItemRank: A random-walk based scoring algorithm for recommender engines. IJCAI International Joint Conference on Artificial Intelligence, 2766–2771.

Details

Primary Language

English

Subjects

Engineering

Journal Section

Research Article

Publication Date

November 30, 2021

Submission Date

May 22, 2021

Acceptance Date

August 25, 2021

Published in Issue

Year 1970 Number: 27

APA
Kart, Ö. (2021). Network Embedding For Link Prediction in Bipartite Networks. Avrupa Bilim Ve Teknoloji Dergisi, 27, 311-317. https://doi.org/10.31590/ejosat.937722