BiANE: Bipartite Attributed Network Embedding

Network embedding effectively transforms complex network data into a low-dimensional vector space and has shown great performance in many real-world scenarios, such as link prediction, node classification, and similarity search. A plethora of methods have been proposed to learn node representations and achieve encouraging results. Nevertheless, little attention has been paid on the embedding technique for bipartite attributed networks, which is a typical data structure for modeling nodes from two distinct partitions. In this paper, we propose a novel model called BiANE, short forBipartite Attributed Network Embedding. In particular, BiANE not only models the inter-partition proximity but also models the intra-partition proximity. To effectively preserve the intra-partition proximity, we jointly model the attribute proximity and the structure proximity through a novel latent correlation training approach. Furthermore, we propose a dynamic positive sampling technique to overcome the efficiency drawbacks of the existing dynamic negative sampling techniques. Extensive experiments have been conducted on several real-world networks, and the results demonstrate that our proposed approach can significantly outperform state-of-the-art methods.

[1]  Xiao Huang,et al.  Accelerated Attributed Network Embedding , 2017, SDM.

[2]  Minyi Guo,et al.  GraphGAN: Graph Representation Learning with Generative Adversarial Nets , 2017, AAAI.

[3]  Yuchen Li,et al.  Influence Maximization on Social Graphs: A Survey , 2018, IEEE Transactions on Knowledge and Data Engineering.

[4]  Heng Huang,et al.  Deep Attributed Network Embedding , 2018, IJCAI.

[5]  Jason Weston,et al.  Translating Embeddings for Modeling Multi-relational Data , 2013, NIPS.

[6]  Wenwu Zhu,et al.  Structural Deep Network Embedding , 2016, KDD.

[7]  Lei Chen,et al.  NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding , 2018, 2019 IEEE 35th International Conference on Data Engineering (ICDE).

[8]  Lars Schmidt-Thieme,et al.  BPR: Bayesian Personalized Ranking from Implicit Feedback , 2009, UAI.

[9]  Laizhong Cui,et al.  Social Influence Does Matter: User Action Prediction for In-Feed Advertising , 2020, AAAI.

[10]  Tat-Seng Chua,et al.  Neural Graph Collaborative Filtering , 2019, SIGIR.

[11]  Xiangnan He,et al.  Attributed Social Network Embedding , 2017, IEEE Transactions on Knowledge and Data Engineering.

[12]  Mingzhe Wang,et al.  LINE: Large-scale Information Network Embedding , 2015, WWW.

[13]  Nicholas Jing Yuan,et al.  Little Is Much: Bridging Cross-Platform Behaviors through Overlapped Crowds , 2016, AAAI.

[14]  Chiara Carusi,et al.  A look at interdisciplinarity using bipartite scholar/journal networks , 2019, Scientometrics.

[15]  Rong Pan,et al.  Incorporating GAN for Negative Sampling in Knowledge Representation Learning , 2018, AAAI.

[16]  Ming Gao,et al.  Learning Vertex Representations for Bipartite Networks , 2019, ArXiv.

[17]  Alán Aspuru-Guzik,et al.  Convolutional Networks on Graphs for Learning Molecular Fingerprints , 2015, NIPS.

[18]  Jure Leskovec,et al.  node2vec: Scalable Feature Learning for Networks , 2016, KDD.

[19]  Chao Liu,et al.  Recommender systems with social regularization , 2011, WSDM '11.

[20]  Nitesh V. Chawla,et al.  metapath2vec: Scalable Representation Learning for Heterogeneous Networks , 2017, KDD.

[21]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[22]  Wang-Chien Lee,et al.  HIN2Vec: Explore Meta-paths in Heterogeneous Information Networks for Representation Learning , 2017, CIKM.

[23]  Jiajun Bu,et al.  ANRL: Attributed Network Representation Learning via Deep Neural Networks , 2018, IJCAI.

[24]  Quoc V. Le,et al.  Distributed Representations of Sentences and Documents , 2014, ICML.

[25]  Yoshua Bengio,et al.  Understanding the difficulty of training deep feedforward neural networks , 2010, AISTATS.

[26]  Xiaoling Wang,et al.  Local Weighted Matrix Factorization for Top-n Recommendation with Implicit Feedback , 2017, Data Science and Engineering.

[27]  Heng-Tze Cheng,et al.  Wide & Deep Learning for Recommender Systems , 2016, DLRS@RecSys.

[28]  Weinan Zhang,et al.  Improving Negative Sampling for Word Representation using Self-embedded Features , 2017, WSDM.

[29]  Domonkos Tikk,et al.  Alternating least squares for personalized ranking , 2012, RecSys.

[30]  Xiangliang Zhang,et al.  WalkRanker: A Unified Pairwise Ranking Model With Multiple Relations for Item Recommendation , 2018, AAAI.

[31]  Geoffrey E. Hinton,et al.  Semantic hashing , 2009, Int. J. Approx. Reason..

[32]  Fan Yang,et al.  Large-Scale Heterogeneous Feature Embedding , 2019, AAAI.

[33]  Irwin King,et al.  STAR-GCN: Stacked and Reconstructed Graph Convolutional Networks for Recommender Systems , 2019, IJCAI.

[34]  Max Welling,et al.  Semi-Supervised Classification with Graph Convolutional Networks , 2016, ICLR.

[35]  Jie Tang,et al.  ArnetMiner: extraction and mining of academic social networks , 2008, KDD.

[36]  Ju Fan,et al.  Maximizing Multifaceted Network Influence , 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE).

[37]  Diyi Yang,et al.  Serendipitous Personalized Ranking for Top-N Recommendation , 2012, 2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

[38]  Kevin Chen-Chuan Chang,et al.  Heterogeneous Embedding Propagation for Large-Scale E-Commerce User Alignment , 2018, 2018 IEEE International Conference on Data Mining (ICDM).

[39]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[40]  Yunming Ye,et al.  DeepFM: A Factorization-Machine based Neural Network for CTR Prediction , 2017, IJCAI.

[41]  Jun Wang,et al.  Optimizing top-n collaborative filtering via dynamic negative item sampling , 2013, SIGIR.

[42]  H. Stanley,et al.  Cascading Failures in Bi-partite Graphs: Model for Systemic Risk Propagation , 2012, Scientific Reports.

[43]  Peng Zhang,et al.  IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models , 2017, SIGIR.

[44]  Anantharaman Kalyanaraman,et al.  Detecting Communities in Biological Bipartite Networks , 2016, BCB.

[45]  Yury A. Malkov,et al.  Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[46]  Ming Gao,et al.  BiNE: Bipartite Network Embedding , 2018, SIGIR.

[47]  Chunxiao Xing,et al.  Link Prediction for Bipartite Social Networks: The Role of Structural Holes , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[48]  Yueting Zhuang,et al.  Heterogeneous Attributed Network Embedding with Graph Convolutional Networks , 2019, AAAI.

[49]  Jeffrey Dean,et al.  Distributed Representations of Words and Phrases and their Compositionality , 2013, NIPS.

[50]  Heng Huang,et al.  Self-Paced Network Embedding , 2018, KDD.

[51]  Max Welling,et al.  Graph Convolutional Matrix Completion , 2017, ArXiv.