Fusing data depth with complex networks: community detection with prior information
From MaRDI portal
Publication:2002721
DOI10.1016/j.csda.2019.01.007OpenAlexW2946320304WikidataQ127873071 ScholiaQ127873071MaRDI QIDQ2002721
Publication date: 12 July 2019
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2019.01.007
Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- A limit theorem for scaled eigenvectors of random dot product graphs
- Impact of regularization on spectral clustering
- Computing multiple-output regression quantile regions
- A testing based extraction algorithm for identifying significant communities in networks
- Eigenvectors of some large sample covariance matrix ensembles
- Spectral clustering and the high-dimensional stochastic blockmodel
- The spectra of multiplicative attribute graphs
- High-breakdown robust multivariate methods
- Robust estimation and classification for functional data via projection-based depth notions
- The random Tukey depth
- Spectral analysis of large dimensional random matrices
- Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
- Exact computation of the halfspace depth
- Validation of community robustness
- A topologically valid definition of depth for functional data
- General notions of statistical depth function.
- Clustering and classification based on the L\(_{1}\) data depth
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- The \(\mathrm{DD}^G\)-classifier in the functional setting
- Stochastic blockmodels with a growing number of classes
- Introduction to Information Retrieval
- Algorithm AS 307: Bivariate Location Depth
- Fast Community Detection in Complex Networks with a K-Depths Classifier
- DD-Classifier: Nonparametric Classification Procedure Based onDD-Plot
- A Survey of Statistical Network Models
- On the Concept of Depth for Functional Data
This page was built for publication: Fusing data depth with complex networks: community detection with prior information