Highly accurate classification of network categories achieved.
problem Distinguishing between different types of networks (e.g., social vs. web graphs).
method Used a random forest classifier on both real-world and synthetic networks.
result Achieved a 94.2% classification accuracy.
Optimizes control interventions in real-world networks using deep-learning and network science.
problem Optimizing control over socioeconomic networks subject to constraints.
method Integrates optimization tools from deep-learning with network science.
result Characterizes vulnerability of corporate networks to takeovers.
DRL optimizes complex mobile networks with imperfect info.
problem Optimizing mobile networks with scarce data and complex dynamics.
method Sim-to-Real framework using graph CNN, domain randomization, multi-task learning, and self-play.
result First successful transfer of DRL from simulation to real-world mobile networks.
DeepMNE learns multi-network node features for better classification.
problem Learning node features across multiple networks.
method Semisupervised autoencoder for multi-network topology.
result DeepMNE outperforms state-of-the-art methods in node classification.
HyperGCN applies graph convolutional networks to hypergraphs for complex network learning.
problem Learning with complex relationships in hypergraphs.
method Proposes HyperGCN, a novel GCN for hypergraph semi-supervised learning.
result Demonstrates HyperGCN's effectiveness on real-world hypergraphs.
cube2net efficiently constructs query-specific networks using data cube technology.
problem Efficiency bottlenecks in network mining for specific queries.
method Data cube organization and reinforcement learning for query-specific network construction.
result cube2net outperforms existing methods in efficiency and effectiveness.
The paper identifies network bottlenecks using minimax paths in stochastic networks.
problem Identifying bottlenecks in networks with stochastic weights.
method Modeling as combinatorial semi-bandit problem, applying combinatorial Thompson Sampling, and approximating the original objective due to computational intractability.
result Established an upper bound on Bayesian regret and evaluated Thompson Sampling performance on real-world networks.
Predicts path failures in evolving networks using deep learning.
problem Predicting path failures in time-evolving graphs.
method LRGCN, SAPE
result LRGCN outperforms other methods in path failure prediction.
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.
Unified model detects local and global changes in dynamic networks.
problem Detecting both local and global changes in complex dynamical networks.
method Proposes a unified generative model based on MMSB with SGLD sampler.
result Superior performance on synthetic and real-world data.
Synthetic social networks closely match real-world interactions.
problem Evaluating realism of synthetic social contact networks.
method Used multiple measures of graph complexity to compare synthetic networks with stylized models and empirical data.
result Synthetic networks are more realistic than stylized models.
The paper predicts edge weights in weighted directed networks using metric geometry.
problem Predicting edge weights in weighted directed networks.
method Introducing new types of weighted directed networks (AWDNs), constructing metrics, and proposing modified kNN and SVM methods.
result The proposed methods outperform traditional approaches in predicting edge weights.
Study dynamic matching in heterogeneous networks using ODE model.
problem Dynamic matching in heterogeneous networks with compatibility restrictions.
method Introduced an ODE model to evaluate matching algorithms.
result Demonstrated trade-off between quick matching and optimal matching.
We develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In our framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. Our model…
Generative model for dynamic networks with varying community structure.
problem Modeling networks with temporal dynamics and varying community structure.
method Latent space based generative model with neural network inference.
result Effective in community detection and link prediction on synthetic and real-world networks.
ResGCN detects anomalies in attributed networks by capturing sparsity and nonlinearity.
problem Detecting anomalous nodes in attributed networks.
method Attention-based deep residual modeling using Graph Convolutional Networks.
result ResGCN effectively detects anomalies in attributed networks.
Proposes online learning for Hawkes processes with network structure and event interaction.
problem Modeling complex interactions and latent structures in network events.
method Online learning approach for mixture of multivariate Hawkes processes.
result Efficacy demonstrated on synthetic and real-world data.
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.
In this paper, we investigate the statistical features of the weighted international-trade network. By finding the maximum weight spanning trees for this network we make the extraction of the truly relevant connections forming the network's backbone. We discuss the role of large-sized countries (strongest economies) in…
VIRTUAL improves federated multi-task learning for non-convex models.
problem Real-world federated datasets show statistical heterogeneity.
method VIRTUAL treats federated network as a star-shaped Bayesian network and uses variational inference.
result VIRTUAL outperforms state-of-the-art for federated learning on real-world datasets.
LoCEC classifies user relationships in large social networks, addressing sparsity issues.
problem Sparse relationship feature and label data in real social platforms.
method Local Community-based Edge Classification (LoCEC) framework with three-phase processing.
result Effective and efficient classification of user relationships in large-scale networks.
MMGAN creates graphs with higher-order motifs for better network simulation.
problem Generative models fail to capture higher-order connectivity patterns in real-world networks.
method Combines multiple biased random walks to capture different motif structures.
result Outperforms NetGAN at creating graphs with accurate network motif statistics.
Study 986 diverse networks to reveal structural diversity across domains.
problem Understanding structural diversity in networks across various domains.
method Machine learning techniques (random forest, confusion matrix) on 986 real-world networks and 575 generated networks.
result Networks in the same partition have similar underlying functions, constraints, and generative mechanisms, regardless of their origins.
HNHN learns from hypergraphs with hyperedge neurons for better classification.
problem Learning from hypergraphs with complex relationships.
method Hypergraph convolution network with hyperedge neurons and adaptive normalization.
result Improved classification accuracy and speed compared to state-of-the-art methods.
The paper develops personalized DAG models for web user behavior.
problem Understanding user behavior transitions between websites with user heterogeneity and network dependency.
method Personalized Binomial DAG models with network-structured covariates, embedding network structure into a dimension-reduced covariate, learning node neighborhoods, and exploring variance-mean relation.
result The proposed algorithm outperforms state-of-the-art competitors in heterogeneous data.
Dyn-VGAE learns evolving network structures.
problem Learning dynamic network representations.
method Dynamic joint Variational Graph Autoencoders (Dyn-VGAE).
result Dyn-VGAE captures temporal evolution in dynamic networks.
TAnoGan detects anomalies in time series data using GANs.
problem Anomaly detection in time series data.
method Generative Adversarial Networks (GAN) for unsupervised anomaly detection.
result TAnoGan outperforms traditional and neural network models in anomaly detection.
Unify gradients to improve deep networks' robustness against black-box attacks.
problem Defending against score-based query attacks (SQAs) in deep neural networks.
method Unifying Gradients (UniG) to provide universal attack perturbations.
result Significantly improves real-world robustness of deep networks without sacrificing clean accuracy.
GANs can learn hierarchical distributions in real-world images efficiently.
problem Understanding and efficiently learning complex, real-world distributions with GANs.
method Formally studying how GANs can learn hierarchically generated distributions close to real-life image distributions using SGDA.
result Training GANs via SGDA can efficiently learn distributions with a 'forward super-resolution' structure, both in sample and time complexities.
A novel model-selection method for dynamic networks using synthetic data.
problem Classifying and understanding the growth mechanisms of dynamic networks.
method Training a classifier on synthetic network data generated by nine random graph models, using dynamic features that count new links.
result Achieves near-perfect classification of synthetic networks, outperforming state-of-the-art methods.
Equivariant networks improve geometric prediction without scalar approximations.
problem Efficiently predicting geometric tensors in real-world scenarios.
method Equivariant networks for geometric prediction.
result Equivariant networks can generalize to unseen systems for geometric prediction.
LAD detects anomalies in dynamic graphs using Laplacian matrix.
problem Anomaly detection in temporal graphs for real-world applications.
method LAD uses the spectrum of the Laplacian matrix to model graph snapshots and temporal dependencies.
result LAD outperforms state-of-the-art methods in synthetic and real-world datasets.
Sparse hypergraph neural networks improve reasoning in large knowledge graphs.
problem Reasoning about relationships in large, real-world domains using sparse and local inferences.
method Sparse and local hypergraph neural networks (SpaLoc) exploiting relational inferences that are usually local and sparse.
result State-of-the-art performance on real-world knowledge graph reasoning benchmarks.
G2SAT learns to generate SAT formulas from real-world examples.
problem Lack of diverse real-world SAT formulas for testing and benchmarking.
method Generative neural network that learns to transform real-world SAT formulas into latent graph representations.
result G2SAT generates SAT formulas that closely resemble real-world instances and improves solver performance.
New methods estimate mixed memberships in multi-layer networks.
problem Complex community structure in multi-layer networks.
method Spectral methods using eigen-decomposition of aggregate matrices.
result Theoretical guarantees and empirical validation for mixed membership estimation.
Machine learning speeds up centrality measure calculations for large networks.
problem High computational costs of traditional centrality measures in large networks.
method Neural network learning algorithms to approximate centrality measures.
result Regression model approximates centrality measures efficiently and accurately.
Many real-world complex systems across natural, social, and economical domains consist of manifold layers to form multiplex networks. The multiple network layers give rise to nonlinear effect for the emergent dynamics of systems. Especially, weak layers that can potentially play significant role in amplifying the vulne…
New heuristics for predicting links in multiplex networks.
problem Link prediction in networks with multiple types of connections.
method Proposed a general framework and three families of heuristics.
result Significantly outperformed baseline heuristics for ordinary networks.
New RNN model fuses sensor data from multiple stations.
problem Modeling distributed sensor networks for future behavior prediction.
method Multi-Encoder-Decoder RNN architecture with attention mechanism.
result Model improves prediction accuracy on real-world sensor datasets.
Proposes an unsupervised graph neural network for entire graph representation.
problem Lack of unsupervised methods for entire graph representation.
method Combines hierarchical graph neural networks and mutual information maximization.
result Improves state-of-the-art performance on multiple graph level tasks.
DyHATR learns dynamic heterogeneous networks for better link prediction.
problem Learning effective representations of dynamic heterogeneous networks for link prediction.
method Hierarchical attention for heterogeneous information and temporal RNN for evolutionary patterns.
result DyHATR significantly outperforms state-of-the-art baselines on link prediction tasks.
New GNN method detects money laundering in diverse customer relationships.
problem Insufficient precision and efficiency of current AML systems.
method Heterogeneous Graph Neural Network (GNN) approach.
result Great potential for enhancing electronic surveillance systems for money laundering.
Two deep learning models improve indoor location prediction from WiFi fingerprints.
problem Indoor location prediction from WiFi fingerprints.
method Convolutional mixture density recurrent neural network and VAE-based semi-supervised learning model.
result Proposed models outperform existing methods in real-world datasets.
Paper compares semi-supervised training for differentiable particle filters.
problem Lack of labelled data in real-world applications.
method Compares two semi-supervised training objectives.
result Improved performance in environments with scarce labelled data.
How can we recognise social roles of people, given a completely unlabelled social network? We present a transfer learning approach to network role classification based on feature transformations from each network's local feature distribution to a global feature space. Experiments are carried out on real-world datasets.…
DiBS learns Bayesian network structure and parameters efficiently.
problem Bayesian structure learning with uncertainty reasoning.
method Differentiable framework for continuous latent graph representation, agnostic to local conditional distributions.
result Significantly outperforms related approaches in posterior inference.
Method learns conditional distributions using neural entropic optimal transport.
problem Challenges in learning multiple conditional distributions.
method Neural entropic optimal transport method with two networks and regularization.
result Effective learning of conditional distributions with limited samples.
Study reveals how spectral bias affects learnability on real-world data.
problem Understanding how well complex datasets can be learned using kernel methods.
method Use eigenvalues and eigenfunctions from idealized data to reveal spectral bias on real-world data.
result Bound learnability on real-world data using symmetries of realistic kernels.