{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:58:39Z","timestamp":1764997119637,"version":"3.46.0"},"reference-count":50,"publisher":"Walter de Gruyter GmbH","issue":"4","license":[{"start":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T00:00:00Z","timestamp":1493856000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Multi-objective software module clustering problem (M-SMCP) aims to automatically produce clustering solutions that optimize multiple conflicting clustering criteria simultaneously. Multi-objective evolutionary algorithms (MOEAs) have been a most appropriate alternate for solving M-SMCPs. Recently, it has been observed that the performance of MOEAs based on Pareto dominance selection technique degrades with multi-objective optimization problem having more than three objective functions. To alleviate this issue for M-SMCPs containing more than three objective functions, we propose a two-archive based artificial bee colony (TA-ABC) algorithm. For this contribution, a two-archive concept has been incorporated in the TA-ABC algorithm. Additionally, an improved indicator-based selection method is used instead of Pareto dominance selection technique. To validate the performance of TA-ABC, an empirical study is conducted with two well-known M-SMCPs, i.e. equal-size cluster approach and maximizing cluster approach, each containing five objective functions. The clustering result produced by TA-ABC is compared with existing genetic based two-archive algorithm (TAA) and non-dominated sorting genetic algorithm II (NSGA-II) over seven un-weighted and 10 weighted practical problems. The comparison results show that the proposed TA-ABC outperforms significantly TAA and NSGA-II in terms of modularization quality, coupling, cohesion, Pareto optimality, inverted generational distance, hypervolume, and spread performance metrics.<\/jats:p>","DOI":"10.1515\/jisys-2016-0253","type":"journal-article","created":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T06:02:20Z","timestamp":1493877740000},"page":"619-641","source":"Crossref","is-referenced-by-count":23,"title":["TA-ABC: Two-Archive Artificial Bee Colony for Multi-objective Software Module Clustering Problem"],"prefix":"10.1515","volume":"27","author":[{"family":"Amarjeet","sequence":"first","affiliation":[{"name":"Department of Computer Engineering , NIT Kurukshetra , Haryana , India"}]},{"given":"Jitender Kumar","family":"Chhabra","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering , NIT Kurukshetra , Haryana , India"}]}],"member":"374","published-online":{"date-parts":[[2017,5,4]]},"reference":[{"key":"2025120523275896547_j_jisys-2016-0253_ref_001_w2aab3b7b8b1b6b1ab1b9b1Aa","doi-asserted-by":"crossref","unstructured":"H. Abdeen, S. Ducasse, H. A. Sahraoui and I. Alloui, Automatic package coupling and cycle minimization, in: Proceedings of the 16th Working Conference on Reverse Engineering, France, pp. 103\u2013112, 2009.","DOI":"10.1109\/WCRE.2009.13"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_002_w2aab3b7b8b1b6b1ab1b9b2Aa","doi-asserted-by":"crossref","unstructured":"P. Amarjeet and J. K. Chhabra, Harmony search based remodularization for object-oriented software systems, Comput. Lang. Syst. Struct. 47 (2017), 153\u2013169.","DOI":"10.1016\/j.cl.2016.09.003"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_003_w2aab3b7b8b1b6b1ab1b9b3Aa","doi-asserted-by":"crossref","unstructured":"P. Amarjeet and J. K. Chhabra, Improving modular structure of software system using lexical and structural dependencies. Inform. Software Tech. 82 (2017), 96\u2013120.10.1016\/j.infsof.2016.09.011","DOI":"10.1016\/j.infsof.2016.09.011"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_004_w2aab3b7b8b1b6b1ab1b9b4Aa","unstructured":"P. Amarjeet and J. K. Chhabra, Improving package structure of object-oriented software using multi-objective optimization and weighted class connections, J. King Saud U. Comput. Inf. Sci., in press. Available online 2 November 2015."},{"key":"2025120523275896547_j_jisys-2016-0253_ref_005_w2aab3b7b8b1b6b1ab1b9b5Aa","doi-asserted-by":"crossref","unstructured":"M. Barros, An analysis of the effects of composite objectives in multi-objective software module clustering, in: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, USA, pp. 1205\u20131212, 2012.","DOI":"10.1145\/2330163.2330330"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_006_w2aab3b7b8b1b6b1ab1b9b6Aa","doi-asserted-by":"crossref","unstructured":"V. R. Basil and A. J. Turner, Iterative enhancement: a practical technique for software development, IEEE T. Software Eng. 1 (1975), 390\u2013396.","DOI":"10.1109\/TSE.1975.6312870"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_007_w2aab3b7b8b1b6b1ab1b9b7Aa","doi-asserted-by":"crossref","unstructured":"J. K. Chhabra, K. K. Aggarwal and Y. Singh, Code and data spatial complexity: two important software understandability measures, Inform. Software Tech. 45 (2003), 539\u2013546.10.1016\/S0950-5849(03)00033-8","DOI":"10.1016\/S0950-5849(03)00033-8"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_008_w2aab3b7b8b1b6b1ab1b9b8Aa","doi-asserted-by":"crossref","unstructured":"J. K. Chhabra, K. K. Aggarwal and Y. Singh, Measurement of object-oriented software spatial complexity, Inform. Software Tech. 46 (2004), 689\u2013699.10.1016\/j.infsof.2004.01.001","DOI":"10.1016\/j.infsof.2004.01.001"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_009_w2aab3b7b8b1b6b1ab1b9b9Aa","unstructured":"L. L. Constantine and E. Yourdon, Structured Design, Prentice Hall, USA, 1979."},{"key":"2025120523275896547_j_jisys-2016-0253_ref_010_w2aab3b7b8b1b6b1ab1b9c10Aa","doi-asserted-by":"crossref","unstructured":"E. Cotilla-Sanchez, P. D. H. Hines, C. Barrows, S. Blumsack and M. Patel, Multi-attribute partitioning of power networks based on electrical distance, IEEE T. Power Syst. 28 (2013), 4979\u20134987.10.1109\/TPWRS.2013.2263886","DOI":"10.1109\/TPWRS.2013.2263886"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_011_w2aab3b7b8b1b6b1ab1b9c11Aa","doi-asserted-by":"crossref","unstructured":"S. S. Dahiya, J. K. Chhabra and S. Kumar, Application of artificial bee colony algorithm to software testing. in: 2010 21st Australian Software Engineering Conference, Auckland, pp. 149\u2013154, 2010.","DOI":"10.1109\/ASWEC.2010.30"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_012_w2aab3b7b8b1b6b1ab1b9c12Aa","doi-asserted-by":"crossref","unstructured":"K. Deb and H. Jain, An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints, IEEE T. Evolut. Comput.18 (2004), 577\u2013601.","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_013_w2aab3b7b8b1b6b1ab1b9c13Aa","doi-asserted-by":"crossref","unstructured":"K. Deb, A. Pratap, S. Agarwal and T. Meyarivan, A fast and elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II, IEEE T. Evolut. Comput. 6 (2002), 182\u2013197.10.1109\/4235.996017","DOI":"10.1109\/4235.996017"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_014_w2aab3b7b8b1b6b1ab1b9c14Aa","doi-asserted-by":"crossref","unstructured":"L. Devroye, Non-Uniform Random Variate Generation. Springer-Verlag, USA, 1986.","DOI":"10.1007\/978-1-4613-8643-8"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_015_w2aab3b7b8b1b6b1ab1b9c15Aa","doi-asserted-by":"crossref","unstructured":"D. Doval, S. Mancoridis, B. S. Mitchell, Automatic clustering of software systems using a genetic algorithm, in: Proceedings of IEEE Conference on Software Technology and Engineering Practice, USA, pp. 73\u201381, 1999.","DOI":"10.1109\/STEP.1999.798481"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_016_w2aab3b7b8b1b6b1ab1b9c16Aa","doi-asserted-by":"crossref","unstructured":"A. E. Ezugwu, N. A. Okoroafor, S. M. Buhari, M. E. Frincu, S. B. Junaidu, Grid resource allocation with genetic algorithm using population based on multisets, J. Intell. Syst. 26 (2017), 169\u2013184.","DOI":"10.1515\/jisys-2015-0089"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_017_w2aab3b7b8b1b6b1ab1b9c17Aa","doi-asserted-by":"crossref","unstructured":"A. Farrugia, Vertex-partitioning into fixed additive induced hereditary properties is NP-hard, Electron. J. Combin. 11 (2004), 1\u20139.","DOI":"10.37236\/1799"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_018_w2aab3b7b8b1b6b1ab1b9c18Aa","doi-asserted-by":"crossref","unstructured":"M. Genero, J. Olivas, M. Piattini and F. Romero, Using metrics to predict OO information systems maintainability, in: Proceedings of the 13th International Conference on Advanced Information Systems Engineering (CAiSE\u201901), Springer-Verlag, London, UK, pp. 388\u2013401, 2001.","DOI":"10.1007\/3-540-45341-5_26"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_019_w2aab3b7b8b1b6b1ab1b9c19Aa","doi-asserted-by":"crossref","unstructured":"D. Gong, J. Sun and X. Ji, Evolutionary algorithms with preference polyhedron for interval multi-objective optimization problems. Inform. Sciences233 (2013), 141\u2013161.10.1016\/j.ins.2013.01.020","DOI":"10.1016\/j.ins.2013.01.020"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_020_w2aab3b7b8b1b6b1ab1b9c20Aa","doi-asserted-by":"crossref","unstructured":"V. Gupta and J. K. Chhabra, Package level cohesion measurement in object-oriented software, J. Braz. Comput. Soc. 18 (2011), 251\u2013266.","DOI":"10.1007\/s13173-011-0052-4"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_021_w2aab3b7b8b1b6b1ab1b9c21Aa","unstructured":"M. Harman, R. Hierons and M. Proctor, A new representation and crossover operator for search-based optimization of software modularization, in: Proceedings of the Genetic and Evolutionary Computation Conference, USA, pp. 1351\u20131358, 2002."},{"key":"2025120523275896547_j_jisys-2016-0253_ref_022_w2aab3b7b8b1b6b1ab1b9c22Aa","doi-asserted-by":"crossref","unstructured":"J. Harris, J. Hirst and M. Mossinghoff, Combinatorics and Graph Theory, Springer, New York, pp. 212\u2013237, 2000.","DOI":"10.1007\/978-1-4757-4803-1"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_023_w2aab3b7b8b1b6b1ab1b9c23Aa","doi-asserted-by":"crossref","unstructured":"H. A. Hashim, B. O. Ayinde and M. A. Abido, Optimal placement of relay nodes in wireless sensor network using artificial bee colony algorithm, J. Netw. Comput. Appl. 64 (2016), 239\u2013248.10.1016\/j.jnca.2015.09.013","DOI":"10.1016\/j.jnca.2015.09.013"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_024_w2aab3b7b8b1b6b1ab1b9c24Aa","doi-asserted-by":"crossref","unstructured":"S. D. Hester, D. L. Parnas and D. F. Utter, Using documentation as a software design medium. Bell Syst. Technol. J. 60 (1981), 1941\u20131977.10.1002\/j.1538-7305.1981.tb00304.x","DOI":"10.1002\/j.1538-7305.1981.tb00304.x"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_025_w2aab3b7b8b1b6b1ab1b9c25Aa","doi-asserted-by":"crossref","unstructured":"H. T. Jadhav and P. D. Bamane, Temperature dependent optimal power flow using g-best guided artificial bee colony algorithm, Int. J. Elec. Power Energy Syst. 77 (2016), 77\u201390.10.1016\/j.ijepes.2015.11.026","DOI":"10.1016\/j.ijepes.2015.11.026"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_026_w2aab3b7b8b1b6b1ab1b9c26Aa","unstructured":"D. Karaboga, An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005."},{"key":"2025120523275896547_j_jisys-2016-0253_ref_027_w2aab3b7b8b1b6b1ab1b9c27Aa","doi-asserted-by":"crossref","unstructured":"V. Kumar, J. K. Chhabra and D. Kumar, Grey wolf algorithm-based clustering technique, J. Intell. Syst. 26 (2017), 153\u2013168.","DOI":"10.1515\/jisys-2014-0137"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_028_w2aab3b7b8b1b6b1ab1b9c28Aa","doi-asserted-by":"crossref","unstructured":"A. C. Kumari and K. Srinivas, Hyper-heuristic approach for multi-objective software module clustering, J. Syst. Software117 (2016), 384\u2013401.10.1016\/j.jss.2016.04.007","DOI":"10.1016\/j.jss.2016.04.007"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_029_w2aab3b7b8b1b6b1ab1b9c29Aa","doi-asserted-by":"crossref","unstructured":"A. C. Kumari, K. Srinivas and M. P. Gupta, Software module clustering using a hyper-heuristic based multi-objective genetic algorithm. Advance Computing Conference (IACC), 2013 IEEE 3rd International, Ghaziabad, pp. 813\u2013818, 2013.","DOI":"10.1109\/IAdCC.2013.6514331"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_030_w2aab3b7b8b1b6b1ab1b9c30Aa","doi-asserted-by":"crossref","unstructured":"M. M. Lehman, On understanding laws, evolution, and conservation in the large-program life cycle, J. Syst. Softw. 1 (1980), 213\u201322.","DOI":"10.1016\/0164-1212(79)90022-0"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_031_w2aab3b7b8b1b6b1ab1b9c31Aa","doi-asserted-by":"crossref","unstructured":"X. Li and G. Yang, Artificial bee colony algorithm with memory, Appl. Soft Comput. 41 (2016), 362\u2013372.10.1016\/j.asoc.2015.12.046","DOI":"10.1016\/j.asoc.2015.12.046"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_032_w2aab3b7b8b1b6b1ab1b9c32Aa","doi-asserted-by":"crossref","unstructured":"K. Mahdavi, M. Harman and R. M. Hierons, A multiple hill climbing approach to software module clustering, in: Proceedings of the International Conference on Software Maintenance, Netherlands, pp. 315\u2013324, 2003.","DOI":"10.1109\/ICSM.2003.1235437"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_033_w2aab3b7b8b1b6b1ab1b9c33Aa","doi-asserted-by":"crossref","unstructured":"A. S. Mamaghani and M. R. Meybodi, Clustering of software systems using new hybrid algorithms, in: Proceedings of the Ninth IEEE International Conference on Computer and Information Technology (CIT\u201909), vol. 1, Bangladesh, 2009.","DOI":"10.1109\/CIT.2009.111"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_034_w2aab3b7b8b1b6b1ab1b9c34Aa","doi-asserted-by":"crossref","unstructured":"S. Mancoridis, B. S. Mitchell, Y.-F. Chen and E. R. Gansner, Bunch: a clustering tool for the recovery and maintenance of software system structures, in: Proceedings of the IEEE International Conference on Software Maintenance, UK, pp. 50\u201359, 1999.","DOI":"10.1109\/ICSM.1999.792498"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_035_w2aab3b7b8b1b6b1ab1b9c35Aa","unstructured":"S. Mancoridis, B. S. Mitchell, C. Rorres, Y. F. Chen and E. R. Gansner, Using automatic clustering to produce high-level system organizations of source code, in: Proceedings of the International Workshop on Program Comprehension, Italy, pp. 45\u201353, 1998."},{"key":"2025120523275896547_j_jisys-2016-0253_ref_036_w2aab3b7b8b1b6b1ab1b9c36Aa","doi-asserted-by":"crossref","unstructured":"O. Maqbool and H. A. Babri, Hierarchical clustering for software architecture recovery, IEEE T. Software Eng. 33 (2007), 759\u2013780.10.1109\/TSE.2007.70732","DOI":"10.1109\/TSE.2007.70732"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_037_w2aab3b7b8b1b6b1ab1b9c37Aa","unstructured":"B. S. Mitchell, A heuristic search approach to solving the software clustering problem. PhD. dissertation, Drexel University, USA, 2002."},{"key":"2025120523275896547_j_jisys-2016-0253_ref_038_w2aab3b7b8b1b6b1ab1b9c38Aa","unstructured":"B. S. Mitchell and S. Mancoridis, Using heuristic search techniques to extract design abstractions from source code, in: Proceedings of the Genetic and Evolutionary Computation Conference, USA, pp. 1375\u20131382, 2002."},{"key":"2025120523275896547_j_jisys-2016-0253_ref_039_w2aab3b7b8b1b6b1ab1b9c39Aa","unstructured":"L. E. Moses, Think and Explain with Statistics, Addison-Wesley, USA, 1986."},{"key":"2025120523275896547_j_jisys-2016-0253_ref_040_w2aab3b7b8b1b6b1ab1b9c40Aa","doi-asserted-by":"crossref","unstructured":"M. \u00d3 Cinn\u00e9ide, L. Tratt, M. Harman, S. Counsell and I.-H. Moghadam, Experimental assessment of software metrics using automated refactoring, in: ESEM\u201912, Sweden, pp.49\u201358, 2012.","DOI":"10.1145\/2372251.2372260"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_041_w2aab3b7b8b1b6b1ab1b9c41Aa","doi-asserted-by":"crossref","unstructured":"V. Plevris and M. Papadrakakis, A hybrid particle swarm \u2013 gradient algorithm for global structural optimization, Comput. Aided Civ. Inf. Eng. 26 (2011), 48\u201368.","DOI":"10.1111\/j.1467-8667.2010.00664.x"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_042_w2aab3b7b8b1b6b1ab1b9c42Aa","doi-asserted-by":"crossref","unstructured":"K. Praditwong, Solving software module clustering problem by evolutionary algorithms, in: 2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE), Nakhon Pathom, pp. 154\u2013159, 2011.","DOI":"10.1109\/JCSSE.2011.5930112"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_043_w2aab3b7b8b1b6b1ab1b9c43Aa","doi-asserted-by":"crossref","unstructured":"K. Praditwong, M. Harman and X. Yao, Software module clustering as a multi-objective search problem, IEEE T. Software Eng. 37 (2011), 264\u2013282.10.1109\/TSE.2010.26","DOI":"10.1109\/TSE.2010.26"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_044_w2aab3b7b8b1b6b1ab1b9c44Aa","doi-asserted-by":"crossref","unstructured":"K. Praditwong and X. Yao, A new multi-objective evolutionary optimization algorithm: the two-archive algorithm, in: Proceedings of the International Conference on Computational Intelligence and Security, vol 1, Hong Kong, pp. 286\u2013291, 2006.","DOI":"10.1109\/ICCIAS.2006.294139"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_045_w2aab3b7b8b1b6b1ab1b9c45Aa","doi-asserted-by":"crossref","unstructured":"P. Prashanth, K. K Pattanaik and P. Singh, BAT and hybrid BAT meta-heuristic for quality of service-based web service selection. J. Intell. Syst. 26 (2017), 123\u2013137.","DOI":"10.1515\/jisys-2015-0032"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_046_w2aab3b7b8b1b6b1ab1b9c46Aa","doi-asserted-by":"crossref","unstructured":"A. Ram\u00edrez, J. R. Romero and S. Ventura, An approach for the evolutionary discovery of software architectures, Inform. Sciences305 (2015), 234\u2013255.10.1016\/j.ins.2015.01.017","DOI":"10.1016\/j.ins.2015.01.017"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_047_w2aab3b7b8b1b6b1ab1b9c47Aa","doi-asserted-by":"crossref","unstructured":"Q. Zhang and H. Li, MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE T. Evolut. Comput. 11 (2007), 712\u2013731.10.1109\/TEVC.2007.892759","DOI":"10.1109\/TEVC.2007.892759"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_048_w2aab3b7b8b1b6b1ab1b9c48Aa","doi-asserted-by":"crossref","unstructured":"E. Zitzler and S. K\u00fcnzli, Indicator-Based Selection in Multi-objective Search, Parallel Problem Solving from Nature \u2013 PPSN VIII, pp. 832\u2013842, Springer, Berlin, Germany, 2004.","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_049_w2aab3b7b8b1b6b1ab1b9c49Aa","doi-asserted-by":"crossref","unstructured":"E. Zitzler and L. Thiele, Multiobjective optimization using evolutionary algorithms \u2013 a comparative case study, in: Conference on Parallel Problem Solving from Nature (PPSN V), pp. 292\u2013301, 1998.","DOI":"10.1007\/BFb0056872"},{"key":"2025120523275896547_j_jisys-2016-0253_ref_050_w2aab3b7b8b1b6b1ab1b9c50Aa","doi-asserted-by":"crossref","unstructured":"E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca and V. G. da Fonseca, Performance assessment of multi-objective optimizers: an analysis and review, IEEE T. Evolut. Comput. 7 (2003), 117\u2013132.10.1109\/TEVC.2003.810758","DOI":"10.1109\/TEVC.2003.810758"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jisys.2018.27.issue-4\/jisys-2016-0253\/jisys-2016-0253.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0253\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0253\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:28:49Z","timestamp":1764977329000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0253\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,4]]},"references-count":50,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,7,14]]},"published-print":{"date-parts":[[2018,10,25]]}},"alternative-id":["10.1515\/jisys-2016-0253"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2016-0253","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2017,5,4]]}}}