Next Waves in Veridical Network Embedding
arXiv:2007.05385 · doi:10.1002/sam.11486
Abstract
Embedding nodes of a large network into a metric (e.g., Euclidean) space has become an area of active research in statistical machine learning, which has found applications in natural and social sciences. Generally, a representation of a network object is learned in a Euclidean geometry and is then used for subsequent tasks regarding the nodes and/or edges of the network, such as community detection, node classification and link prediction. Network embedding algorithms have been proposed in multiple disciplines, often with domain-specific notations and details. In addition, different measures and tools have been adopted to evaluate and compare the methods proposed under different settings, often dependent of the downstream tasks. As a result, it is challenging to study these algorithms in the literature systematically. Motivated by the recently proposed Veridical Data Science (VDS) framework, we propose a framework for network embedding algorithms and discuss how the principles of predictability, computability and stability apply in this context. The utilization of this framework in network embedding holds the potential to motivate and point to new directions for future research.
References in corpus (27)
- Scikit-learn: Machine Learning in Python
- Efficient Estimation of Word Representations in Vector Space
- Distributed Representations of Words and Phrases and their Compositionality
- DeepWalk: Online Learning of Social Representations
- Semi-Supervised Classification with Graph Convolutional Networks
- LINE: Large-scale Information Network Embedding
- Inductive Representation Learning on Large Graphs
- Neural Message Passing for Quantum Chemistry
- Link Prediction in Complex Networks: A Survey
- Spectral Networks and Locally Connected Networks on Graphs
- Model Cards for Model Reporting
- Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
- Consistency of spectral clustering
- Gated Graph Sequence Neural Networks
- Consistency of spectral clustering in stochastic block models
- Sparse graphs using exchangeable random measures
- Veridical Data Science
- Deep Learning on Graphs: A Survey
- Supervised Random Walks: Predicting and Recommending Links in Social Networks
- Sparse exchangeable graphs and their limits via graphon processes
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Deep Graph Infomax
- The Class of Random Graphs Arising from Exchangeable Random Measures
- Sampling perspectives on sparse exchangeable graphs
- Network cross-validation by edge sampling
- Subsampling large graphs and invariance in networks
- A statistical interpretation of spectral embedding: the generalised random dot product graph