Similarities on graphs: Kernels versus proximity measures - Archive ouverte HAL Access content directly
Journal Articles European Journal of Combinatorics Year : 2019

Similarities on graphs: Kernels versus proximity measures

(1) , (2) , (1)
1
2

Abstract

We analytically study proximity and distance properties of various kernels and similarity measures on graphs. This helps to understand the mathematical nature of such measures and can potentially be useful for recommending the adoption of specific similarity measures in data analysis.
Fichier principal
Vignette du fichier
EJC2019paper.pdf (197.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02413478 , version 1 (16-12-2019)

Identifiers

Cite

Konstantin Avrachenkov, Pavel Chebotarev, Dmytro Rubanov. Similarities on graphs: Kernels versus proximity measures. European Journal of Combinatorics, 2019, 80, pp.47-56. ⟨10.1016/j.ejc.2018.02.002⟩. ⟨hal-02413478⟩
32 View
243 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More