From Node Embedding to Graph Embedding: Scalable Global Graph Kernel via Random Features
Graph kernels are one of the most important methods for graph data analysis and have been successfully applied in diverse applications. We can generally categorize existing graph kernels into two groups: kernels based on local sub-structures, and kernels based on global properties. The first line of research compares sub-structures of graphs such as random walks, shortest paths, and graphlets. Specifically, these kernels recursively decompose the graphs into small sub-structures, and then define a feature map over these sub-structures for the resulting graph kernel. However, the aforementioned approaches only consider local patterns rather than global properties, which may substantially limit effectiveness in some applications. Equally importantly, most of these graph kernels scale poorly to large graphs due to their at-least-quadratic complexity in the number of graphs and cubic complexity in the size of each graph.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph EmbeddingSimilar Papers 제목 키워드 기반
A Multi-purposed Unsupervised Framework for Comparing Embeddings of Undirected and Directed Graphs
Graph embedding is a transformation of nodes of a network into a set of vectors. A good embedding should capture the underlying graph topology and structure, node-to-node relationship, and other relevant information abou…
Graph EmbeddingScalable Global Alignment Graph Kernel Using Random Features: From Node Embedding to Graph Embedding
Graph kernels are widely used for measuring the similarity between graphs. Many existing graph kernels, which focus on local patterns within graphs rather than their global properties, suffer from significant structure i…
Graph ClassificationGraph EmbeddingLocal Distance-Preserving Node Embeddings and Their Performance on Random Graphs
Learning node representations is a fundamental problem in graph machine learning. While existing embedding methods effectively preserve local similarity measures, they often fail to capture global functions like graph di…
Graph Representation LearningRepresentation LearningRiskSEA : A Scalable Graph Embedding for Detecting On-chain Fraudulent Activities on the Ethereum Blockchain
Like any other useful technology, cryptocurrencies are sometimes used for criminal activities. While transactions are recorded on the blockchain, there exists a need for a more rapid and scalable method to detect address…
Graph EmbeddingScalable and Adaptive Spectral Embedding for Attributed Graph Clustering
Attributed graph clustering, which aims to group the nodes of an attributed graph into disjoint clusters, has made promising advancements in recent years. However, most existing methods face challenges when applied to la…
ClusteringGraph Clustering