Similarities on graphs: kernels versus proximity measures
From MaRDI portal
Publication:2311350
DOI10.1016/j.ejc.2018.02.002zbMath1415.05042arXiv1802.06284OpenAlexW2788952779WikidataQ130199910 ScholiaQ130199910MaRDI QIDQ2311350
Dmytro Rubanov, Pavel Yu. Chebotarev, Konstantin E. Avrachenkov
Publication date: 10 July 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.06284
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Distance in graphs (05C12) Signed and weighted graphs (05C22)
Related Items (2)
Red light green light method for solving large Markov chains ⋮ Dissecting graph measure performance for node clustering in LFR parameter space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Personalized PageRank with node-dependent restart
- The walk distances in graphs
- Accounting for the role of long walks on networks via a new matrix function
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- The graph bottleneck identity
- The matrix-forest theorem and measuring relations in small social groups
- A generalized inverse for graphs with absorption
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- On proximity measures for graph vertices
- On a duality between metrics and \(\Sigma\)-proximities
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- A new status index derived from sociometric analysis
- On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods
- Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?
- A Generalized Distance in Graphs and Centered Partitions
- Semi-supervised learning with regularized Laplacian
- Learning Theory and Kernel Machines
- Studying New Classes of Graph Metrics
- Metric Spaces and Positive Definite Functions
- Encyclopedia of Distances
This page was built for publication: Similarities on graphs: kernels versus proximity measures
