The paper analyzes DeepWalk and node2vec for community detection in stochastic blockmodels.
problem Theoretical understanding of community detection in stochastic blockmodels.
method Matrix factorization perspective on DeepWalk and node2vec.
result Node2vec and DeepWalk can perfectly recover community memberships in sparse graphs.
Node2vec embeddings are unstable and unstable with parameter choices.
problem Stability and robustness of node2vec embeddings for graph classification.
method Analysis of node2vec embeddings from multiple perspectives.
result Node2vec embeddings are unstable with respect to parameter choices.
Enhances graph embeddings by preserving graph topology.
problem Node2vec struggles to recreate the topology of input graphs.
method Introduces a topological loss term to Node2vec, aligning the persistence diagram of the embedding to that of the input graph.
result Reconstructs both geometry and topology of input graphs.
The paper examines node2vec embeddings for community detection in networks.
problem Theoretical understanding of node2vec embeddings for community detection.
method Analysis of node2vec embeddings for community recovery in stochastic block models.
result k-means clustering on node2vec embeddings gives weakly consistent community recovery for stochastic block models.
Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning ap…
FCA2VEC embeds formal concept analysis data for large datasets.
problem Embedding formal concept analysis data for large datasets.
method Introducing fca2vec, a family of embedding techniques for formal concept analysis.
result Retrieves cover relation of a concept lattice from a computational feasible embedding.
This paper analyzes DeepWalk and node2vec for community detection in large networks.
problem Community detection in large, sparse networks.
method Low-dimensional network embedding algorithms (DeepWalk and node2vec) applied to random walk segments.
result The performance of DeepWalk and node2vec in recovering communities depends on the length of random walk segments and sparsity of the network.
ARGEW improves node embeddings for weighted homophilous graphs by emphasizing strong edge weights.
problem Lack of accurate node embeddings for weighted homophilous graphs.
method ARGEW (Augmentation of Random walks by Graph Edge Weights) augments random walks by emphasizing nodes with larger edge weights.
result ARGEW produces embeddings where node pairs with strong edge weights have closer embeddings.
The paper studies how adding an ℓ2 penalty affects network embeddings.
problem The impact of ℓ2 regularization on network embeddings.
method Analyzes the asymptotic behavior of ℓ2 regularized node2vec embeddings under graphon theory.
result The learned embeddings asymptotically form a graphon with a nuclear-norm-type penalty.
Since the invention of word2vec, the skip-gram model has significantly advanced the research of network embedding, such as the recent emergence of the DeepWalk, LINE, PTE, and node2vec approaches. In this work, we show that all of the aforementioned models with negative sampling can be unified into the matrix factoriza…
Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…
A new method identifies similar mutual funds using graph learning.
problem Identifying similar mutual funds with nuanced portfolio similarities.
method Node2Vec machine learning method applied to a weighted bipartite network of funds and assets.
result Identifies structural similarity among mutual funds' portfolios.
Method constructs hedging portfolio for carbon risk but not ESG risk.
problem Hedging carbon risk with ESG risk.
method Triangulated Maximally Filtered Graph and node2vec algorithms.
result Efficient hedging portfolio strategy for carbon risk but not ESG risk.
Hybrid approach combines topic and graph embeddings for legal document clustering.
problem Challenges in classifying legal texts due to domain-specific language and limited labeled data.
method Combines unsupervised topic and graph embeddings with a supervised model.
result Improves clustering quality over text-only or graph-only embeddings.
We unify subsampling methods for network embeddings and prove their asymptotic distribution.
problem Understanding and improving the performance of network embeddings learned via subsampling.
method Unified framework for node2vec-like methods, proving asymptotic distribution under exchangeable graph assumption.
result Asymptotic distribution of learned embedding vectors decouples and provides rates of convergence.
Network embedding converts network data into vectors for machine learning.
problem Machine learning tasks on networks require vector representations of nodes and links.
method Various unsupervised and supervised methods for converting network data into vectors.
result Network embedding methods aim to preserve network structure in learned feature representations.
Network embedding helps predict speed limits on incomplete Danish road network.
problem Incomplete speed limit data on Danish roads limits machine learning applications.
method Applied node2vec network embedding to Danish road network.
result Network embedding can derive useful features for predicting speed limits.
Proposes a CNN-based method for better trajectory owner prediction.
problem Improves trajectory owner prediction for better personalized recommendations and urban planning.
method Connects POIs in a graph, encodes POIs into vectors, transforms trajectories into matrices, and uses a CNN to detect features and predict owners.
result Significantly outperforms existing methods in various metrics.
Graphs (networks) are ubiquitous and allow us to model entities (nodes) and the dependencies (edges) between them. Learning a useful feature representation from graph data lies at the heart and success of many machine learning tasks such as classification, anomaly detection, link prediction, among many others. Many exi…
Deep models store facts in geometric embeddings, not just associative memory.
problem Understanding how deep models store and utilize atomic facts.
method Identified geometric memory, contrasting with associative lookup.
result Geometric memory transforms hard reasoning into easy tasks.
Algorithm learns stock correlation matrix embedding using graph machine learning.
problem Understanding complex relationships among stocks based on their correlation matrix.
method Proposes a graph machine learning approach called Node2Vec to compress the correlation network into an embedding.
result The algorithm can learn an embedding from the correlation network of S&P 500 stock data.
In this work, we study value function approximation in reinforcement learning (RL) problems with high dimensional state or action spaces via a generalized version of representation policy iteration (RPI). We consider the limitations of proto-value functions (PVFs) at accurately approximating the value function in low d…
This work shows dimension regularization can replace skip-gram negative sampling for graph embeddings, improving efficiency and performance.
problem Efficiently enforcing dissimilarity among node embeddings in graph learning.
method Dimension regularization as an alternative to skip-gram negative sampling.
result Dimension regularization is a more efficient approach to enforcing dissimilarity in graph embeddings.
The paper explores theories behind graph and relational data vector embeddings.
problem Understanding the foundations of vector embeddings for graphs and relational structures.
method Proposes two theoretical approaches to understand vector embeddings.
result Draws connections between various embedding techniques and suggests future research directions.
InstantEmbedding efficiently generates node representations with less computation and memory.
problem Efficiently generating local node representations for large graphs.
method Local PageRank computations in sublinear time.
result Significantly faster and less memory-intensive than traditional methods.
Recent years have witnessed a widespread increase of interest in network representation learning (NRL). By far most research efforts have focused on NRL for homogeneous networks like social networks where vertices are of the same type, or heterogeneous networks like knowledge graphs where vertices (and/or edges) are of…
Random walks are at the heart of many existing network embedding methods. However, such algorithms have many limitations that arise from the use of random walks, e.g., the features resulting from these methods are unable to transfer to new nodes and graphs as they are tied to vertex identity. In this work, we introduce…
Random walks are at the heart of many existing deep learning algorithms for graph data. However, such algorithms have many limitations that arise from the use of random walks, e.g., the features resulting from these methods are unable to transfer to new nodes and graphs as they are tied to node identity. In this work, …
Proposes CXNs for neural network computations on cell complexes.
problem Performing neural network computations on complex topological spaces.
method Introduces a message passing scheme and a unified encoder-decoder framework for cell complexes.
result Generalizes message passing to cell complexes and provides a cell2vec representation.
Study finds significant instability in node embeddings due to randomness.
problem Stability of node embeddings under random variations.
method Evaluated five node embedding algorithms (HOPE, LINE, node2vec, SDNE, GraphSAGE) on synthetic and empirical graphs.
result Significant instability in embedding spaces and downstream task accuracy.
DeepWalk embeddings converge on SBM graphs, recovering cluster structure.
problem Theoretical guarantees for DeepWalk embeddings on complex graphs.
method Solving a nonconvex optimization problem using random walks.
result DeepWalk embeddings on SBM graphs recover cluster structure with high probability.
Predicting event attendance using social influence from social networks.
problem Predicting people's participation in real-world events.
method Modeling social influence, using non-geotagged posts and social group structures, applying graph embedding techniques, and training a neural network.
result The proposed classifier achieves 89% accuracy on the VFestival dataset, outperforming state-of-the-art methods.
Unsupervised node embedding methods (e.g., DeepWalk, LINE, and node2vec) have attracted growing interests given their simplicity and effectiveness. However, although these methods have been proved effective in a variety of applications, none of the existing work has analyzed the robustness of them. This could be very r…
State2vec improves RL by learning state embeddings that generalize across policies.
problem Inefficient generalization across policies in RL.
method Extends node2vec to learn state embeddings accounting for discounted future state transitions.
result Captures the geometry of the state space, leading to sample-efficient value function approximation.
CrossWalk enhances fairness in graph algorithms by biasing random walks.
problem Fairness in machine learning systems applied to graphs.
method Bias random walks to cross group boundaries by upweighting edges.
result Enhances fairness in various graph algorithms with minimal performance loss.
This paper debiases KG embeddings by filtering sensitive attributes.
problem Social and cultural biases in KG representations.
method Exploring and filtering popularity and gender biases in KGE.
result Sensitivity of KG embeddings to sensitive attributes like gender.
New research shows graph embeddings fail to capture key network properties.
problem Graph embeddings fail to capture salient properties of complex networks.
method Mathematical proof and empirical study of various embedding techniques.
result Any successful graph embedding must have a rank nearly linear in the number of vertices.
Unified taxonomy for graph representation learning.
problem Lack of unified understanding and integration of graph representation learning methods.
method Proposes a Graph Encoder Decoder Model (GRAPHEDM) to unify graph neural networks, network embedding, and graph regularization.
result Unified taxonomy and Graph Encoder Decoder Model (GRAPHEDM) for graph representation learning.
Many applications today, such as NLP, network analysis, and code analysis, rely on semantically embedding objects into low-dimensional fixed-length vectors. Such embeddings naturally provide a way to perform useful downstream tasks, such as identifying relations among objects or predicting objects for a given context, …
Electronic health record (EHR) systems are used extensively throughout the healthcare domain. However, data interchangeability between EHR systems is limited due to the use of different coding standards across systems. Existing methods of mapping coding standards based on manual human experts mapping, dictionary mappin…
Study competition in OTC CDS market through CCP and interdealer choice models.
problem Analyze competition dynamics in OTC credit default swap market.
method Developed models for CCP choice and interdealer counterpart selection using semi-supervised learning and game theory.
result Introduced novel metrics and algorithms for understanding market dynamics.