Dissecting graph measure performance for node clustering in LFR parameter space
From MaRDI portal
Publication:2086607
Cites work
- A generalized inverse for graphs with absorption
- A new status index derived from sociometric analysis
- Accounting for the role of long walks on networks via a new matrix function
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- An introduction to support vector machines and other kernel-based learning methods.
- Communicability graph and community structures in complex networks
- Covariance and correlation measures on a graph in a generalized bag-of-paths formalism
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- Do logarithmic proximity measures outperform plain ones in graph clustering?
- Fast unfolding of communities in large networks
- Group inverses of M-matrices and their applications
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Least squares quantization in PCM
- Modern multidimensional scaling. Theory and applications.
- On a duality between metrics and \(\Sigma\)-proximities
- On proximity measures for graph vertices
- Random walks on graphs
- Randomized shortest paths with net flows and capacity constraints
- Similarities on graphs: kernels versus proximity measures
- Sparse randomized shortest paths routing with Tsallis divergence regularization
- Studying new classes of graph metrics
This page was built for publication: Dissecting graph measure performance for node clustering in LFR parameter space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086607)
