A survey on graph representation learning methods
Graph representation learning has been a very active research area in recent years. The
goal of graph representation learning is to generate graph representation vectors that …
goal of graph representation learning is to generate graph representation vectors that …
Constrained social community recommendation
In online social networks, users with similar interests tend to come together, forming social
communities. Nowadays, user-defined communities become a prominent part of online …
communities. Nowadays, user-defined communities become a prominent part of online …
Efficient and effective edge-wise graph representation learning
Graph representation learning (GRL) is a powerful tool for graph analysis, which has gained
massive attention from both academia and industry due to its superior performance in …
massive attention from both academia and industry due to its superior performance in …
Personalized pagerank on evolving graphs with an incremental index-update scheme
\em Personalized PageRank (PPR) stands as a fundamental proximity measure in graph
mining. Given an input graph G with the probability of decay α, a source node s and a target …
mining. Given an input graph G with the probability of decay α, a source node s and a target …
Geltor: A graph embedding method based on listwise learning to rank
Similarity-based embedding methods have introduced a new perspective on graph
embedding by conforming the similarity distribution of latent vectors in the embedding space …
embedding by conforming the similarity distribution of latent vectors in the embedding space …
Learned sketch for subgraph counting: a holistic approach
Subgraph counting, as a fundamental problem in network analysis, is to count the number of
subgraphs in a data graph that match a given query graph by either homomorphism or …
subgraphs in a data graph that match a given query graph by either homomorphism or …
Grarep++: flexible learning graph representations with weighted global structural information
M Ouyang, Y Zhang, X **a, X Xu - IEEE Access, 2023 - ieeexplore.ieee.org
The key to vertex embedding is to learn low-dimensional representations of global graph
information, and integrating information from multiple steps is an effective strategy. Existing …
information, and integrating information from multiple steps is an effective strategy. Existing …
Cross-graph embedding with trainable proximity for graph alignment
Graph alignment, also known as network alignment, has many applications in data mining
tasks. It aims to find the node correspondence across disjoint graphs. With recent …
tasks. It aims to find the node correspondence across disjoint graphs. With recent …
Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs
Subset embedding is the task to learn low-dimensional representations for a subset of
nodes according to the graph topology. It has applications when we focus on a subset of …
nodes according to the graph topology. It has applications when we focus on a subset of …
Graph neural network for higher-order dependency networks
Graph neural network (GNN) has become a popular tool to analyze the graph data. Existing
GNNs only focus on networks with first-order dependency, that is, conventional networks …
GNNs only focus on networks with first-order dependency, that is, conventional networks …