MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering
The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topolo...
Ausführliche Beschreibung
Autor*in: |
Kang, Yan [verfasserIn] Xie, Wentao [verfasserIn] Wang, Xiaopeng [verfasserIn] Wang, Haining [verfasserIn] Wang, Xinchao [verfasserIn] Li, Jinyuan [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2023 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: Expert systems with applications - Amsterdam [u.a.] : Elsevier Science, 1990, 226 |
---|---|
Übergeordnetes Werk: |
volume:226 |
DOI / URN: |
10.1016/j.eswa.2023.120207 |
---|
Katalog-ID: |
ELV009789308 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | ELV009789308 | ||
003 | DE-627 | ||
005 | 20231001073047.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230530s2023 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.eswa.2023.120207 |2 doi | |
035 | |a (DE-627)ELV009789308 | ||
035 | |a (ELSEVIER)S0957-4174(23)00709-1 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
084 | |a 54.72 |2 bkl | ||
100 | 1 | |a Kang, Yan |e verfasserin |0 (orcid)0000-0001-6969-0562 |4 aut | |
245 | 1 | 0 | |a MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering |
264 | 1 | |c 2023 | |
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. | ||
650 | 4 | |a Software modularization | |
650 | 4 | |a Multi-objective optimization | |
650 | 4 | |a Differential evolution algorithm | |
650 | 4 | |a Software architecture | |
650 | 4 | |a Software understanding | |
650 | 4 | |a Software system maintenance | |
700 | 1 | |a Xie, Wentao |e verfasserin |4 aut | |
700 | 1 | |a Wang, Xiaopeng |e verfasserin |4 aut | |
700 | 1 | |a Wang, Haining |e verfasserin |0 (orcid)0000-0002-5281-6090 |4 aut | |
700 | 1 | |a Wang, Xinchao |e verfasserin |4 aut | |
700 | 1 | |a Li, Jinyuan |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Expert systems with applications |d Amsterdam [u.a.] : Elsevier Science, 1990 |g 226 |h Online-Ressource |w (DE-627)320577961 |w (DE-600)2017237-0 |w (DE-576)11481807X |7 nnns |
773 | 1 | 8 | |g volume:226 |
912 | |a GBV_USEFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a SYSFLAG_U | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_101 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_187 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2001 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2007 | ||
912 | |a GBV_ILN_2008 | ||
912 | |a GBV_ILN_2009 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2026 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2055 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2106 | ||
912 | |a GBV_ILN_2110 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2232 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
912 | |a GBV_ILN_4700 | ||
936 | b | k | |a 54.72 |j Künstliche Intelligenz |q VZ |
951 | |a AR | ||
952 | |d 226 |
author_variant |
y k yk w x wx x w xw h w hw x w xw j l jl |
---|---|
matchkey_str |
kangyanxiewentaowangxiaopengwanghainingw:2023----:oidaolbrtvmlibetvifrainhrndagrt |
hierarchy_sort_str |
2023 |
bklnumber |
54.72 |
publishDate |
2023 |
allfields |
10.1016/j.eswa.2023.120207 doi (DE-627)ELV009789308 (ELSEVIER)S0957-4174(23)00709-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Kang, Yan verfasserin (orcid)0000-0001-6969-0562 aut MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. Software modularization Multi-objective optimization Differential evolution algorithm Software architecture Software understanding Software system maintenance Xie, Wentao verfasserin aut Wang, Xiaopeng verfasserin aut Wang, Haining verfasserin (orcid)0000-0002-5281-6090 aut Wang, Xinchao verfasserin aut Li, Jinyuan verfasserin aut Enthalten in Expert systems with applications Amsterdam [u.a.] : Elsevier Science, 1990 226 Online-Ressource (DE-627)320577961 (DE-600)2017237-0 (DE-576)11481807X nnns volume:226 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 226 |
spelling |
10.1016/j.eswa.2023.120207 doi (DE-627)ELV009789308 (ELSEVIER)S0957-4174(23)00709-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Kang, Yan verfasserin (orcid)0000-0001-6969-0562 aut MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. Software modularization Multi-objective optimization Differential evolution algorithm Software architecture Software understanding Software system maintenance Xie, Wentao verfasserin aut Wang, Xiaopeng verfasserin aut Wang, Haining verfasserin (orcid)0000-0002-5281-6090 aut Wang, Xinchao verfasserin aut Li, Jinyuan verfasserin aut Enthalten in Expert systems with applications Amsterdam [u.a.] : Elsevier Science, 1990 226 Online-Ressource (DE-627)320577961 (DE-600)2017237-0 (DE-576)11481807X nnns volume:226 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 226 |
allfields_unstemmed |
10.1016/j.eswa.2023.120207 doi (DE-627)ELV009789308 (ELSEVIER)S0957-4174(23)00709-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Kang, Yan verfasserin (orcid)0000-0001-6969-0562 aut MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. Software modularization Multi-objective optimization Differential evolution algorithm Software architecture Software understanding Software system maintenance Xie, Wentao verfasserin aut Wang, Xiaopeng verfasserin aut Wang, Haining verfasserin (orcid)0000-0002-5281-6090 aut Wang, Xinchao verfasserin aut Li, Jinyuan verfasserin aut Enthalten in Expert systems with applications Amsterdam [u.a.] : Elsevier Science, 1990 226 Online-Ressource (DE-627)320577961 (DE-600)2017237-0 (DE-576)11481807X nnns volume:226 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 226 |
allfieldsGer |
10.1016/j.eswa.2023.120207 doi (DE-627)ELV009789308 (ELSEVIER)S0957-4174(23)00709-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Kang, Yan verfasserin (orcid)0000-0001-6969-0562 aut MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. Software modularization Multi-objective optimization Differential evolution algorithm Software architecture Software understanding Software system maintenance Xie, Wentao verfasserin aut Wang, Xiaopeng verfasserin aut Wang, Haining verfasserin (orcid)0000-0002-5281-6090 aut Wang, Xinchao verfasserin aut Li, Jinyuan verfasserin aut Enthalten in Expert systems with applications Amsterdam [u.a.] : Elsevier Science, 1990 226 Online-Ressource (DE-627)320577961 (DE-600)2017237-0 (DE-576)11481807X nnns volume:226 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 226 |
allfieldsSound |
10.1016/j.eswa.2023.120207 doi (DE-627)ELV009789308 (ELSEVIER)S0957-4174(23)00709-1 DE-627 ger DE-627 rda eng 004 VZ 54.72 bkl Kang, Yan verfasserin (orcid)0000-0001-6969-0562 aut MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering 2023 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. Software modularization Multi-objective optimization Differential evolution algorithm Software architecture Software understanding Software system maintenance Xie, Wentao verfasserin aut Wang, Xiaopeng verfasserin aut Wang, Haining verfasserin (orcid)0000-0002-5281-6090 aut Wang, Xinchao verfasserin aut Li, Jinyuan verfasserin aut Enthalten in Expert systems with applications Amsterdam [u.a.] : Elsevier Science, 1990 226 Online-Ressource (DE-627)320577961 (DE-600)2017237-0 (DE-576)11481807X nnns volume:226 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.72 Künstliche Intelligenz VZ AR 226 |
language |
English |
source |
Enthalten in Expert systems with applications 226 volume:226 |
sourceStr |
Enthalten in Expert systems with applications 226 volume:226 |
format_phy_str_mv |
Article |
bklname |
Künstliche Intelligenz |
institution |
findex.gbv.de |
topic_facet |
Software modularization Multi-objective optimization Differential evolution algorithm Software architecture Software understanding Software system maintenance |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Expert systems with applications |
authorswithroles_txt_mv |
Kang, Yan @@aut@@ Xie, Wentao @@aut@@ Wang, Xiaopeng @@aut@@ Wang, Haining @@aut@@ Wang, Xinchao @@aut@@ Li, Jinyuan @@aut@@ |
publishDateDaySort_date |
2023-01-01T00:00:00Z |
hierarchy_top_id |
320577961 |
dewey-sort |
14 |
id |
ELV009789308 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV009789308</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231001073047.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230530s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.eswa.2023.120207</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV009789308</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0957-4174(23)00709-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kang, Yan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-6969-0562</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software modularization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-objective optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Differential evolution algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software understanding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software system maintenance</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xie, Wentao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Xiaopeng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Haining</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-5281-6090</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Xinchao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Jinyuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Expert systems with applications</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier Science, 1990</subfield><subfield code="g">226</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)320577961</subfield><subfield code="w">(DE-600)2017237-0</subfield><subfield code="w">(DE-576)11481807X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:226</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72</subfield><subfield code="j">Künstliche Intelligenz</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">226</subfield></datafield></record></collection>
|
author |
Kang, Yan |
spellingShingle |
Kang, Yan ddc 004 bkl 54.72 misc Software modularization misc Multi-objective optimization misc Differential evolution algorithm misc Software architecture misc Software understanding misc Software system maintenance MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering |
authorStr |
Kang, Yan |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)320577961 |
format |
electronic Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut aut aut aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
topic_title |
004 VZ 54.72 bkl MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering Software modularization Multi-objective optimization Differential evolution algorithm Software architecture Software understanding Software system maintenance |
topic |
ddc 004 bkl 54.72 misc Software modularization misc Multi-objective optimization misc Differential evolution algorithm misc Software architecture misc Software understanding misc Software system maintenance |
topic_unstemmed |
ddc 004 bkl 54.72 misc Software modularization misc Multi-objective optimization misc Differential evolution algorithm misc Software architecture misc Software understanding misc Software system maintenance |
topic_browse |
ddc 004 bkl 54.72 misc Software modularization misc Multi-objective optimization misc Differential evolution algorithm misc Software architecture misc Software understanding misc Software system maintenance |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Expert systems with applications |
hierarchy_parent_id |
320577961 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Expert systems with applications |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)320577961 (DE-600)2017237-0 (DE-576)11481807X |
title |
MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering |
ctrlnum |
(DE-627)ELV009789308 (ELSEVIER)S0957-4174(23)00709-1 |
title_full |
MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering |
author_sort |
Kang, Yan |
journal |
Expert systems with applications |
journalStr |
Expert systems with applications |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2023 |
contenttype_str_mv |
zzz |
author_browse |
Kang, Yan Xie, Wentao Wang, Xiaopeng Wang, Haining Wang, Xinchao Li, Jinyuan |
container_volume |
226 |
class |
004 VZ 54.72 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Kang, Yan |
doi_str_mv |
10.1016/j.eswa.2023.120207 |
normlink |
(ORCID)0000-0001-6969-0562 (ORCID)0000-0002-5281-6090 |
normlink_prefix_str_mv |
(orcid)0000-0001-6969-0562 (orcid)0000-0002-5281-6090 |
dewey-full |
004 |
author2-role |
verfasserin |
title_sort |
mopisde: a collaborative multi-objective information-sharing de algorithm for software clustering |
title_auth |
MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering |
abstract |
The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. |
abstractGer |
The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. |
abstract_unstemmed |
The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods. |
collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 |
title_short |
MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering |
remote_bool |
true |
author2 |
Xie, Wentao Wang, Xiaopeng Wang, Haining Wang, Xinchao Li, Jinyuan |
author2Str |
Xie, Wentao Wang, Xiaopeng Wang, Haining Wang, Xinchao Li, Jinyuan |
ppnlink |
320577961 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.eswa.2023.120207 |
up_date |
2024-07-07T00:21:39.231Z |
_version_ |
1803877560334942208 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV009789308</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231001073047.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230530s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.eswa.2023.120207</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV009789308</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0957-4174(23)00709-1</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kang, Yan</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-6969-0562</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">MOPISDE: A collaborative multi-objective information-sharing DE algorithm for software clustering</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The software module clustering problem (SMCP) aims to improve the internal quality of software while helping software engineers understand the system architecture and facilitating software system maintenance. However, most current methods ignore modular stability in software evolution and the topological properties of the software architecture and hence obtain decompositions much worse than the expert. Therefore, we propose a collaborative multi-objective information-sharing differential evolution (MOPISDE) algorithm for SMCP with global stability and path complexity as two new objective functions. Specifically, two new concepts are defined for SMCP as two objectives of populations and modular quality (MQ) as an objective of the third population. Population-sharing technology is designed to collaboratively exchange information among different populations to address the lack of diversity in a single population. An information-sharing three-stage differential evolution strategy is presented to reduce the search space and improve search performance by sharing good substructures among elite individuals. New mutation strategies are proposed to utilize the different substructures between two random individuals as a new community to further improve the search performance. Experiments on various projects demonstrate the superiority of the proposed algorithm. The proposed method not only has fast convergence but also provides stable and accurate modularity that is somewhat closer to expert decomposition than that of other methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software modularization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-objective optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Differential evolution algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software understanding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software system maintenance</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xie, Wentao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Xiaopeng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Haining</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-5281-6090</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Xinchao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Jinyuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Expert systems with applications</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier Science, 1990</subfield><subfield code="g">226</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)320577961</subfield><subfield code="w">(DE-600)2017237-0</subfield><subfield code="w">(DE-576)11481807X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:226</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72</subfield><subfield code="j">Künstliche Intelligenz</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">226</subfield></datafield></record></collection>
|
score |
7.400194 |