[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Direction-Aware User Recommendation Based on Asymmetric Network Embedding

Published: 16 November 2021 Publication History

Abstract

User recommendation aims at recommending users with potential interests in the social network. Previous works have mainly focused on the undirected social networks with symmetric relationship such as friendship, whereas recent advances have been made on the asymmetric relationship such as the following and followed by relationship. Among the few existing direction-aware user recommendation methods, the random walk strategy has been widely adopted to extract the asymmetric proximity between users. However, according to our analysis on real-world directed social networks, we argue that the asymmetric proximity captured by existing random walk based methods are insufficient due to the inbalance in-degree and out-degree of nodes.
To tackle this challenge, we propose InfoWalk, a novel informative walk strategy to efficiently capture the asymmetric proximity solely based on random walks. By transferring the direction information into the weights of each step, InfoWalk is able to overcome the limitation of edges while simultaneously maintain both the direction and proximity. Based on the asymmetric proximity captured by InfoWalk, we further propose the qualitative (DNE-L) and quantitative (DNE-T) directed network embedding methods, capable of preserving the two properties in the embedding space. Extensive experiments conducted on six real-world benchmark datasets demonstrate the superiority of the proposed DNE model over several state-of-the-art approaches in various tasks.

References

[1]
Rianne van den Berg, Thomas N. Kipf, and Max Welling. 2017. Graph convolutional matrix completion. arXiv:1706.02263.
[2]
Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2015. GraRep: Learning graph representations with global structural information. In Proceedings of the 24th ACM International Conference on Information and Knowledge Management.
[3]
Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2016. Deep neural networks for learning graph representations. In Proceedings of the 30th AAAI Conference on Artificial Intelligence.
[4]
Sandro Cavallari, Vincent W. Zheng, Hongyun Cai, Kevin Chen-Chuan Chang, and Erik Cambria. 2017. Learning community embedding with community detection and node embedding on graphs. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. ACM, New York, NY, 377–386.
[5]
Shiyu Chang, Wei Han, Jiliang Tang, Guo-Jun Qi, Charu C. Aggarwal, and Thomas S. Huang. 2015. Heterogeneous network embedding via deep architectures. In Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[6]
Jiawei Chen, Hande Dong, Xiang Wang, Fuli Feng, Meng Wang, and Xiangnan He. 2020. Bias and debias in recommender system: A survey and future directions. arXiv:2010.03240.
[7]
Jiawei Chen, Yan Feng, Martin Ester, Sheng Zhou, Chun Chen, and Can Wang. 2018. Modeling users’ exposure with social knowledge influence and consumption influence for recommendation. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 953–962.
[8]
Jiawei Chen, Chengquan Jiang, Can Wang, Sheng Zhou, Yan Feng, Chun Chen, Martin Ester, and Xiangnan He. 2020. CoSam: An efficient collaborative adaptive sampler for recommendation. arXiv:2011.07739.
[9]
Jiawei Chen, Can Wang, Qihao Shi, Yan Feng, and Chun Chen. 2019. Social recommendation based on users’ attention and preference. Neurocomputing 341 (2019), 1–9.
[10]
Jiawei Chen, Can Wang, Sheng Zhou, Qihao Shi, Yan Feng, and Chun Chen. 2019. SamWalker: Social recommendation with informative sampling strategy. In Proceedings of the World Wide Web Conference. 228–239.
[11]
Daizong Ding, Mi Zhang, Shao-Yuan Li, Jie Tang, Xiaotie Chen, and Zhi-Hua Zhou. 2017. BayDNN: Friend recommendation with Bayesian personalized ranking deep neural network. In Proceedings of the 2017 ACM Conference on Information and Knowledge Management. 1479–1488.
[12]
Wenqi Fan, Qing Li, and Min Cheng. 2018. Deep modeling of social relations for recommendation. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI’18). 8075–8076.
[13]
Wenqi Fan, Yao Ma, Qing Li, Yuan He, Eric Zhao, Jiliang Tang, and Dawei Yin. 2019. Graph neural networks for social recommendation. In Proceedings of the World Wide Web Conference. 417–426.
[14]
Jun Feng, Minlie Huang, Yang Yang, and Xiaoyan Zhu. 2016. GAKE: Graph aware knowledge embedding. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers. 641–651.
[15]
Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[16]
Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems.
[17]
John Hannon, Mike Bennett, and Barry Smyth. 2010. Recommending Twitter users to follow using content and collaborative filtering approaches. In Proceedings of the 4th ACM Conference on Recommender Systems. 199–206.
[18]
Sepp Hochreiter and Jürgen Schmidhuber. 1997. Long short-term memory. Neural Computation 9, 8 (1997), 1735–1780.
[19]
Shangrong Huang, Jian Zhang, Lei Wang, and Xian-Sheng Hua. 2015. Social friend recommendation based on multiple network correlation. IEEE Transactions on Multimedia 18, 2 (2015), 287–299.
[20]
Xiao Huang, Jundong Li, and Xia Hu. 2017. Label informed attributed network embedding. In Proceedings of the 10th ACM International Conference on Web Search and Data Mining. ACM, New York, NY, 731–739.
[21]
Matthew O. Jackson and Alison Watts. 2002. The evolution of social and economic networks. Journal of Economic Theory 106, 2 (2002), 265–295.
[22]
Mohsen Jamali and Martin Ester. 2009. TrustWalker: A random walk model for combining trust-based and item-based recommendation. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 397–406.
[23]
Leo Katz. 1953. A new status index derived from sociometric analysis. Psychometrika 18, 1 (1953), 39–43.
[24]
Mohammad Mehdi Keikha, Maseud Rahgozar, and Masoud Asadpour. 2018. Community aware random walk for network embedding. Knowledge-Based Systems 148 (2018), 47–54.
[25]
Megha Khosla, Jurek Leonhardt, Wolfgang Nejdl, and Avishek Anand. 2018. Node representation learning for directed graphs. arXiv:1810.09176.
[26]
Junghwan Kim, Haekyu Park, Ji-Eun Lee, and U. Kang. 2018. Side: Representation learning in signed directed networks. In Proceedings of the 2018 World Wide Web Conference.
[27]
Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv:1609.02907.
[28]
Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. 2010. Predicting positive and negative links in online social networks. In Proceedings of the 19th International Conference on World Wide Web. 641–650.
[29]
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney. 2009. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics 6, 1 (2009), 29–123.
[30]
Nan Li and Guanling Chen. 2009. Multi-layered friendship modeling for location-based mobile social networks. In Proceedings of the 2009 6th Annual International Mobile and Ubiquitous Systems: Networking and Services, MobiQuitous. IEEE, Los Alamitos, CA, 1–10.
[31]
Shuchuan Lo and Chingching Lin. 2006. WMR—A graph-based algorithm for friend recommendation. In Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings) (WI’06). IEEE, Los Alamitos, CA, 121–128.
[32]
Tiancheng Lou, Jie Tang, John Hopcroft, Zhanpeng Fang, and Xiaowen Ding. 2013. Learning to predict reciprocity and triadic closure in social networks. ACM Transactions on Knowledge Discovery from Data 7, 2 (2013), 1–25.
[33]
Hao Ma, Haixuan Yang, Michael R. Lyu, and Irwin King. 2008. SoRec: Social recommendation using probabilistic matrix factorization. In Proceedings of the 17th ACM Conference on Information and Knowledge Management. 931–940.
[34]
Ramanujam Madhavan and Mohit Wadhwa. 2020. Directed graph representation through vector cross product. arXiv:2010.10737.
[35]
Donna Katzman McClish. 1989. Analyzing a portion of the ROC curve. Medical Decision Making 9, 3 (1989), 190–195.
[36]
Federico Monti, Michael Bronstein, and Xavier Bresson. 2017. Geometric matrix completion with recurrent multi-graph neural networks. In Advances in Neural Information Processing Systems. 3697–3707.
[37]
Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, and Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[38]
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. DeepWalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[39]
Jiezhong Qiu, Yuxiao Dong, Hao Ma, Jian Li, Kuansan Wang, and Jie Tang. 2018. Network embedding as matrix factorization: Unifying DeepWalk, LINE, PTE, and node2vec. In Proceedings of the 11th ACM International Conference on Web Search and Data Mining.
[40]
Dimitrios Rafailidis and Fabio Crestani. 2018. Friend recommendation in location-based social networks via deep pairwise learning. In Proceedings of the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM’18). IEEE, Los Alamitos, CA, 421–428.
[41]
Matthew Richardson, Rakesh Agrawal, and Pedro Domingos. 2003. Trust management for the Semantic Web. In Proceedings of the International Semantic Web Conference.
[42]
Guillaume Salha, Stratis Limnios, Romain Hennequin, Viet-Anh Tran, and Michalis Vazirgiannis. 2019. Gravity-inspired graph autoencoders for directed link prediction. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. 589–598.
[43]
Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI Magazine 29, 3 (2008), 93.
[44]
Nitai B. Silva, Ren Tsang, George D. C. Cavalcanti, and Jyh Tsang. 2010. A graph-based friend recommendation system using genetic algorithm. In Proceedings of the IEEE Congress on Evolutionary Computation. IEEE, Los Alamitos, CA, 1–7.
[45]
Jiankai Sun, Bortik Bandyopadhyay, Armin Bashizade, Jiongqian Liang, P. Sadayappan, and Srinivasan Parthasarathy. 2018. ATP: Directed graph embedding with asymmetric transitivity preservation. arXiv:1811.00839.
[46]
Jiliang Tang, Xia Hu, and Huan Liu. 2013. Social recommendation: A review. Social Network Analysis and Mining 3, 4 (2013), 1113–1133.
[47]
Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. LINE: Large-scale information network embedding. In Proceedings of the 24th International Conference on World Wide Web.
[48]
Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv:1710.10903.
[49]
Shengxian Wan, Yanyan Lan, Jiafeng Guo, Chaosheng Fan, and Xueqi Cheng. 2013. Informational friend recommendation in social media. In Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval. 1045–1048.
[50]
Can Wang, Jiawei Chen, Sheng Zhou, Qihao Shi, Yan Feng, and Chun Chen. 2020. SamWalker++: Recommendation with informative sampling strategy. arXiv:2011.07734.
[51]
Daixin Wang, Peng Cui, and Wenwu Zhu. 2016. Structural deep network embedding. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
[52]
Suhang Wang, Charu Aggarwal, Jiliang Tang, and Huan Liu. 2017. Attributed signed network embedding. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 137–146.
[53]
Suhang Wang, Jiliang Tang, Charu Aggarwal, Yi Chang, and Huan Liu. 2017. Signed network embedding in social media. In Proceedings of the 2017 SIAM International Conference on Data Mining.
[54]
Xiao Wang, Peng Cui, Jing Wang, Jian Pei, Wenwu Zhu, and Shiqiang Yang. 2017. Community preserving network embedding. In Proceedings of the 31st AAAI Conference on Artificial Intelligence.
[55]
Xiang Wang, Xiangnan He, Liqiang Nie, and Tat-Seng Chua. 2017. Item silk road: Recommending items from information domains to social users. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval. 185–194.
[56]
Xin Wang, Wei Lu, Martin Ester, Can Wang, and Chun Chen. 2016. Social recommendation with strong and weak ties. In Proceedings of the 25th ACM International Conference on Information and Knowledge Management. 5–14.
[57]
Xin Wang, Wenwu Zhu, and Chenghao Liu. 2019. Social recommendation with optimal limited attention. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1518–1527.
[58]
Bo Yang, Yu Lei, Jiming Liu, and Wenjie Li. 2016. Social collaborative filtering by trust. IEEE Transactions on Pattern Analysis and Machine Intelligence 39, 8 (2016), 1633–1647.
[59]
Yuan Yin and Zhewei Wei. 2019. Scalable graph embeddings via sparse transpose proximities. arXiv:1905.07245.
[60]
Rex Ying, Ruining He, Kaifeng Chen, Pong Eksombatchai, William L. Hamilton, and Jure Leskovec. 2018. Graph convolutional neural networks for web-scale recommender systems. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 974–983.
[61]
Shuhan Yuan, Xintao Wu, and Yang Xiang. 2017. SNE: Signed network embedding. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining. 183–195.
[62]
Yutao Zhang, Jie Tang, Zhilin Yang, Jian Pei, and Philip S. Yu. 2015. COSNET: Connecting heterogeneous social networks with local and global consistency. In Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1485–1494.
[63]
Fen Zhao, Yi Zhang, and Jianguo Lu. 2021. ShortWalk: An approach to network embedding on directed graphs. Social Network Analysis and Mining 11, 1 (2021), 1–12.
[64]
Chang Zhou, Yuqiong Liu, Xiaofei Liu, Zhongyi Liu, and Jun Gao. 2017. Scalable graph embedding for asymmetric proximity. In Proceedings of the 31st AAAI Conference on Artificial Intelligence.
[65]
Sheng Zhou, Xin Wang, Jiajun Bu, Martin Ester, Pinggang Yu, Jiawei Chen, Qihao Shi, and Can Wang. 2020. DGE: Deep generative network embedding based on commonality and individuality. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34. 6949–6956.
[66]
Sheng Zhou, Hongxia Yang, Xin Wang, Jiajun Bu, Martin Ester, Pinggang Yu, Jianwei Zhang, and Can Wang. 2018. PRRE: Personalized relation ranking embedding for attributed networks. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management.

Cited By

View all
  • (2024)Random-Walk-Based or Similarity-Based Methods, Which is Better for Directed Graph Embedding?2024 IEEE International Conference on Big Data and Smart Computing (BigComp)10.1109/BigComp60711.2024.00022(83-89)Online publication date: 18-Feb-2024
  • (2023)A Multi-Modal Profiling Fraud-Detection System for Capturing Suspicious Airline Ticket ActivitiesApplied Sciences10.3390/app13241312113:24(13121)Online publication date: 9-Dec-2023
  • (2023)ELTRA: An Embedding Method based on Learning-to-Rank to Preserve Asymmetric Information in Directed GraphsProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614862(2116-2125)Online publication date: 21-Oct-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Information Systems
ACM Transactions on Information Systems  Volume 40, Issue 2
April 2022
587 pages
ISSN:1046-8188
EISSN:1558-2868
DOI:10.1145/3484931
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 November 2021
Accepted: 01 May 2021
Revised: 01 May 2021
Received: 01 November 2020
Published in TOIS Volume 40, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. User recommendation
  2. random walk
  3. graph neural networks

Qualifiers

  • Research-article
  • Refereed

Funding Sources

  • National Key Research and Development Program
  • National Natural Science Foundation of China
  • NSERC Discovery
  • Alibaba-Zhejiang University Joint Institute of Frontier Technologies

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)30
  • Downloads (Last 6 weeks)4
Reflects downloads up to 13 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Random-Walk-Based or Similarity-Based Methods, Which is Better for Directed Graph Embedding?2024 IEEE International Conference on Big Data and Smart Computing (BigComp)10.1109/BigComp60711.2024.00022(83-89)Online publication date: 18-Feb-2024
  • (2023)A Multi-Modal Profiling Fraud-Detection System for Capturing Suspicious Airline Ticket ActivitiesApplied Sciences10.3390/app13241312113:24(13121)Online publication date: 9-Dec-2023
  • (2023)ELTRA: An Embedding Method based on Learning-to-Rank to Preserve Asymmetric Information in Directed GraphsProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614862(2116-2125)Online publication date: 21-Oct-2023
  • (2023)Free Energy Node Embedding via Generalized Skip-Gram With Negative SamplingIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.320617535:8(8024-8036)Online publication date: 1-Aug-2023
  • (2022)Adversarial Auto-encoder Domain Adaptation for Cold-start Recommendation with Positive and Negative HypergraphsACM Transactions on Information Systems10.1145/354410541:2(1-25)Online publication date: 21-Dec-2022
  • (2022)SAME: Sampling Attack in Multiplex Network EmbeddingAdvanced Data Mining and Applications10.1007/978-3-031-22137-8_25(337-351)Online publication date: 30-Nov-2022

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media