{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:39:08Z","timestamp":1725831548289},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319250861"},{"type":"electronic","value":"9783319250878"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25087-8_14","type":"book-chapter","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T14:11:35Z","timestamp":1444140695000},"page":"150-161","source":"Crossref","is-referenced-by-count":2,"title":["Similarity of Attributed Generalized Tree Structures: A Comparative Study"],"prefix":"10.1007","author":[{"given":"Mahsa","family":"Kiani","sequence":"first","affiliation":[]},{"given":"Virendrakumar C.","family":"Bhavsar","sequence":"additional","affiliation":[]},{"given":"Harold","family":"Boley","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11553762_14","volume-title":"Innovative Internet Community Systems","author":"A Mehler","year":"2006","unstructured":"Mehler, A., Dehmer, M., Gleim, R.: Towards logical hypertext structure-a graph-theoretic perspective. In: B\u00f6hme, T., Larios Rosillo, V.M., Unger, H., Unger, H. (eds.) IICS 2004. LNCS, vol. 3473, pp. 136\u2013150. Springer, Heidelberg (2006)"},{"key":"14_CR2","first-page":"1","volume":"3","author":"M Dehmer","year":"2006","unstructured":"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\u20137 (2006)","journal-title":"J. Computational Intelligence"},{"key":"14_CR3","unstructured":"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\u201318 (2013)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Kiani, M., Bhavsar, V.C., Boley, H.: Structure similarity of attributed generalized trees. In: 8th IEEE International Semantic Computing, pp. 100\u2013107. IEEE Press, Newport Beach (2014)","DOI":"10.1109\/ICSC.2014.33"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39715-1_1","volume-title":"Rules and Rule Markup Languages for the Semantic Web","author":"H Boley","year":"2003","unstructured":"Boley, H.: Object-oriented RuleML: User-level roles, URI-grounded clauses, and order-sorted terms. In: Schr\u00f6der, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol. 2876, pp. 1\u201316. Springer, Heidelberg (2003)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1111\/j.0824-7935.2004.00255.x","volume":"20","author":"VC Bhavsar","year":"2004","unstructured":"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\u2013602 (2004)","journal-title":"J. Computational Intelligence"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.amc.2006.04.006","volume":"182","author":"M Dehmer","year":"2006","unstructured":"Dehmer, M., Emmert-Streib, F., Kilian, J.: A Similarity Measure for Graphs with Low Computational Complexity. J. Applied Mathematics and Computation 182, 447\u2013459 (2006)","journal-title":"J. Applied Mathematics and Computation"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013210. IEEE Press, London (2014)","DOI":"10.1109\/ICCI-CC.2014.6921461"},{"key":"14_CR9","unstructured":"Bunke, H.: What is the Distance between Graphs?. J. Bulletin of the European Association for Theoretical Computer Science, 35\u201339 (1983)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"3","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A Distance Measure between Attributed Relational Graphs for Pattern Recognition. IEEE Transactions on Systems, Man and Cybernetics 3, 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between Graph Edit Distance and Maximum Common Subgraph. J. Pattern Recognition Letters 18, 689\u2013694 (1997). Elsevier Science","journal-title":"J. Pattern Recognition Letters"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. JACM 21, 168\u2013173 (1974). ACM","journal-title":"JACM"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A Graph Distance Metric based on the Maximal Common Subgraph. J. Pattern Recognition Letters 19, 255\u2013259 (1998)","journal-title":"J. Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25087-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:51:22Z","timestamp":1559260282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25087-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319250861","9783319250878"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25087-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}