Simplifying Calculation of Graph Similarity Through Matrices - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Simplifying Calculation of Graph Similarity Through Matrices

Xu Wang
  • Fonction : Auteur
  • PersonId : 1020396
Jihong Ouyang
  • Fonction : Auteur
  • PersonId : 1020397
Guifen Chen
  • Fonction : Auteur
  • PersonId : 972131

Résumé

A method to simplify the calculation in the process of measuring graph similarity is proposed, where lots of redundant operations are avoided in order to quickly obtain the initial tickets matrix. In this proposal, the element value of the initial tickets matrix is assigned to 1 when it is positive in corresponding position of the paths matrix at the first time. The proposed method calculates the initial tickets matrix value based on the positive value in the paths matrix in a forward and backward way. An example is provided to illustrate that the method is feasible and effective.
Fichier principal
Vignette du fichier
434298_1_En_41_Chapter.pdf (661.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01614181 , version 1 (10-10-2017)

Licence

Paternité

Identifiants

Citer

Xu Wang, Jihong Ouyang, Guifen Chen. Simplifying Calculation of Graph Similarity Through Matrices. 9th International Conference on Computer and Computing Technologies in Agriculture (CCTA), Sep 2015, Beijing, China. pp.417-428, ⟨10.1007/978-3-319-48354-2_41⟩. ⟨hal-01614181⟩
114 Consultations
110 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More