An Ad-hoc graph node vector embedding algorithm for general knowledge graphs using Kinetica-Graph

2024-07-22 · B. Kaan Karamete, Eli Glaser

This paper discusses how to generate general graph node embeddings from knowledge graph representations. The embedded space is composed of a number of sub-features to mimic both local affinity and remote structural relevance. These sub-feature dimensions are defined by several indicators that we speculate to catch nodal similarities, such as hop-based topological patterns, the number of overlapping labels, the transitional probabilities (markov-chain probabilities), and the cluster indices computed by our recursive spectral bisection (RSB) algorithm. These measures are flattened over the one dimensional vector space into their respective sub-component ranges such that the entire set of vector similarity functions could be used for finding similar nodes. The error is defined by the sum of pairwise square differences across a randomly selected sample of graph nodes between the assumed embeddings and the ground truth estimates as our novel loss function. The ground truth is estimated to be a combination of pairwise Jaccard similarity and the number of overlapping labels. Finally, we demonstrate a multi-variate stochastic gradient descent (SGD) algorithm to compute the weighing factors among sub-vector spaces to minimize the average error using a random sampling logic.

📄 PDF Abstract BibTeX arXiv:2407.15906

Code (0)

등록된 구현이 없습니다.

Tasks

General Knowledge Knowledge Graphs

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Fast Computation of Generalized Eigenvectors for Manifold Graph Embedding

2021-12-15 · Fei Chen, Gene Cheung, Xue Zhang

Our goal is to efficiently compute low-dimensional latent coordinates for nodes in an input graph -- known as graph embedding -- for subsequent data processing such as clustering. Focusing on finite graphs that are inter…

Clustering Graph Embedding

COLOGNE: Coordinated Local Graph Neighborhood Sampling

2021-02-09 · Konstantin Kutzkov

Representation learning for graphs enables the application of standard machine learning algorithms and data analysis tools to graph data. Replacing discrete unordered objects such as graph nodes by real-valued vectors is…

BIG-bench Machine Learning Interpretable Machine Learning Representation Learning

Node Centralities and Classification Performance for Characterizing Node Embedding Algorithms

2018-02-18 · Kento Nozawa, Masanari Kimura, Atsunori Kanemura

Embedding graph nodes into a vector space can allow the use of machine learning to e.g. predict node classes, but the study of node embedding algorithms is immature compared to the natural language processing field becau…

BIG-bench Machine Learning Classification General Classification

DEEP GEOMETRICAL GRAPH CLASSIFICATION

2019-05-01 · ICLR 2019 5 · Mostafa Rahmani, Ping Li

Most of the existing Graph Neural Networks (GNNs) are the mere extension of the Convolutional Neural Networks (CNNs) to graphs. Generally, they consist of several steps of message passing between the nodes followed by a …

Classification Clustering General Classification Graph Classification+2

Evaluating Node Embeddings of Complex Networks

2021-02-16 · Arash Dehghan-Kooshkghazi, Bogumił Kamiński, Łukasz Kraiński, Paweł Prałat 외

Graph embedding is a transformation of nodes of a graph into a set of vectors. A~good embedding should capture the graph topology, node-to-node relationship, and other relevant information about the graph, its subgraphs,…

Community Detection Graph Embedding Link Prediction Node Classification