DANE adapts network embeddings across multiple domains.
problem Learning embeddings for multiple networks without transferability.
method Graph Convolutional Network with adversarial learning.
result DANE achieves superior performance in cross-network domain adaptation.
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…
Compositional Network Embedding learns node embeddings from node features.
problem Cold-start problem and lack of robustness to noise in existing network embedding methods.
method Generative framework that combines node attribute embeddings through a graph-based loss.
result Effectiveness and generalization of compositional network embeddings, especially on unseen nodes.
A framework for stable dynamic network embeddings using static methods.
problem Dynamic network embedding in a nascent field.
method Using static network embedding methods on dilated unfolded adjacency matrices.
result Stable embeddings that preserve latent node behavior across time.
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.
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.
A new method learns text network embeddings by combining generative autoencoder and homophilic priors.
problem Improving performance of network learning applications, especially for textual networks.
method Variational Homophilic Embedding (VHE) - a fully generative model that optimizes a variational autoencoder for semantic information and a homophilic prior for structural information.
result VHE outperforms existing methods in various tasks on real-world textual networks.
AUASE embeds dynamic networks with stability guarantees for node comparison.
problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.
A network embedding consists of a vector representation for each node in the network. Its usefulness has been shown in many real-world application domains, such as social networks and web networks. Directed networks with text associated with each node, such as software package dependency networks, are commonplace. Howe…
New method detects and analyzes correlation in multiple network data.
problem Detecting and analyzing correlation in multiple network data.
method Generalized omnibus embedding methodology.
result Induced correlation can significantly extend the reach of spectral inference procedures.
Privacy attacks reveal hidden information in network embeddings after node removal.
problem Privacy concerns in network embeddings after node deletion.
method Analyzed network embeddings and developed an attack to recover removed node information.
result Significant information about removed node's neighbors can be retrieved from remaining embeddings.
New method learns dynamic node embeddings from temporal networks.
problem Temporal networks' temporal information is often ignored or approximated.
method Continuous-time dynamic network embeddings (CTDNEs) using temporal walks.
result CTDNEs achieve an average gain of 11.9% in AUC across all methods and graphs.
In this paper, we study the problem of author identification under double-blind review setting, which is to identify potential authors given information of an anonymized paper. Different from existing approaches that rely heavily on feature engineering, we propose to use network embedding approach to address the proble…
Proposes a block-based model for attributed network embedding.
problem Handles both assortative and disassortative networks.
method Assigns nodes to blocks based on similar linkage patterns, using neural networks to preserve attribute information.
result Consistently outperforms state-of-the-art methods on disassortative networks.
A novel method captures both micro- and macro-dynamics in temporal networks.
problem Capturing both micro- and macro-dynamics in temporal networks.
method Temporal Attention Point Process for micro-dynamics and a dynamics equation for macro-dynamics.
result Significantly outperforms state-of-the-arts in temporal tendency-related tasks.
Advances deep network embedding through multi-filtering GCN.
problem Existing attribute embedding methods fail to capture different aspects of node features.
method Multi-filtering Graph Convolution Neural Network (GCN) framework.
result Significant improvement in link prediction and node classification tasks with limited training data.
A new method for document network embedding interprets and generalizes well.
problem Lack of interpretability and generalization to new documents in existing methods.
method Introduces Topic-Word Attention (TWA) and Inductive Document Network Embedding (IDNE) to generate document representations.
result Achieves state-of-the-art performance on various networks and produces meaningful representations.
Proposes VCLANC for attributed network clustering using node and attribute embeddings.
problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.
The paper examines how different fusion strategies in neural networks affect user embeddings and their quality.
problem The need for automated processing of user data, particularly in predicting ratings and estimating user similarity.
method Analyzed the effect of various fusion strategies in neural networks on user embeddings quality and prediction performance.
result Fusion strategies in neural networks affect both embedding quality and prediction performance, and prediction performance does not necessarily reflect embedding quality.
Models use embeddings and attention for better claim severity prediction.
problem Improving predictive modeling of claim severity with categorical data.
method Developed neural networks and attention-based architectures with embeddings.
result Attention-based models enhance predictive performance with contextual augmentation.
Unified framework for hyperbolic network embedding considering multiplex interactions.
problem Misleading results from ignoring multiplex interactions in real-world networks.
method Combines multiplex network hyperbolic embedding and community detection using random walk.
result Effective and efficient node embedding across multiplex channels compared to state-of-the-art.
New embeddings capture local structure in complex networks.
problem Embeddings cannot capture local structure in complex networks.
method Logistic Principal Component Analysis (LPCA) algorithm for exact low-rank representations.
result Exact low-rank representations of real-world networks are possible.
Network embedding represents nodes in a continuous vector space and preserves structure information from the Network. Existing methods usually adopt a "one-size-fits-all" approach when concerning multi-scale structure information, such as first- and second-order proximity of nodes, ignoring the fact that different scal…
Adversarial training improves network embedding models.
problem Noisy information and overfitting in network embedding.
method Adversarial training with L2 norm constraint and discrete graph reconstruction. result Improved robustness and generalization performance in link prediction and node classification.
New method for embedding large networks without attributes, achieving state-of-the-art performance.
problem Learning embeddings from large-scale networks without domain-dependent attributes.
method Use predefined local encodings based on node degree frequencies at different distances.
result Inductive network embeddings generalize well across unseen or distant regions in the network.
This paper describes a general framework for learning Higher-Order Network Embeddings (HONE) from graph data based on network motifs. The HONE framework is highly expressive and flexible with many interchangeable components. The experimental results demonstrate the effectiveness of learning higher-order network represe…
NetSMF efficiently embeds large networks by sparse matrix factorization.
problem Learning latent representations for large-scale networks efficiently.
method NetSMF leverages spectral sparsification to efficiently sparsify and factorize a dense matrix.
result NetSMF achieves high efficiency and effectiveness on large-scale networks.
EPNE models evolving network patterns for better predictions.
problem Capturing evolving patterns in dynamic networks.
method EPNE models temporal network evolution using causal convolutions and a temporal objective function.
result EPNE outperforms other methods in various prediction tasks.
A framework for network embedding using VDS principles.
problem Challenges in systematically studying network embedding algorithms.
method Veridical Data Science (VDS) framework applied to network embedding.
result Potential for new research directions in network embedding.
This paper studies node embeddings of networks, revealing their geometric properties.
problem Understanding the geometric properties of node embeddings in random networks.
method Characterization of ergodic limits, generalization, and convex relaxations of random walk node embedding objectives.
result The optimal node embedding Grammians have rank 1 for a nuclear norm relaxation of the non-randomized objective.
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.
G-CREWE efficiently aligns large networks using node embeddings and compression.
problem Efficiently aligning large networks for various applications.
method Uses node embeddings and compression to align networks at fine and coarse resolutions.
result G-CREWE achieves efficient and accurate network alignment, twice as fast as existing methods.
Friend recommendation system using heterogeneous edge embeddings.
problem Inadequate performance of existing network embedding techniques on multi-graph social networks.
method Proposes a method to mine network representation exploiting heterogeneity in multi-graphs.
result Outperforms state-of-the-art baselines on Hike's social network in terms of accuracy and user satisfaction.
ActiveHNE improves HNE performance by using supervised information effectively.
problem Challenges in heterogeneous network embedding due to diverse node types and relationships.
method Develops ActiveHNE framework with DHNE and AQHN components, using graph convolutional neural network and multi-armed bandit mechanism.
result Demonstrates effectiveness and reduction in query cost compared to existing methods.
Paper proposes DMGD for integrating outlier and community detection in graph embedding.
problem Outlier nodes affect graph embedding of regular nodes, especially in networks with multiple communities.
method DMGD integrates outlier and community detection with node embedding using multiclass graph description.
result DMGD detects outliers relative to their communities and achieves better node embedding compared to state-of-the-arts.
Recent advances in the field of network embedding have shown the low-dimensional network representation is playing a critical role in network analysis. However, most of the existing principles of network embedding do not incorporate auxiliary information such as content and labels of nodes flexibly. In this paper, we t…
Recent successes in word embedding and document embedding have motivated researchers to explore similar representations for networks and to use such representations for tasks such as edge prediction, node label prediction, and community detection. Such network embedding methods are largely focused on finding distribute…
Network embedding methodologies, which learn a distributed vector representation for each vertex in a network, have attracted considerable interest in recent years. Existing works have demonstrated that vertex representation learned through an embedding method provides superior performance in many real-world applicatio…
New method uses MHN for associative learning in network embedding.
problem Represent nodes in networks as low-dimensional vectors while incorporating topological and structural information.
method Introduces Modern Hopfield Networks (MHN) for associative learning between node content and neighbors.
result Competitive performance on node classification and linkage prediction tasks.
A new method for embedding heterogeneous networks using spacey random walks.
problem Stationarity issues in meta-path guided random walks for HIN embedding.
method Heterogeneous personalized spacey random walk.
result Substantial improvement over existing network embedding algorithms.
Two novel methods improve network embedding for completely-imbalanced labels.
problem Improving network embedding for networks with completely-imbalanced labels.
method Two novel semi-supervised network embedding methods: RSDNE and RECT.
result Experimental results show the superiority of the proposed methods.
Unified model for signed networks separates balance and anomaly effects.
problem Ignoring sign information in signed networks leads to inaccurate analysis.
method Low rank plus sparse matrix decomposition with regularized formulation.
result The model accurately detects communities and anomalies in signed networks.
Most existing word embedding approaches do not distinguish the same words in different contexts, therefore ignoring their contextual meanings. As a result, the learned embeddings of these words are usually a mixture of multiple meanings. In this paper, we acknowledge multiple identities of the same word in different co…
BIGUE algorithm provides credible intervals for hyperbolic network embeddings.
problem Uncertainty in hyperbolic network embeddings.
method Markov chain Monte Carlo (MCMC) algorithm for Bayesian hyperbolic random graph model.
result Samples from the posterior distribution provide credible intervals for hyperbolic coordinates and network properties.
Proposes RNNE for dynamic network embedding.
problem Handling dynamic networks with changing node and edge counts.
method Recurrent Neural Network Embedding (RNNE) for topologically evolving graphs and temporal graphs.
result RNNE outperforms state-of-the-art algorithms in network reconstruction, classification, and link prediction.
This paper improves spectral embedding for multipartite networks, revealing latent subspaces and providing consistent node representations.
problem Improving spectral embedding for multipartite networks to better represent node types.
method Developed a follow-on step to spectral embedding that recovers node representations in their intrinsic rather than ambient dimension, proving consistency under a specific model.
result Node representations in multipartite networks lie near type-specific subspaces, and the proposed method recovers these representations consistently.
A new method for fast graph embedding using diffusion graphs.
problem Efficiently generating graph embeddings for large networks.
method Diffusion graphs for rapid vertex sequence generation.
result Improved accuracy and performance with higher edge density.
AN2VEC disentangles feature and structural information in social networks.
problem Difficulty in separating feature and structural information in social networks.
method Graph Convolutional Networks (GCN) Variational Autoencoder for disentangled node embeddings.
result AN2VEC captures joint information of structure and features better than unshared information.