Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
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)
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)
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)
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)
Bunke, H.: What is the Distance between Graphs?. J. Bulletin of the European Association for Theoretical Computer Science, 35–39 (1983)
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)
Bunke, H.: On a relation between Graph Edit Distance and Maximum Common Subgraph. J. Pattern Recognition Letters 18, 689–694 (1997). Elsevier Science
Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. JACM 21, 168–173 (1974). ACM
Bunke, H., Shearer, K.: A Graph Distance Metric based on the Maximal Common Subgraph. J. Pattern Recognition Letters 19, 255–259 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kiani, M., Bhavsar, V.C., Boley, H. (2015). Similarity of Attributed Generalized Tree Structures: A Comparative Study. In: Amato, G., Connor, R., Falchi, F., Gennaro, C. (eds) Similarity Search and Applications. SISAP 2015. Lecture Notes in Computer Science(), vol 9371. Springer, Cham. https://doi.org/10.1007/978-3-319-25087-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-25087-8_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25086-1
Online ISBN: 978-3-319-25087-8
eBook Packages: Computer ScienceComputer Science (R0)