@article{ART002419243},
author={Tae-Soo cho and Chi-Geun Han and Sang-Hoon Lee},
title={Measurement of graphs similarity using graph centralities},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2018},
volume={23},
number={12},
pages={57-64},
doi={10.9708/jksci.2018.23.12.057}
TY - JOUR
AU - Tae-Soo cho
AU - Chi-Geun Han
AU - Sang-Hoon Lee
TI - Measurement of graphs similarity using graph centralities
JO - Journal of The Korea Society of Computer and Information
PY - 2018
VL - 23
IS - 12
PB - The Korean Society Of Computer And Information
SP - 57
EP - 64
SN - 1598-849X
AB - In this paper, a method to measure similarity between two graphs is proposed, which is based on centralities of the graphs. The similarity between two graphs G₁ and G₂ is defined by thedifference of distance(G₁, GR1) and distance(G₂, GR2), where GR1 and GR2 are set of random graphs that have the same number of nodes and edges as G₁ and G₂, respectively. Each distance (G*, GR*) is obtained by comparing centralities of G* and GR*. Through the computational experiments, we show that it is possible to compare graphs regardless of the number of vertices or edges of the graphs. Also, it is possible to identify and classify the properties of the graphs by measuring and comparing similarities between two graphs.
KW - graph;centrality;random graph;similarity measure;graph classification
DO - 10.9708/jksci.2018.23.12.057
ER -
Tae-Soo cho, Chi-Geun Han and Sang-Hoon Lee. (2018). Measurement of graphs similarity using graph centralities. Journal of The Korea Society of Computer and Information, 23(12), 57-64.
Tae-Soo cho, Chi-Geun Han and Sang-Hoon Lee. 2018, "Measurement of graphs similarity using graph centralities", Journal of The Korea Society of Computer and Information, vol.23, no.12 pp.57-64. Available from: doi:10.9708/jksci.2018.23.12.057
Tae-Soo cho, Chi-Geun Han, Sang-Hoon Lee "Measurement of graphs similarity using graph centralities" Journal of The Korea Society of Computer and Information 23.12 pp.57-64 (2018) : 57.
Tae-Soo cho, Chi-Geun Han, Sang-Hoon Lee. Measurement of graphs similarity using graph centralities. 2018; 23(12), 57-64. Available from: doi:10.9708/jksci.2018.23.12.057
Tae-Soo cho, Chi-Geun Han and Sang-Hoon Lee. "Measurement of graphs similarity using graph centralities" Journal of The Korea Society of Computer and Information 23, no.12 (2018) : 57-64.doi: 10.9708/jksci.2018.23.12.057
Tae-Soo cho; Chi-Geun Han; Sang-Hoon Lee. Measurement of graphs similarity using graph centralities. Journal of The Korea Society of Computer and Information, 23(12), 57-64. doi: 10.9708/jksci.2018.23.12.057
Tae-Soo cho; Chi-Geun Han; Sang-Hoon Lee. Measurement of graphs similarity using graph centralities. Journal of The Korea Society of Computer and Information. 2018; 23(12) 57-64. doi: 10.9708/jksci.2018.23.12.057
Tae-Soo cho, Chi-Geun Han, Sang-Hoon Lee. Measurement of graphs similarity using graph centralities. 2018; 23(12), 57-64. Available from: doi:10.9708/jksci.2018.23.12.057
Tae-Soo cho, Chi-Geun Han and Sang-Hoon Lee. "Measurement of graphs similarity using graph centralities" Journal of The Korea Society of Computer and Information 23, no.12 (2018) : 57-64.doi: 10.9708/jksci.2018.23.12.057
