Outlier detection in networks with missing links
From MaRDI portal
Publication:2242182
DOI10.1016/J.CSDA.2021.107308OpenAlexW3174262916MaRDI QIDQ2242182FDOQ2242182
Authors: Solenne Gaucher, Olga Klopp, Geneviève Robin 
Publication date: 9 November 2021
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.13122
Recommendations
- Community detection by \(L_{0}\)-penalized graph Laplacian
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- New node anomaly detection algorithm based on nonnegative matrix factorization for directed citation networks
- Degree-corrected stochastic block models and reliability in networks
- A dynamic logistic regression for network link prediction
Cites Work
- Matrix completion and low-rank SVD via fast alternating least squares
- Variational Inference for Stochastic Block Models From Sampled Data
- Modeling heterogeneity in random graphs through latent space models: a selective review
- Title not available (Why is that?)
- SybilRadar
- (SOFTWARE) gsbm
- Robust principal component analysis?
- Mathematical foundations of infinite-dimensional statistical models
- Community detection and stochastic block models: recent developments
- Concentration inequalities. A nonasymptotic theory of independence
- Modeling social networks from sampled data
- Noisy low-rank matrix completion with general sampling distribution
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Rank-Sparsity Incoherence for Matrix Decomposition
- Oracle inequalities for network models and sparse graphon estimation
- Robust Matrix Decomposition With Sparse Corruptions
- Robust matrix completion
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- Robust PCA via Outlier Pursuit
- Compressed sensing and matrix completion with constant proportion of corruptions
- On the convergence of block coordinate descent type methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- Robust machine learning by median-of-means: theory and practice
- Optimal estimation and completion of matrices with biclustering structures
Cited In (2)
Uses Software
This page was built for publication: Outlier detection in networks with missing links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2242182)
