{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:05:23Z","timestamp":1761807923578,"version":"3.41.0"},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014edl8113","type":"journal-article","created":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T22:40:28Z","timestamp":1425163228000},"page":"712-716","source":"Crossref","is-referenced-by-count":2,"title":["Split-Jaccard Distance of Hierarchical Decompositions for Software Architecture"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Ki-Seong","family":"LEE","sequence":"first","affiliation":[{"name":"Chung-Ang University"}]},{"given":"Byung-Woo","family":"HONG","sequence":"additional","affiliation":[{"name":"Chung-Ang University"}]},{"given":"Youngmin","family":"KIM","sequence":"additional","affiliation":[{"name":"Chung-Ang University"}]},{"given":"Jaeyeop","family":"AHN","sequence":"additional","affiliation":[{"name":"Chung-Ang University"}]},{"given":"Chan-Gun","family":"LEE","sequence":"additional","affiliation":[{"name":"Chung-Ang University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] O. Maqbool and H.A. Babri, \u201cHierarchical clustering for software architecture recovery,\u201d IEEE Trans. Softw. Eng., vol.33, no.11, pp.759-780, 2007.","DOI":"10.1109\/TSE.2007.70732"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M. Shtern and V. Tzerpos, \u201cMethods for selecting and improving software clustering algorithms,\u201d Software: Practice and Experience, vol.44, no.1, pp.33-46, 2014.","DOI":"10.1002\/spe.2147"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] V. Tzerpos and R.C. Holt, \u201cMojo: A distance metric for software clusterings,\u201d Proc. Sixth Working Conference on Reverse Engineering, 1999, pp.187-193, 1999.","DOI":"10.1109\/WCRE.1999.806959"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] N. Anquetil and T.C. Lethbridge, \u201cExperiments with clustering as a software remodularization method,\u201d Proc. Sixth Working Conference on Reverse Engineering, 1999, pp.235-255, 1999.","DOI":"10.1109\/WCRE.1999.806964"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] B.S. Mitchell and S. Mancoridis, \u201cComparing the decompositions produced by software clustering algorithms using similarity measurements,\u201d Proc. IEEE International Conference on Software Maintenance, 2001, pp.744-753, 2001.","DOI":"10.1109\/ICSM.2001.972795"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Shtern and V. Tzerpos, \u201cLossless comparison of nested software decompositions,\u201d 14th Working Conference on Reverse Engineering, 2007. WCRE 2007, pp.249-258, 2007.","DOI":"10.1109\/WCRE.2007.32"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Q. Zhang, E.Y. Liu, A. Sarkar, and W. Wang, \u201cSplit-order distance for clustering and classification hierarchies,\u201d in Scientific and Statistical Database Management, pp.517-534, Springer, 2009.","DOI":"10.1007\/978-3-642-02279-1_37"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] P. Jaccard, \u201cThe distribution of the flora in the alpine zone,\u201d New Phytologist, vol.11, no.2, pp.37-60, 1912.","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] K. Zhang and D. Shasha, \u201cSimple fast algorithms for the editing distance between trees and related problems,\u201d SIAM J. Comput., vol.18, no.6, pp.1245-1262, 1989.","DOI":"10.1137\/0218082"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] H. Touzet, \u201cTree edit distance with gaps,\u201d Inf. Process. Lett., vol.85, no.3, pp.123-129, 2003.","DOI":"10.1016\/S0020-0190(02)00369-1"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] E.D. Demaine, S. Mozes, B. Rossman, and O. Weimann, \u201cAn optimal decomposition algorithm for tree edit distance,\u201d ACM Trans. Algorithms, vol.6, no.1, pp.2: 1-2: 19, 2009.","DOI":"10.1145\/1644015.1644017"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] M. Pawlik and N. Augsten, \u201cRted: A robust algorithm for the tree edit distance,\u201d Proc. VLDB Endow., vol.5, no.4, pp.334-345, Dec. 2011.","DOI":"10.14778\/2095686.2095692"},{"key":"13","unstructured":"[13] M. Pawlik and N. Augsten, \u201cA memory-efficient tree edit distance algorithm,\u201d in Database and Expert Systems Applications, ed. H. Decker, L. Lhotska, S. Link, M. Spies, and R.R. Wagner, Lect. Notes Comput. Sci., vol.8644, pp.196-210, 2014."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] P. Bille, \u201cA survey on tree edit distance and related problems,\u201d Theor. Comput. Sci., vol.337, no.1, pp.217-239, 2005.","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M. Shtern and V. Tzerpos, \u201cA framework for the comparison of nested software decompositions,\u201d Proc. 11th Working Conference on Reverse Engineering, 2004, pp.284-292, 2004.","DOI":"10.1109\/WCRE.2004.6"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/3\/E98.D_2014EDL8113\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T15:27:44Z","timestamp":1747754864000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/3\/E98.D_2014EDL8113\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014edl8113","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2015]]}}}