Similarities on graphs: Kernels versus proximity measures

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.
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download

https://hal.inria.fr/hal-02413478
Contributor : Konstantin Avrachenkov <>
Submitted on : Monday, December 16, 2019 - 11:18:35 AM
Last modification on : Tuesday, December 17, 2019 - 2:06:23 AM

File

EJC2019paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

27

Files downloads

41