Estimating the clustering coefficient using sample complexity analysis
From MaRDI portal
Recommendations
- On the complexity of some cluster analysis problems
- Computing the clustering coefficient of a random model of graphs
- Approximating Clustering Coefficient and Transitivity
- scientific article; zbMATH DE number 6007853
- A randomized algorithm for estimating the number of clusters
- Estimating the number of clusters
- Estimating the number of clusters via a corrected clustering instability
- scientific article; zbMATH DE number 4034897
- Sample-weighted clustering methods
Cites work
- Collective dynamics of `small-world' networks
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Counting triangles in massive graphs with MapReduce
- Degree and clustering coefficient in sparse random intersection graphs
- Fast approximation of betweenness centrality through sampling
- Foundations of machine learning
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- Improved bounds on the sample complexity of learning
- Local clustering coefficient of spatial preferential attachment model
- Network science. With Márton Pósfai
- Networks, crowds and markets. Reasoning about a highly connected world.
- Networks. An introduction.
- Neural Network Learning
- Percolation centrality via Rademacher Complexity
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Understanding machine learning. From theory to algorithms
- Wedge sampling for computing clustering coefficients and triangle counts on large graphs†
This page was built for publication: Estimating the clustering coefficient using sample complexity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109016)
