Multiobjective Complex Network Clustering Based on Dynamical Decomposition Particle Swarm Optimization
Clustering is a basic tool applied to complex networks. However, the clustering of complex networks is often based on a single objective function, which can obtain insufficient clustering effects. To address the insufficiencies of single objective complex network clustering, multiobjective complex n...
Saved in:
| Published in: | IEEE access Vol. 8; pp. 32341 - 32352 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Piscataway
IEEE
2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 2169-3536, 2169-3536 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Clustering is a basic tool applied to complex networks. However, the clustering of complex networks is often based on a single objective function, which can obtain insufficient clustering effects. To address the insufficiencies of single objective complex network clustering, multiobjective complex network clustering was proposed. In this article, to improve multiobjective complex network clustering, we prove the superiority of dynamic decomposition mathematically and propose a parallel discrete particle swarm optimization algorithm based on dynamic decomposition (DDDPSO). First, solutions are obtained at different levels by optimizing the objective functions of parallel subpopulations. Second, the decomposition space is divided dynamically by the reference vector of dynamic decomposition. Particle swarms are used to search for optimal solutions in the partitioned dynamic spaces. Finally, the individuals in the particle swarm are sorted according to the obtained solutions to obtain individuals with good convergence and diversity. We conduct comparisons with many state-of-the-art algorithms on many widely used test datasets to test the DDDPSO. The experimental results show the effectiveness of the proposed approach for complex network clustering. |
|---|---|
| AbstractList | Clustering is a basic tool applied to complex networks. However, the clustering of complex networks is often based on a single objective function, which can obtain insufficient clustering effects. To address the insufficiencies of single objective complex network clustering, multiobjective complex network clustering was proposed. In this article, to improve multiobjective complex network clustering, we prove the superiority of dynamic decomposition mathematically and propose a parallel discrete particle swarm optimization algorithm based on dynamic decomposition (DDDPSO). First, solutions are obtained at different levels by optimizing the objective functions of parallel subpopulations. Second, the decomposition space is divided dynamically by the reference vector of dynamic decomposition. Particle swarms are used to search for optimal solutions in the partitioned dynamic spaces. Finally, the individuals in the particle swarm are sorted according to the obtained solutions to obtain individuals with good convergence and diversity. We conduct comparisons with many state-of-the-art algorithms on many widely used test datasets to test the DDDPSO. The experimental results show the effectiveness of the proposed approach for complex network clustering. |
| Author | Gao, Tiaokang Cao, Bin Zhang, Mengxuan |
| Author_xml | – sequence: 1 givenname: Tiaokang orcidid: 0000-0002-4394-2001 surname: Gao fullname: Gao, Tiaokang email: 201722102013@stu.hebut.edu.cn organization: School of Artificial Intelligence, Hebei University of Technology, Tianjin, China – sequence: 2 givenname: Bin orcidid: 0000-0003-4558-9501 surname: Cao fullname: Cao, Bin email: caobin@scse.hebut.edu.cn organization: School of Artificial Intelligence, Hebei University of Technology, Tianjin, China – sequence: 3 givenname: Mengxuan orcidid: 0000-0002-5794-0779 surname: Zhang fullname: Zhang, Mengxuan organization: Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education, Xidian University, Xi'an, China |
| BookMark | eNp9kVFPHCEUhUmjSa31F_hC0ufdMsAw8GhHW01sNVn7TC4MY9jODFtgtfrryzrbpumDvEAu53w5N-cdOpjC5BA6rciyqoj6eNa2F6vVkhJKllQ1tKLsDTqilVALVjNx8M_7LTpJaU3KkWVUN0eo_7odsg9m7Wz2Dw63YdwM7hf-5vJjiD9wO2xTdtFP9_gTJNfhMOHzpwlGb2HA584WfUi-ICZ8CzF7Ozi8eoQ44ptN9qN_ht3fe3TYw5Dcyf4-Rt8_X9y1l4vrmy9X7dn1wnIi88III_qSv-fK9cR0jQFaKSoa1XAqemlM0XHSSSotSCBWKM4IpQYMNVYYdoyuZm4XYK030Y8Qn3QAr18GId7rfUgN3BCiQHRsh7SuEI2RQvWc1F0nSWF9mFmbGH5uXcp6HbZxKvE15TVXlZINLyo1q2wMKUXXa-vzy845gh90RfSuJT23pHct6X1Lxcv-8_5J_LrrdHZ559xfh1SyZkSy38ZMoR8 |
| CODEN | IAECCG |
| CitedBy_id | crossref_primary_10_1016_j_neucom_2021_12_072 |
| Cites_doi | 10.1109/TGRS.2019.2917001 10.1109/TII.2017.2677939 10.1109/TSP.2014.2345355 10.1109/TSP.2019.2896246 10.1109/TKDE.2017.2700304 10.1109/TCYB.2018.2860284 10.1109/TMECH.2016.2598606 10.1073/pnas.122653799 10.1063/1.2732162 10.1145/366622.366644 10.1109/ACCESS.2018.2822844 10.1007/s11047-017-9633-2 10.1109/CESYS.2017.8321273 10.1073/pnas.0400054101 10.1109/TCSI.2014.2333677 10.1109/TCBB.2016.2618380 10.1088/1367-2630/11/3/033015 10.1109/TSMCB.2012.2202647 10.1109/TEVC.2007.892759 10.1109/TCSS.2018.2879494 10.1140/epjb/e2004-00125-x 10.1109/TCYB.2018.2871673 10.1109/TEVC.2018.2865590 10.1016/j.asoc.2011.10.005 10.1103/PhysRevE.78.046110 10.1109/TCYB.2017.2756874 10.1073/pnas.0605965104 10.1016/j.asoc.2018.04.037 10.1103/PhysRevE.84.056101 10.1073/pnas.0706851105 10.1109/TCYB.2017.2710133 10.1109/DSD.2008.21 10.1103/PhysRevE.80.016114 10.1109/TEVC.2013.2260862 10.1109/TKDE.2018.2803818 10.1109/TKDE.2016.2594068 10.1109/TITS.2016.2638898 10.1109/TEVC.2011.2161090 10.1109/TIT.2015.2478440 10.1016/j.swevo.2017.10.009 10.1016/j.physa.2012.03.021 10.1109/TEVC.2016.2519378 10.1109/TCYB.2017.2728120 10.1109/TCBB.2016.2638824 10.1109/TCBB.2017.2652453 10.1109/TPDS.2017.2671868 10.1103/PhysRevE.77.036109 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D DOA |
| DOI | 10.1109/ACCESS.2020.2972123 |
| DatabaseName | IEEE Xplore (IEEE) IEEE Xplore Open Access (Activated by CARLI) IEEE All-Society Periodicals Package (ASPP) Online IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts METADEX Technology Research Database Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Materials Research Database Engineered Materials Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace METADEX Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-3536 |
| EndPage | 32352 |
| ExternalDocumentID | oai_doaj_org_article_a4b009a6d34040ce8cabb869f405dd80 10_1109_ACCESS_2020_2972123 8985308 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Xidian University grantid: IPIU2019003 funderid: 10.13039/501100005320 – fundername: Opening Project of Guangdong Province Key Laboratory of Computational Science at the Sun Yat-sen University grantid: 2018002 – fundername: National Natural Science Foundation of China grantid: 61836009 funderid: 10.13039/501100001809 – fundername: National Natural Science Foundation of China grantid: 61976242 funderid: 10.13039/501100001809 |
| GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV AGSQL ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c408t-b6b6f123f49ef0bd7ba21926797426f8bbc4040d828ca8a0c6943022bab2bc6b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000525419100044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2169-3536 |
| IngestDate | Fri Oct 03 12:52:58 EDT 2025 Sun Nov 30 04:50:25 EST 2025 Tue Nov 18 21:00:23 EST 2025 Sat Nov 29 02:41:55 EST 2025 Wed Aug 27 02:35:22 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0/legalcode |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c408t-b6b6f123f49ef0bd7ba21926797426f8bbc4040d828ca8a0c6943022bab2bc6b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-4394-2001 0000-0003-4558-9501 0000-0002-5794-0779 |
| OpenAccessLink | https://ieeexplore.ieee.org/document/8985308 |
| PQID | 2454919874 |
| PQPubID | 4845423 |
| PageCount | 12 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_a4b009a6d34040ce8cabb869f405dd80 crossref_primary_10_1109_ACCESS_2020_2972123 proquest_journals_2454919874 crossref_citationtrail_10_1109_ACCESS_2020_2972123 ieee_primary_8985308 |
| PublicationCentury | 2000 |
| PublicationDate | 20200000 2020-00-00 20200101 2020-01-01 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – year: 2020 text: 20200000 |
| PublicationDecade | 2020 |
| PublicationPlace | Piscataway |
| PublicationPlace_xml | – name: Piscataway |
| PublicationTitle | IEEE access |
| PublicationTitleAbbrev | Access |
| PublicationYear | 2020 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref15 ref11 ref10 ref17 ref16 ref19 ref18 ref46 ref45 ref47 ref42 ref41 ref44 ref43 ref49 ref8 cheng (ref20) 2018; 69 ref7 ref9 ref4 ref3 ref6 ref5 ref40 ref35 ref34 ref37 ref36 ref30 ref33 danon (ref48) 2005; 2005 ref32 ref2 ref39 ref38 su (ref1) 2013; 43 ref24 ref23 ref26 ref25 ref22 ref21 girvan (ref31) 2002; 99 ref28 ref27 ref29 pizzuti (ref14) 2008; 5199 |
| References_xml | – ident: ref26 doi: 10.1109/TGRS.2019.2917001 – ident: ref13 doi: 10.1109/TII.2017.2677939 – ident: ref3 doi: 10.1109/TSP.2014.2345355 – ident: ref28 doi: 10.1109/TSP.2019.2896246 – ident: ref27 doi: 10.1109/TKDE.2017.2700304 – ident: ref4 doi: 10.1109/TCYB.2018.2860284 – ident: ref40 doi: 10.1109/TMECH.2016.2598606 – volume: 99 start-page: 7821 year: 2002 ident: ref31 article-title: Community structure in social and biological networks publication-title: Proc Nat Acad Sci USA doi: 10.1073/pnas.122653799 – ident: ref36 doi: 10.1063/1.2732162 – ident: ref42 doi: 10.1145/366622.366644 – ident: ref37 doi: 10.1109/ACCESS.2018.2822844 – ident: ref38 doi: 10.1007/s11047-017-9633-2 – ident: ref46 doi: 10.1109/CESYS.2017.8321273 – ident: ref30 doi: 10.1073/pnas.0400054101 – ident: ref8 doi: 10.1109/TCSI.2014.2333677 – ident: ref39 doi: 10.1109/TCBB.2016.2618380 – ident: ref35 doi: 10.1088/1367-2630/11/3/033015 – volume: 2005 year: 2005 ident: ref48 article-title: Comparing community structure identifcation publication-title: J Stat Phys – volume: 43 start-page: 394 year: 2013 ident: ref1 article-title: Decentralized adaptive pinning control for cluster synchronization of complex dynamical networks publication-title: IEEE Trans Cybern doi: 10.1109/TSMCB.2012.2202647 – ident: ref19 doi: 10.1109/TEVC.2007.892759 – ident: ref7 doi: 10.1109/TCSS.2018.2879494 – ident: ref47 doi: 10.1140/epjb/e2004-00125-x – ident: ref22 doi: 10.1109/TCYB.2018.2871673 – ident: ref41 doi: 10.1109/TEVC.2018.2865590 – ident: ref17 doi: 10.1016/j.asoc.2011.10.005 – ident: ref49 doi: 10.1103/PhysRevE.78.046110 – ident: ref23 doi: 10.1109/TCYB.2017.2756874 – ident: ref33 doi: 10.1073/pnas.0605965104 – volume: 69 start-page: 357 year: 2018 ident: ref20 article-title: A local information based multi-objective evolutionary algorithm for community detection in complex networks publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2018.04.037 – volume: 5199 start-page: 1081 year: 2008 ident: ref14 article-title: GA-Net: A genetic algorithm for community detection insocial networks publication-title: Proc Int Conf Parallel Problem Solving Nature – ident: ref15 doi: 10.1103/PhysRevE.84.056101 – ident: ref44 doi: 10.1073/pnas.0706851105 – ident: ref24 doi: 10.1109/TCYB.2017.2710133 – ident: ref45 doi: 10.1109/DSD.2008.21 – ident: ref32 doi: 10.1103/PhysRevE.80.016114 – ident: ref18 doi: 10.1109/TEVC.2013.2260862 – ident: ref6 doi: 10.1109/TKDE.2018.2803818 – ident: ref9 doi: 10.1109/TKDE.2016.2594068 – ident: ref11 doi: 10.1109/TITS.2016.2638898 – ident: ref16 doi: 10.1109/TEVC.2011.2161090 – ident: ref29 doi: 10.1109/TIT.2015.2478440 – ident: ref21 doi: 10.1016/j.swevo.2017.10.009 – ident: ref43 doi: 10.1016/j.physa.2012.03.021 – ident: ref10 doi: 10.1109/TEVC.2016.2519378 – ident: ref25 doi: 10.1109/TCYB.2017.2728120 – ident: ref5 doi: 10.1109/TCBB.2016.2638824 – ident: ref12 doi: 10.1109/TCBB.2017.2652453 – ident: ref2 doi: 10.1109/TPDS.2017.2671868 – ident: ref34 doi: 10.1103/PhysRevE.77.036109 |
| SSID | ssj0000816957 |
| Score | 2.167944 |
| Snippet | Clustering is a basic tool applied to complex networks. However, the clustering of complex networks is often based on a single objective function, which can... |
| SourceID | doaj proquest crossref ieee |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 32341 |
| SubjectTerms | Algorithms Clustering Clustering algorithms complex network clustering Complex networks Decomposition discrete particle swarm dynamic decomposition Heuristic algorithms Linear programming Mathematical analysis Multiobjective optimization Optimization Particle swarm optimization |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1JT1sxELZQ1AMcKlpABCjyoUcecfwcL0cIRT1UKRKLcrO8Sq2yoBCgP7_jhSgIiV56ffLy_Hk89meNv0HoK3GKmdarJlgi0pMc3xgReWOAq0RmWJT5vuPuhxiN5HisrtZSfaWYsCIPXIDrGQaGoQz3LQN7c0E6Y63kKsJJw3uZ2ToRao1MZR8s-1wNRJUZ6hPVOxsOYURACCk5pUmyhravtqKs2F9TrLzxy3mzudxGH-spEZ-Vv_uENsLsM9pa0w7cQTE_nZ3b38Vj4bSwJ-EPHpW4bjycPCYNBCiLz2Gn8ng-wxcl_Ty0fBFSLHkN2MJXFQZ8_WwWU_wT3Mi0vs_cRbeX326G35uaNKFxjMhlY7nlEQYXmQqRWC-sAadEuQDiQHmU1roEpAem5Yw0xPEkwE6pNZZax227hzqz-SzsI8ylESE4JkLK2-e8cXJAXD-2Fmr4gesi-oKfdlVRPCW2mOjMLIjSBXSdQNcV9C46WVW6L4Ia7xc_TxOzKprUsPMHsBFdwdH_spEu2knTumpEKjikENlFRy_TrOvKfdCUAWNONzHs4H90fYg203DKpc0R6iwXj-EL-uCelr8eFsfZaP8CZELvkw priority: 102 providerName: Directory of Open Access Journals |
| Title | Multiobjective Complex Network Clustering Based on Dynamical Decomposition Particle Swarm Optimization |
| URI | https://ieeexplore.ieee.org/document/8985308 https://www.proquest.com/docview/2454919874 https://doaj.org/article/a4b009a6d34040ce8cabb869f405dd80 |
| Volume | 8 |
| WOSCitedRecordID | wos000525419100044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT1QxEG-QeMADKmhcBdIDRx6Uvm4_jrBAPMBCghpuTT8TzbJLll315N_uTF95kWBMvLy8vEybttPOdObN_IaQXRaMcG00TfJMYUpObJzKsnFgq2ThRNbF3_HlXI3H-ubGXK2QvT4XJqVUgs_SPr6Wf_lxFpboKjvQBpQLZvY-U0p2uVq9PwULSJihqsBCh8wcHI1GMAcwATnb5whSw9tHyqdg9NeiKk8kcVEvZy__b2CvyHq9RtKjju-vyUqabpAXf4ALbpJccmtn_lsn0iie_En6Scdd4DcdTZYIkgC09BhUWaSzKT3p6tNDzycJg81rRBe9qhuMXv9w81t6CXLmtiZwviGfz04_jT42tapCEwTTi8ZLLzOsRRYmZeaj8g6kFpcKLAsus_Ye6ASLYIoFpx0LEhHaOffOcx-kb9-S1elsmt4RKrVTKQWhEhb2C9EFPWThMLceWsRhGBD-sNw2VMhxrHwxscX0YMZ2PLLII1t5NCB7faO7DnHj3-THyMeeFOGyywdgkK2LY50A6WKcjC1OLSSYmfdamgzX1Rg1G5BNZGrfSeXngGw97Apbj_a95QJManTViPd_b_WBrOEAOz_NFlldzJdpmzwP3xdf7-c7xeiH58Wv052yg38DqlHujA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dTxQxEJ8QMFEe_ELjCWoffGShdHvd9hEOCcbzJBENb00_E81xR4475c9nZrdsNBoT3zabtmn7a2d2Zmd-A_CWByNdHU2VPG8oJSdWrsmqcmirZOlk1q2_4-u4mUz0xYU5W4PdPhcmpdQGn6U9emz_5cd5WJGrbF8bVC6U2bsxlFLwLlur96hQCQkzbAq10AE3-4ejEa4CjUDB9wTR1Ij6N_XTsvSXsip_yOJWwZw8-r-pPYaH5UOSHXbIP4G1NHsKm7_QC25BbrNr5_57J9QY3f1pumGTLvSbjaYroknAtuwIlVlk8xk77irU48jHicLNS0wXOytHjH3-6RaX7BNKmsuSwvkMvpy8Ox-dVqWuQhUk18vKK68y7kWWJmXuY-Mdyi2hGrQthMrae2wneURjLDjteFDE0S6Ed174oHz9HNZn81l6AUxp16QUZJOotF-ILughDwe59tgjDsMAxN1221BIx6n2xdS2xgc3tsPIEka2YDSA3b7TVce58e_mR4Rj35QIs9sXCJAtm2OdRPlinIo1LS0kXJn3WpmMH6wxaj6ALQK1H6TgOYCdu1Nhy-W-tkKiUU3OGvny773ewP3T849jO34_-bAND2iynddmB9aXi1V6BffCj-W368Xr9gTfAvUx760 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multiobjective+Complex+Network+Clustering+Based+on+Dynamical+Decomposition+Particle+Swarm+Optimization&rft.jtitle=IEEE+access&rft.au=Gao%2C+Tiaokang&rft.au=Cao%2C+Bin&rft.au=Zhang%2C+Mengxuan&rft.date=2020&rft.issn=2169-3536&rft.eissn=2169-3536&rft.volume=8&rft.spage=32341&rft.epage=32352&rft_id=info:doi/10.1109%2FACCESS.2020.2972123&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_ACCESS_2020_2972123 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon |