Enhancing Network Embedding with Auxiliary Information: An Explicit Matrix Factorization Perspective
Recent advances in the field of network embedding have shown the low-dimensional network representation is playing a critical role in network analysis. However, most of the existing principles of network embedding do not incorporate auxiliary information such as content and labels of nodes flexibly. In this paper, we take a matrix factorization perspective of network embedding, and incorporate structure, content and label information of the network simultaneously. For structure, we validate that the matrix we construct preserves high-order proximities of the network. Label information can be further integrated into the matrix via the process of random walk sampling to enhance the quality of embedding in an unsupervised manner, i.e., without leveraging downstream classifiers. In addition, we generalize the Skip-Gram Negative Sampling model to integrate the content of the network in a matrix factorization framework. As a consequence, network embedding can be learned in a unified framework integrating network structure and node content as well as label information simultaneously. We demonstrate the efficacy of the proposed model with the tasks of semi-supervised node classification and link prediction on a variety of real-world benchmark network datasets.
Code (2)
Tasks
Link PredictionNetwork EmbeddingNode ClassificationSimilar Papers 제목 키워드 기반
FOCUS: Effective Embedding Initialization for Monolingual Specialization of Multilingual Models
Using model weights pretrained on a high-resource language as a warm start can reduce the need for data and compute to obtain high-quality language models for other, especially low-resource, languages. However, if we wan…
Language ModelingLanguage ModellingNERSemantic Similarity+2Scaling Pre-trained Language Models to Deeper via Parameter-efficient Architecture
In this paper, we propose a highly parameter-efficient approach to scaling pre-trained language models (PLMs) to a deeper model depth. Unlike prior work that shares all parameters or uses extra blocks, we design a more c…
Matrix Completion via Factorizing Polynomials
Predicting unobserved entries of a partially observed matrix has found wide applicability in several areas, such as recommender systems, computational biology, and computer vision. Many scalable methods with rigorous the…
Matrix CompletionRecommendation SystemsMFAI: A Scalable Bayesian Matrix Factorization Approach to Leveraging Auxiliary Information
In various practical situations, matrix factorization methods suffer from poor data quality, such as high data sparsity and low signal-to-noise ratio (SNR). Here, we consider a matrix factorization problem by utilizing a…
Missing ValuesVariational InferenceAuxiliary Label Embedding for Multi-label Learning with Missing Labels
Label correlation has been exploited for multi-label learning in different ways. Existing approaches presume that label correlation information is available as a prior, but for multi-label datasets having incomplete labe…
Missing LabelsMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONMulti-Label Learning