motif2vec: Motif Aware Node Representation Learning for Heterogeneous Networks
Recent years have witnessed a surge of interest in machine learning on graphs and networks with applications ranging from vehicular network design to IoT traffic management to social network recommendations. Supervised machine learning tasks in networks such as node classification and link prediction require us to perform feature engineering that is known and agreed to be the key to success in applied machine learning. Research efforts dedicated to representation learning, especially representation learning using deep learning, has shown us ways to automatically learn relevant features from vast amounts of potentially noisy, raw data. However, most of the methods are not adequate to handle heterogeneous information networks which pretty much represents most real-world data today. The methods cannot preserve the structure and semantic of multiple types of nodes and links well enough, capture higher-order heterogeneous connectivity patterns, and ensure coverage of nodes for which representations are generated. We propose a novel efficient algorithm, motif2vec that learns node representations or embeddings for heterogeneous networks. Specifically, we leverage higher-order, recurring, and statistically significant network connectivity patterns in the form of motifs to transform the original graph to motif graph(s), conduct biased random walk to efficiently explore higher order neighborhoods, and then employ heterogeneous skip-gram model to generate the embeddings. Unlike previous efforts that uses different graph meta-structures to guide the random walk, we use graph motifs to transform the original network and preserve the heterogeneity. We evaluate the proposed algorithm on multiple real-world networks from diverse domains and against existing state-of-the-art methods on multi-class node classification and link prediction tasks, and demonstrate its consistent superiority over prior work.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningFeature EngineeringLink PredictionManagementNode ClassificationRepresentation LearningSimilar Papers 제목 키워드 기반
Molecular Representation Learning via Heterogeneous Motif Graph Neural Networks
We consider feature representation learning problem of molecular graphs. Graph Neural Networks have been widely used in feature representation learning of molecular graphs. However, most existing methods deal with molecu…
graph constructionGraph Neural NetworkGraph Representation Learningmolecular representation+2Learning node representation via Motif Coarsening
Motifs, as fundamental units of the graph, play a significant role in modeling complex systems in a variety of domains, including social networks, as well as biology and neuroscience. Motif preservation is a widely studi…
Graph Representation LearningRepresentation LearningMolformer: Motif-based Transformer on 3D Heterogeneous Molecular Graphs
Procuring expressive molecular representations underpins AI-driven molecule design and scientific discovery. The research mainly focuses on atom-level homogeneous molecular graphs, ignoring the rich information in subgra…
3D geometrygraph constructionscientific discoveryTranslationMotif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning
Graphs are typical non-Euclidean data of complex structures. In recent years, Riemannian graph representation learning has emerged as an exciting alternative to Euclidean ones. However, Riemannian methods are still in an…
Contrastive LearningGraph Neural NetworkGraph Representation LearningRepresentation LearningMotif Enhanced Recommendation over Heterogeneous Information Network
Heterogeneous Information Networks (HIN) has been widely used in recommender systems (RSs). In previous HIN-based RSs, meta-path is used to compute the similarity between users and items. However, existing meta-path base…
Recommendation Systems