Uncertain Attribute Graph Sub-Graph Isomorphism and its Determination Algorithm

Yanjun Zhao, Chunying Zhang

Abstract


The expectative sub-graph isomorphism of uncertain attribute graph is based on the analysis of complex network structure and the characteristic of uncertain attribute graph. The expectative sub-graph isomorphism of uncertain attribute graph is only one threshold value as constraint conditions. The method is simple, but the computation is large amount. Therefore, this paper brings in the definition of sub-graph isomorphism of uncertain attribute graph, and explains the concept.  Then, this paper designs and comes true the algorithm ofsub-graph isomorphism. Finally, through the experiments proves that sub-graph isomorphic is better than expectative sub-graph, and it analyzes the variation in the different threshold cases. The research of sub-graph isomorphism algorithm laid the foundation for uncertain attribute graph sub-graph query and community mining.

 

DOI : http://dx.doi.org/10.11591/telkomnika.v12i4.4774

 


Keywords


Expectative sub-graph isomorphism; sub-graph isomorphism; Uncertain attribute graph

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics