Fast Sequence Based Embedding with Diffusion Graphs
A graph embedding is a representation of the vertices of a graph in a low dimensional space, which approximately preserves proper-ties such as distances between nodes. Vertex sequence based embedding procedures use features extracted from linear sequences of vertices to create embeddings using a neural network. In this paper, we propose diffusion graphs as a method to rapidly generate vertex sequences for network embedding. Its computational efficiency is superior to previous methods due to simpler sequence generation, and it produces more ac-curate results. In experiments, we found that the performance relative to other methods improves with increasing edge density in the graph.In a community detection task, clustering nodes in the embedding space produces better results compared to other sequence based embedding methods.
Code (2)
Tasks
ClusteringCommunity DetectionComputational EfficiencyGraph EmbeddingNetwork EmbeddingNode ClassificationSimilar Papers 제목 키워드 기반
Fast Sequence-Based Embedding with Diffusion Graphs
A graph embedding is a representation of graph vertices in a low-dimensional space, which approximately preserves properties such as distances between nodes. Vertex sequence-based embedding procedures use features extrac…
ClusteringCommunity DetectionComputational EfficiencyGraph Embedding+1Digraphwave: Scalable Extraction of Structural Node Embeddings via Diffusion on Directed Graphs
Structural node embeddings, vectors capturing local connectivity information for each node in a graph, have many applications in data mining and machine learning, e.g., network alignment and node classification, clusteri…
Anomaly DetectionNode ClassificationGraph VQ-Transformer (GVT): Fast and Accurate Molecular Generation via High-Fidelity Discrete Latents
The de novo generation of molecules with desirable properties is a critical challenge, where diffusion models are computationally intensive and autoregressive models struggle with error propagation. In this work, we intr…
Graph GenerationTowards Fast Graph Generation via Autoregressive Noisy Filtration Modeling
Graph generative models often face a critical trade-off between learning complex distributions and achieving fast generation speed. We introduce Autoregressive Noisy Filtration Modeling (ANFM), a novel approach that addr…
Graph GenerationTopological Data AnalysisEmbedding Directed Graphs in Potential Fields Using FastMap-D
Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problems posed on undirected graphs. However, E…