Adaptive implicit friends identification over heterogeneous network for social recommendation

Junliang Yu, Min Gao, Jundong Li, Hongzhi Yin, Huan Liu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

The explicitly observed social relations from online social platforms have been widely incorporated into recommender systems to mitigate the data sparsity issue. However, the direct usage of explicit social relations may lead to an inferior performance due to the unreliability (e.g., noises) of observed links. To this end, the discovery of reliable relations among users plays a central role in advancing social recommendation. In this paper, we propose a novel approach to adaptively identify implicit friends toward discovering more credible user relations. Particularly, implicit friends are those who share similar tastes but could be distant from each other on the network topology of social relations. Methodologically, to find the implicit friends for each user, we first model the whole system as a heterogeneous information network, and then capture the similarity of users through the meta-path based embedding representation learning. Finally, based on the intuition that social relations have varying degrees of impact on different users, our approach adaptively incorporates different numbers of similar users as implicit friends for each user to alleviate the adverse impact of unreliable social relations for a more effective recommendation. Experimental analysis on three real-world datasets demonstrates the superiority of our method and explain why implicit friends are helpful in improving social recommendation.

Original languageEnglish (US)
Title of host publicationCIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management
EditorsNorman Paton, Selcuk Candan, Haixun Wang, James Allan, Rakesh Agrawal, Alexandros Labrinidis, Alfredo Cuzzocrea, Mohammed Zaki, Divesh Srivastava, Andrei Broder, Assaf Schuster
PublisherAssociation for Computing Machinery
Pages357-366
Number of pages10
ISBN (Electronic)9781450360142
DOIs
StatePublished - Oct 17 2018
Event27th ACM International Conference on Information and Knowledge Management, CIKM 2018 - Torino, Italy
Duration: Oct 22 2018Oct 26 2018

Other

Other27th ACM International Conference on Information and Knowledge Management, CIKM 2018
CountryItaly
CityTorino
Period10/22/1810/26/18

Fingerprint

Social relations
Information networks
Network topology
Intuition
Recommender systems
Experimental analysis

Keywords

  • Heterogeneous Networks
  • Implicit Friends
  • Social Networks
  • Social Recommender Systems

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Decision Sciences(all)

Cite this

Yu, J., Gao, M., Li, J., Yin, H., & Liu, H. (2018). Adaptive implicit friends identification over heterogeneous network for social recommendation. In N. Paton, S. Candan, H. Wang, J. Allan, R. Agrawal, A. Labrinidis, A. Cuzzocrea, M. Zaki, D. Srivastava, A. Broder, ... A. Schuster (Eds.), CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management (pp. 357-366). Association for Computing Machinery. https://doi.org/10.1145/3269206.3271725

Adaptive implicit friends identification over heterogeneous network for social recommendation. / Yu, Junliang; Gao, Min; Li, Jundong; Yin, Hongzhi; Liu, Huan.

CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. ed. / Norman Paton; Selcuk Candan; Haixun Wang; James Allan; Rakesh Agrawal; Alexandros Labrinidis; Alfredo Cuzzocrea; Mohammed Zaki; Divesh Srivastava; Andrei Broder; Assaf Schuster. Association for Computing Machinery, 2018. p. 357-366.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, J, Gao, M, Li, J, Yin, H & Liu, H 2018, Adaptive implicit friends identification over heterogeneous network for social recommendation. in N Paton, S Candan, H Wang, J Allan, R Agrawal, A Labrinidis, A Cuzzocrea, M Zaki, D Srivastava, A Broder & A Schuster (eds), CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. Association for Computing Machinery, pp. 357-366, 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy, 10/22/18. https://doi.org/10.1145/3269206.3271725
Yu J, Gao M, Li J, Yin H, Liu H. Adaptive implicit friends identification over heterogeneous network for social recommendation. In Paton N, Candan S, Wang H, Allan J, Agrawal R, Labrinidis A, Cuzzocrea A, Zaki M, Srivastava D, Broder A, Schuster A, editors, CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. Association for Computing Machinery. 2018. p. 357-366 https://doi.org/10.1145/3269206.3271725
Yu, Junliang ; Gao, Min ; Li, Jundong ; Yin, Hongzhi ; Liu, Huan. / Adaptive implicit friends identification over heterogeneous network for social recommendation. CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. editor / Norman Paton ; Selcuk Candan ; Haixun Wang ; James Allan ; Rakesh Agrawal ; Alexandros Labrinidis ; Alfredo Cuzzocrea ; Mohammed Zaki ; Divesh Srivastava ; Andrei Broder ; Assaf Schuster. Association for Computing Machinery, 2018. pp. 357-366
@inproceedings{276e546f689641938d322d9f274e44df,
title = "Adaptive implicit friends identification over heterogeneous network for social recommendation",
abstract = "The explicitly observed social relations from online social platforms have been widely incorporated into recommender systems to mitigate the data sparsity issue. However, the direct usage of explicit social relations may lead to an inferior performance due to the unreliability (e.g., noises) of observed links. To this end, the discovery of reliable relations among users plays a central role in advancing social recommendation. In this paper, we propose a novel approach to adaptively identify implicit friends toward discovering more credible user relations. Particularly, implicit friends are those who share similar tastes but could be distant from each other on the network topology of social relations. Methodologically, to find the implicit friends for each user, we first model the whole system as a heterogeneous information network, and then capture the similarity of users through the meta-path based embedding representation learning. Finally, based on the intuition that social relations have varying degrees of impact on different users, our approach adaptively incorporates different numbers of similar users as implicit friends for each user to alleviate the adverse impact of unreliable social relations for a more effective recommendation. Experimental analysis on three real-world datasets demonstrates the superiority of our method and explain why implicit friends are helpful in improving social recommendation.",
keywords = "Heterogeneous Networks, Implicit Friends, Social Networks, Social Recommender Systems",
author = "Junliang Yu and Min Gao and Jundong Li and Hongzhi Yin and Huan Liu",
year = "2018",
month = "10",
day = "17",
doi = "10.1145/3269206.3271725",
language = "English (US)",
pages = "357--366",
editor = "Norman Paton and Selcuk Candan and Haixun Wang and James Allan and Rakesh Agrawal and Alexandros Labrinidis and Alfredo Cuzzocrea and Mohammed Zaki and Divesh Srivastava and Andrei Broder and Assaf Schuster",
booktitle = "CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Adaptive implicit friends identification over heterogeneous network for social recommendation

AU - Yu, Junliang

AU - Gao, Min

AU - Li, Jundong

AU - Yin, Hongzhi

AU - Liu, Huan

PY - 2018/10/17

Y1 - 2018/10/17

N2 - The explicitly observed social relations from online social platforms have been widely incorporated into recommender systems to mitigate the data sparsity issue. However, the direct usage of explicit social relations may lead to an inferior performance due to the unreliability (e.g., noises) of observed links. To this end, the discovery of reliable relations among users plays a central role in advancing social recommendation. In this paper, we propose a novel approach to adaptively identify implicit friends toward discovering more credible user relations. Particularly, implicit friends are those who share similar tastes but could be distant from each other on the network topology of social relations. Methodologically, to find the implicit friends for each user, we first model the whole system as a heterogeneous information network, and then capture the similarity of users through the meta-path based embedding representation learning. Finally, based on the intuition that social relations have varying degrees of impact on different users, our approach adaptively incorporates different numbers of similar users as implicit friends for each user to alleviate the adverse impact of unreliable social relations for a more effective recommendation. Experimental analysis on three real-world datasets demonstrates the superiority of our method and explain why implicit friends are helpful in improving social recommendation.

AB - The explicitly observed social relations from online social platforms have been widely incorporated into recommender systems to mitigate the data sparsity issue. However, the direct usage of explicit social relations may lead to an inferior performance due to the unreliability (e.g., noises) of observed links. To this end, the discovery of reliable relations among users plays a central role in advancing social recommendation. In this paper, we propose a novel approach to adaptively identify implicit friends toward discovering more credible user relations. Particularly, implicit friends are those who share similar tastes but could be distant from each other on the network topology of social relations. Methodologically, to find the implicit friends for each user, we first model the whole system as a heterogeneous information network, and then capture the similarity of users through the meta-path based embedding representation learning. Finally, based on the intuition that social relations have varying degrees of impact on different users, our approach adaptively incorporates different numbers of similar users as implicit friends for each user to alleviate the adverse impact of unreliable social relations for a more effective recommendation. Experimental analysis on three real-world datasets demonstrates the superiority of our method and explain why implicit friends are helpful in improving social recommendation.

KW - Heterogeneous Networks

KW - Implicit Friends

KW - Social Networks

KW - Social Recommender Systems

UR - http://www.scopus.com/inward/record.url?scp=85058039991&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85058039991&partnerID=8YFLogxK

U2 - 10.1145/3269206.3271725

DO - 10.1145/3269206.3271725

M3 - Conference contribution

AN - SCOPUS:85058039991

SP - 357

EP - 366

BT - CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management

A2 - Paton, Norman

A2 - Candan, Selcuk

A2 - Wang, Haixun

A2 - Allan, James

A2 - Agrawal, Rakesh

A2 - Labrinidis, Alexandros

A2 - Cuzzocrea, Alfredo

A2 - Zaki, Mohammed

A2 - Srivastava, Divesh

A2 - Broder, Andrei

A2 - Schuster, Assaf

PB - Association for Computing Machinery

ER -