A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment
Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential imp...
Ausführliche Beschreibung
Autor*in: |
Li, Guoping [verfasserIn] Liu, Yanmin [verfasserIn] Deng, Xicai [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2024 |
---|
Schlagwörter: |
---|
Anmerkung: |
© The Author(s) 2024 |
---|
Übergeordnetes Werk: |
Enthalten in: Complex & intelligent systems - Springer International Publishing, 2015, 10(2024), 3 vom: 11. März, Seite 4421-4444 |
---|---|
Übergeordnetes Werk: |
volume:10 ; year:2024 ; number:3 ; day:11 ; month:03 ; pages:4421-4444 |
Links: |
---|
DOI / URN: |
10.1007/s40747-024-01369-4 |
---|
Katalog-ID: |
SPR055887554 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | SPR055887554 | ||
003 | DE-627 | ||
005 | 20240517064752.0 | ||
007 | cr uuu---uuuuu | ||
008 | 240517s2024 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1007/s40747-024-01369-4 |2 doi | |
035 | |a (DE-627)SPR055887554 | ||
035 | |a (SPR)s40747-024-01369-4-e | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
100 | 1 | |a Li, Guoping |e verfasserin |4 aut | |
245 | 1 | 0 | |a A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment |
264 | 1 | |c 2024 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
500 | |a © The Author(s) 2024 | ||
520 | |a Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. | ||
650 | 4 | |a Dynamic multiobjective optimization |7 (dpeaa)DE-He213 | |
650 | 4 | |a Prediction method |7 (dpeaa)DE-He213 | |
650 | 4 | |a Subspace alignment |7 (dpeaa)DE-He213 | |
650 | 4 | |a Correlation alignment |7 (dpeaa)DE-He213 | |
700 | 1 | |a Liu, Yanmin |e verfasserin |0 (orcid)0000-0002-1571-5370 |4 aut | |
700 | 1 | |a Deng, Xicai |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Complex & intelligent systems |d Springer International Publishing, 2015 |g 10(2024), 3 vom: 11. März, Seite 4421-4444 |w (DE-627)835589269 |w (DE-600)2834740-7 |x 2198-6053 |7 nnns |
773 | 1 | 8 | |g volume:10 |g year:2024 |g number:3 |g day:11 |g month:03 |g pages:4421-4444 |
856 | 4 | 0 | |u https://dx.doi.org/10.1007/s40747-024-01369-4 |m X:SPRINGER |x Resolving-System |z kostenfrei |3 Volltext |
912 | |a SYSFLAG_0 | ||
912 | |a GBV_SPRINGER | ||
912 | |a GBV_ILN_11 | ||
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_39 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_170 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_4012 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4249 | ||
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_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4367 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 10 |j 2024 |e 3 |b 11 |c 03 |h 4421-4444 |
author_variant |
g l gl y l yl x d xd |
---|---|
matchkey_str |
article:21986053:2024----::peitomtofryaimlibetvotmztobsdnonsbpc |
hierarchy_sort_str |
2024 |
publishDate |
2024 |
allfields |
10.1007/s40747-024-01369-4 doi (DE-627)SPR055887554 (SPR)s40747-024-01369-4-e DE-627 ger DE-627 rakwb eng 004 VZ Li, Guoping verfasserin aut A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2024 Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. Dynamic multiobjective optimization (dpeaa)DE-He213 Prediction method (dpeaa)DE-He213 Subspace alignment (dpeaa)DE-He213 Correlation alignment (dpeaa)DE-He213 Liu, Yanmin verfasserin (orcid)0000-0002-1571-5370 aut Deng, Xicai verfasserin aut Enthalten in Complex & intelligent systems Springer International Publishing, 2015 10(2024), 3 vom: 11. März, Seite 4421-4444 (DE-627)835589269 (DE-600)2834740-7 2198-6053 nnns volume:10 year:2024 number:3 day:11 month:03 pages:4421-4444 https://dx.doi.org/10.1007/s40747-024-01369-4 X:SPRINGER Resolving-System kostenfrei Volltext SYSFLAG_0 GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 10 2024 3 11 03 4421-4444 |
spelling |
10.1007/s40747-024-01369-4 doi (DE-627)SPR055887554 (SPR)s40747-024-01369-4-e DE-627 ger DE-627 rakwb eng 004 VZ Li, Guoping verfasserin aut A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2024 Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. Dynamic multiobjective optimization (dpeaa)DE-He213 Prediction method (dpeaa)DE-He213 Subspace alignment (dpeaa)DE-He213 Correlation alignment (dpeaa)DE-He213 Liu, Yanmin verfasserin (orcid)0000-0002-1571-5370 aut Deng, Xicai verfasserin aut Enthalten in Complex & intelligent systems Springer International Publishing, 2015 10(2024), 3 vom: 11. März, Seite 4421-4444 (DE-627)835589269 (DE-600)2834740-7 2198-6053 nnns volume:10 year:2024 number:3 day:11 month:03 pages:4421-4444 https://dx.doi.org/10.1007/s40747-024-01369-4 X:SPRINGER Resolving-System kostenfrei Volltext SYSFLAG_0 GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 10 2024 3 11 03 4421-4444 |
allfields_unstemmed |
10.1007/s40747-024-01369-4 doi (DE-627)SPR055887554 (SPR)s40747-024-01369-4-e DE-627 ger DE-627 rakwb eng 004 VZ Li, Guoping verfasserin aut A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2024 Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. Dynamic multiobjective optimization (dpeaa)DE-He213 Prediction method (dpeaa)DE-He213 Subspace alignment (dpeaa)DE-He213 Correlation alignment (dpeaa)DE-He213 Liu, Yanmin verfasserin (orcid)0000-0002-1571-5370 aut Deng, Xicai verfasserin aut Enthalten in Complex & intelligent systems Springer International Publishing, 2015 10(2024), 3 vom: 11. März, Seite 4421-4444 (DE-627)835589269 (DE-600)2834740-7 2198-6053 nnns volume:10 year:2024 number:3 day:11 month:03 pages:4421-4444 https://dx.doi.org/10.1007/s40747-024-01369-4 X:SPRINGER Resolving-System kostenfrei Volltext SYSFLAG_0 GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 10 2024 3 11 03 4421-4444 |
allfieldsGer |
10.1007/s40747-024-01369-4 doi (DE-627)SPR055887554 (SPR)s40747-024-01369-4-e DE-627 ger DE-627 rakwb eng 004 VZ Li, Guoping verfasserin aut A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2024 Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. Dynamic multiobjective optimization (dpeaa)DE-He213 Prediction method (dpeaa)DE-He213 Subspace alignment (dpeaa)DE-He213 Correlation alignment (dpeaa)DE-He213 Liu, Yanmin verfasserin (orcid)0000-0002-1571-5370 aut Deng, Xicai verfasserin aut Enthalten in Complex & intelligent systems Springer International Publishing, 2015 10(2024), 3 vom: 11. März, Seite 4421-4444 (DE-627)835589269 (DE-600)2834740-7 2198-6053 nnns volume:10 year:2024 number:3 day:11 month:03 pages:4421-4444 https://dx.doi.org/10.1007/s40747-024-01369-4 X:SPRINGER Resolving-System kostenfrei Volltext SYSFLAG_0 GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 10 2024 3 11 03 4421-4444 |
allfieldsSound |
10.1007/s40747-024-01369-4 doi (DE-627)SPR055887554 (SPR)s40747-024-01369-4-e DE-627 ger DE-627 rakwb eng 004 VZ Li, Guoping verfasserin aut A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment 2024 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2024 Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. Dynamic multiobjective optimization (dpeaa)DE-He213 Prediction method (dpeaa)DE-He213 Subspace alignment (dpeaa)DE-He213 Correlation alignment (dpeaa)DE-He213 Liu, Yanmin verfasserin (orcid)0000-0002-1571-5370 aut Deng, Xicai verfasserin aut Enthalten in Complex & intelligent systems Springer International Publishing, 2015 10(2024), 3 vom: 11. März, Seite 4421-4444 (DE-627)835589269 (DE-600)2834740-7 2198-6053 nnns volume:10 year:2024 number:3 day:11 month:03 pages:4421-4444 https://dx.doi.org/10.1007/s40747-024-01369-4 X:SPRINGER Resolving-System kostenfrei Volltext SYSFLAG_0 GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 10 2024 3 11 03 4421-4444 |
language |
English |
source |
Enthalten in Complex & intelligent systems 10(2024), 3 vom: 11. März, Seite 4421-4444 volume:10 year:2024 number:3 day:11 month:03 pages:4421-4444 |
sourceStr |
Enthalten in Complex & intelligent systems 10(2024), 3 vom: 11. März, Seite 4421-4444 volume:10 year:2024 number:3 day:11 month:03 pages:4421-4444 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Dynamic multiobjective optimization Prediction method Subspace alignment Correlation alignment |
dewey-raw |
004 |
isfreeaccess_bool |
true |
container_title |
Complex & intelligent systems |
authorswithroles_txt_mv |
Li, Guoping @@aut@@ Liu, Yanmin @@aut@@ Deng, Xicai @@aut@@ |
publishDateDaySort_date |
2024-03-11T00:00:00Z |
hierarchy_top_id |
835589269 |
dewey-sort |
14 |
id |
SPR055887554 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">SPR055887554</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240517064752.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240517s2024 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s40747-024-01369-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR055887554</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s40747-024-01369-4-e</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">rakwb</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="100" ind1="1" ind2=" "><subfield code="a">Li, Guoping</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</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="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2024</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic multiobjective optimization</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prediction method</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Subspace alignment</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Correlation alignment</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Yanmin</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-1571-5370</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Deng, Xicai</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">Complex & intelligent systems</subfield><subfield code="d">Springer International Publishing, 2015</subfield><subfield code="g">10(2024), 3 vom: 11. März, Seite 4421-4444</subfield><subfield code="w">(DE-627)835589269</subfield><subfield code="w">(DE-600)2834740-7</subfield><subfield code="x">2198-6053</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:10</subfield><subfield code="g">year:2024</subfield><subfield code="g">number:3</subfield><subfield code="g">day:11</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:4421-4444</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s40747-024-01369-4</subfield><subfield code="m">X:SPRINGER</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_0</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_39</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_63</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_95</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_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</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_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</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_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</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_4126</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_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_4335</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_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">10</subfield><subfield code="j">2024</subfield><subfield code="e">3</subfield><subfield code="b">11</subfield><subfield code="c">03</subfield><subfield code="h">4421-4444</subfield></datafield></record></collection>
|
author |
Li, Guoping |
spellingShingle |
Li, Guoping ddc 004 misc Dynamic multiobjective optimization misc Prediction method misc Subspace alignment misc Correlation alignment A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment |
authorStr |
Li, Guoping |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)835589269 |
format |
electronic Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut |
collection |
springer |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
2198-6053 |
topic_title |
004 VZ A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment Dynamic multiobjective optimization (dpeaa)DE-He213 Prediction method (dpeaa)DE-He213 Subspace alignment (dpeaa)DE-He213 Correlation alignment (dpeaa)DE-He213 |
topic |
ddc 004 misc Dynamic multiobjective optimization misc Prediction method misc Subspace alignment misc Correlation alignment |
topic_unstemmed |
ddc 004 misc Dynamic multiobjective optimization misc Prediction method misc Subspace alignment misc Correlation alignment |
topic_browse |
ddc 004 misc Dynamic multiobjective optimization misc Prediction method misc Subspace alignment misc Correlation alignment |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Complex & intelligent systems |
hierarchy_parent_id |
835589269 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Complex & intelligent systems |
isfreeaccess_txt |
true |
familylinks_str_mv |
(DE-627)835589269 (DE-600)2834740-7 |
title |
A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment |
ctrlnum |
(DE-627)SPR055887554 (SPR)s40747-024-01369-4-e |
title_full |
A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment |
author_sort |
Li, Guoping |
journal |
Complex & intelligent systems |
journalStr |
Complex & intelligent systems |
lang_code |
eng |
isOA_bool |
true |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2024 |
contenttype_str_mv |
txt |
container_start_page |
4421 |
author_browse |
Li, Guoping Liu, Yanmin Deng, Xicai |
container_volume |
10 |
class |
004 VZ |
format_se |
Elektronische Aufsätze |
author-letter |
Li, Guoping |
doi_str_mv |
10.1007/s40747-024-01369-4 |
normlink |
(ORCID)0000-0002-1571-5370 |
normlink_prefix_str_mv |
(orcid)0000-0002-1571-5370 |
dewey-full |
004 |
author2-role |
verfasserin |
title_sort |
a prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment |
title_auth |
A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment |
abstract |
Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. © The Author(s) 2024 |
abstractGer |
Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. © The Author(s) 2024 |
abstract_unstemmed |
Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms. © The Author(s) 2024 |
collection_details |
SYSFLAG_0 GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 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_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
container_issue |
3 |
title_short |
A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment |
url |
https://dx.doi.org/10.1007/s40747-024-01369-4 |
remote_bool |
true |
author2 |
Liu, Yanmin Deng, Xicai |
author2Str |
Liu, Yanmin Deng, Xicai |
ppnlink |
835589269 |
mediatype_str_mv |
c |
isOA_txt |
true |
hochschulschrift_bool |
false |
doi_str |
10.1007/s40747-024-01369-4 |
up_date |
2024-07-03T18:42:13.391Z |
_version_ |
1803584414305746944 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">SPR055887554</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240517064752.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240517s2024 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s40747-024-01369-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR055887554</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s40747-024-01369-4-e</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">rakwb</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="100" ind1="1" ind2=" "><subfield code="a">Li, Guoping</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A prediction method for dynamic multiobjective optimization based on joint subspace and correlation alignment</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2024</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</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="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2024</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Dynamic multiobjective optimization is a significant challenge in accurately capturing changes in Pareto optimal sets (PS), encompassing both location and manifold changes. Existing approaches primarily focus on tracking changes in the location of the PS, often overlooking the potential impact of changes in the PS manifold, which can be decomposed into rotation and distortion changes. Such oversights can lead to a reduction in the overall performance of an algorithm. To address this issue, a prediction method based on joint subspace and correlation alignment (PSCA) is proposed. PSCA leverages a subspace alignment strategy to effectively capture rotation change in the PS manifold while employing a correlation alignment strategy to capture distortion change. By integrating these two strategies, a quasi-initial population is generated that embodies the captured rotation and distortion change patterns in a new environment. Then, the promising individuals are selected from this quasi-initial population based on their nondominated relations and crowding degree to form the initial population in the new environment. To evaluate the effectiveness of PSCA, we conduct experiments on fourteen benchmark problems. The experimental results demonstrate that PSCA achieves significant improvements over several state-of-the-art algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic multiobjective optimization</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prediction method</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Subspace alignment</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Correlation alignment</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liu, Yanmin</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-1571-5370</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Deng, Xicai</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">Complex & intelligent systems</subfield><subfield code="d">Springer International Publishing, 2015</subfield><subfield code="g">10(2024), 3 vom: 11. März, Seite 4421-4444</subfield><subfield code="w">(DE-627)835589269</subfield><subfield code="w">(DE-600)2834740-7</subfield><subfield code="x">2198-6053</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:10</subfield><subfield code="g">year:2024</subfield><subfield code="g">number:3</subfield><subfield code="g">day:11</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:4421-4444</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s40747-024-01369-4</subfield><subfield code="m">X:SPRINGER</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_0</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_39</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_63</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_95</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_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</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_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</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_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</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_4126</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_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_4335</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_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">10</subfield><subfield code="j">2024</subfield><subfield code="e">3</subfield><subfield code="b">11</subfield><subfield code="c">03</subfield><subfield code="h">4421-4444</subfield></datafield></record></collection>
|
score |
7.3995314 |