Similarity of Attributed Generalized Tree Structures: A Comparative Study

  • Mahsa KianiEmail author
  • Virendrakumar C. Bhavsar
  • Harold Boley
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9371)


In our earlier attributed generalized tree (AGT) structures, vertex labels (as types) and edge labels (as attributes) embody semantic information, while edge weights express assessments regarding the (percentage-)relative importance of the attributes, a kind of pragmatic information. Our AGT similarity algorithm has been applied to e-Health, e-Business, and insurance underwriting. In this paper, we compare similarity computed by our AGT algorithm with the similarities obtained using: (a) a weighted tree similarity algorithm (WT), (b) graph edit distance (GED) based similarity measure, (c) maximum common subgraph (MCS) algorithm, and (d) a generalized tree similarity algorithm (GT). It is shown that small changes in tree structures may lead to undesirably large similarity changes using WT. Further, GT is found to be not applicable to AGT structures containing semantic as well as pragmatic information. GED and MCS cannot differentiate AGT structures with edges having different directions, lengths, or weights, all taken into account by our AGT algorithm.


Tree similarity Attributed generalized tree Generalized tree similarity Weighted tree similarity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Mehler, A., Dehmer, M., Gleim, R.: Towards logical hypertext structure-a graph-theoretic perspective. In: Böhme, T., Larios Rosillo, V.M., Unger, H., Unger, H. (eds.) IICS 2004. LNCS, vol. 3473, pp. 136–150. Springer, Heidelberg (2006) CrossRefGoogle Scholar
  2. 2.
    Dehmer, M., Emmert-Streib, F., Mehler, A., Kilian, J.: Measuring the Structural Similarity of Web-based Documents: a Novel Approach. J. Computational Intelligence 3, 1–7 (2006)Google Scholar
  3. 3.
    Kiani, M., Bhavsar, V.C., Boley, H.: Combined structure-weight graph similarity and its application in e-health. In: 4th Canadian Semantic Web Symposium, Montreal, pp. 12–18 (2013)Google Scholar
  4. 4.
    Kiani, M., Bhavsar, V.C., Boley, H.: Structure similarity of attributed generalized trees. In: 8th IEEE International Semantic Computing, pp. 100–107. IEEE Press, Newport Beach (2014)Google Scholar
  5. 5.
    Boley, H.: Object-oriented RuleML: User-level roles, URI-grounded clauses, and order-sorted terms. In: Schröder, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol. 2876, pp. 1–16. Springer, Heidelberg (2003) CrossRefGoogle Scholar
  6. 6.
    Bhavsar, V.C., Boley, H., Yang, L.: A Weighted-tree Similarity Algorithm for Multi-agent Systems in e-Business Environments. J. Computational Intelligence 20, 584–602 (2004)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Dehmer, M., Emmert-Streib, F., Kilian, J.: A Similarity Measure for Graphs with Low Computational Complexity. J. Applied Mathematics and Computation 182, 447–459 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Kiani, M., Bhavsar, V.C., Boley, H.: A fuzzy structure similarity algorithm for attributed generalized trees. In: 13th IEEE International Conference on Cognitive Informatics and Cognitive Computing, pp. 203–210. IEEE Press, London (2014)Google Scholar
  9. 9.
    Bunke, H.: What is the Distance between Graphs?. J. Bulletin of the European Association for Theoretical Computer Science, 35–39 (1983)Google Scholar
  10. 10.
    Sanfeliu, A., Fu, K.S.: A Distance Measure between Attributed Relational Graphs for Pattern Recognition. IEEE Transactions on Systems, Man and Cybernetics 3, 353–362 (1983)CrossRefzbMATHGoogle Scholar
  11. 11.
    Bunke, H.: On a relation between Graph Edit Distance and Maximum Common Subgraph. J. Pattern Recognition Letters 18, 689–694 (1997). Elsevier ScienceCrossRefGoogle Scholar
  12. 12.
    Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. JACM 21, 168–173 (1974). ACMMathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Bunke, H., Shearer, K.: A Graph Distance Metric based on the Maximal Common Subgraph. J. Pattern Recognition Letters 19, 255–259 (1998)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Mahsa Kiani
    • 1
    Email author
  • Virendrakumar C. Bhavsar
    • 1
  • Harold Boley
    • 1
  1. 1.Faculty of Computer ScienceUniversity of New BrunswickFrederictonCanada

Personalised recommendations