Customized Graph Embedding: Tailoring Embedding Vectors to different Applications
원문 초록
Graph is a natural representation of data for a variety of real-word applications, such as knowledge graph mining, social network analysis and biological network comparison. For these applications, graph embedding is crucial as it provides vector representations of the graph. One limitation of existing graph embedding methods is that their embedding optimization procedures are disconnected from the target application. In this paper, we propose a novel approach, namely Customized Graph Embedding (CGE) to tackle this problem. The CGE algorithm learns customized vector representations of graph nodes by differentiating the importance of distinct graph paths automatically for a specific application. Extensive experiments were carried out on a diverse set of node classification datasets, which demonstrate strong performances of CGE and provide deep insights into the model.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Correlation-Aware Graph Convolutional Networks for Multi-Label Node Classification
Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks
Towards Unbiased Federated Graph Learning: Label and Topology Perspectives
FHGE: A Fast Heterogeneous Graph Embedding with Ad-hoc Meta-paths
Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining
토론
이 논문과 연결된 포럼 글이 아직 없습니다.