[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_7fa6a754-28aa-4ea5-813c-51357b724729":865,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:7fa6a754-28aa-4ea5-813c-51357b724729,\"}":944},{"meta":4,"data":6},{"total":5},"117",[7,56,246,295,379,474,535,646,710,744],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":25,"verifyStatus":26,"verifyTime":27,"verifyNote":28,"languages":29,"translateLanguages":28,"viewCount":32,"subjectFields":33,"manageAffiliations":34,"indexDatabases":35,"url":36,"thumbnailPath":28,"statistic":28,"gsStatistic":37,"type":55,"analyzePriority":28},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-08-27T01:57:29.562+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":14,"issn":16,"title":18,"introduce":21,"gsId":23},{"VOID":15},"VN",{"VOID":17},"08667535",{"EN":19,"VI":20},"Journal of Tropical Science and Engineering","Tạp chí Khoa học và Công nghệ nhiệt đới",{"EN":22},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":24},"MS2_GJQAAAAJ","PUBLISHER","VERIFIED","2025-10-27T06:27:25.058+00:00",null,[30,31],"VI","EN",0,[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":38,"totalPublicationByYear":39,"totalCitation":43,"totalCitationByYear":44,"totalCitationPerPublication":52,"totalCitationPerPublicationByYear":53,"hindexLast5Year":42,"hindex":42},483,{"0":40,"2020":40,"2021":40,"2022":40,"2024":40,"2025":41,"2026":42},1,475,3,117,{"2017":40,"2018":40,"2019":45,"2020":46,"2021":46,"2022":47,"2023":48,"2024":49,"2025":50,"2026":51},4,5,11,6,7,53,15,0.24,{"2020":46,"2021":46,"2022":47,"2024":49,"2025":54,"2026":46},0.11,"JOURNAL",{"id":57,"createTime":58,"updateTime":10,"relativeEntities":59,"slug":60,"properties":61,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":70,"manageAffiliations":71,"indexDatabases":84,"url":101,"thumbnailPath":28,"statistic":102,"gsStatistic":195,"type":55,"analyzePriority":28},"cc3aedc1-bd17-441e-b403-4be82349b362","2023-05-29T12:05:16.902+00:00",[],"Vietnam-Journal-of-Mechanics",{"country":62,"issn":63,"title":65,"gsId":67},{"VOID":15},{"VOID":64},"08667136",{"EN":66},"Vietnam Journal of Mechanics",{"VOID":68},"B98qpzgAAAAJ",29,[],[72],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":74,"slug":28,"properties":75,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":83,"statistic":28},"5bf72910-eb8d-41eb-b358-ea294f24f765",[],{"title":76,"country":79,"abbreviation":80},{"EN":77,"VI":78},"Vietnam Academy of Science and Technology","Viện Hàn lâm Khoa học và Công nghệ Việt Nam",{"VOID":15},{"VOID":81},"VAST","https:\u002F\u002Fvast.gov.vn\u002F",[],[85],{"id":86,"indexDatabase":87,"url":97,"indexYears":98,"academicFieldIds":99,"indexDatabaseRanking":28},"61d05d3d-1119-4247-9062-3944e6a8afd5",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":89,"label":90,"description":92,"key":94,"publicationTags":95,"standard":28},"7c6668cf-5dbb-472f-ac65-0e3d0d95e1c2",[],{"EN":91,"VI":91},"ACI - Asean Citation Index",{"EN":93,"VI":93},"Cơ sở dữ liệu ACI","aci",[96],"ACI","https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10758","2018-2022",[100],"007635a4-2624-49b8-a8f3-fec188e6a80e","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fvjmech\u002Findex",{"impactFactor":32,"impactFactorByYear":103,"i10Index":122,"i10IndexLast5Year":123,"totalPublication":124,"totalPublicationByYear":125,"totalCitation":143,"totalCitationByYear":144,"totalCitationPerPublication":163,"totalCitationPerPublicationByYear":164,"hindexLast5Year":146,"hindex":146},{"1994":104,"1995":105,"1997":54,"1998":106,"1999":105,"2000":107,"2001":108,"2002":107,"2003":107,"2004":109,"2005":110,"2006":111,"2007":105,"2008":110,"2010":112,"2011":113,"2012":114,"2013":115,"2014":105,"2015":116,"2016":111,"2017":116,"2018":117,"2019":109,"2020":118,"2021":119,"2022":115,"2023":120,"2024":121},0.12,0.08,0.05,0.02,0.1,0.15,0.14,0.09,0.07,0.21,0.73,0.52,0.13,0.26,0.36,0.61,0.64,0.27,23,2,1046,{"1979":126,"1980":127,"1981":128,"1982":129,"1983":51,"1984":129,"1985":130,"1986":128,"1987":51,"1988":51,"1989":122,"1990":128,"1991":129,"1992":128,"1993":131,"1994":132,"1995":133,"1996":133,"1997":132,"1998":131,"1999":128,"2000":122,"2001":134,"2002":130,"2003":135,"2004":122,"2005":136,"2006":133,"2007":137,"2008":138,"2009":131,"2010":134,"2011":47,"2012":139,"2013":131,"2014":134,"2015":131,"2016":135,"2017":140,"2018":132,"2019":131,"2020":141,"2021":122,"2022":142,"2023":130,"2024":123},12,17,18,19,20,25,28,27,22,21,24,38,35,37,26,39,36,1403,{"1980":40,"1982":40,"1983":40,"1991":132,"1992":45,"1993":48,"1994":49,"1995":145,"1996":146,"1997":134,"1998":140,"1999":47,"2000":136,"2001":127,"2002":128,"2003":147,"2004":148,"2005":131,"2006":149,"2007":150,"2008":151,"2009":152,"2010":153,"2011":154,"2012":155,"2013":156,"2014":152,"2015":157,"2016":158,"2017":138,"2018":159,"2019":160,"2020":159,"2021":161,"2022":162,"2023":45},9,13,31,30,46,40,65,43,119,105,89,72,63,66,70,59,68,58,1.34,{"1980":165,"1982":106,"1983":112,"1991":166,"1992":167,"1993":52,"1994":168,"1995":169,"1996":170,"1997":171,"1998":172,"1999":119,"2000":172,"2001":173,"2002":174,"2003":175,"2004":176,"2005":172,"2006":177,"2007":178,"2008":179,"2009":180,"2010":181,"2011":182,"2012":183,"2013":184,"2014":185,"2015":186,"2016":187,"2017":188,"2018":189,"2019":190,"2020":191,"2021":192,"2022":193,"2023":194},0.06,1.47,0.22,0.25,0.33,0.48,0.79,1.04,0.77,0.9,1.48,1.3,1.7,1.05,1.86,1.72,5.41,9.55,2.41,2.88,1.95,2.52,3.14,1.35,2.5,2.36,1.79,2.96,1.61,0.2,{"impactFactor":28,"impactFactorByYear":28,"i10Index":196,"i10IndexLast5Year":128,"totalPublication":197,"totalPublicationByYear":198,"totalCitation":203,"totalCitationByYear":204,"totalCitationPerPublication":219,"totalCitationPerPublicationByYear":220,"hindexLast5Year":126,"hindex":199},42,1244,{"0":147,"1979":146,"1980":127,"1981":127,"1982":199,"1983":199,"1984":129,"1985":129,"1986":128,"1987":129,"1988":51,"1989":140,"1990":127,"1991":129,"1992":129,"1993":133,"1994":147,"1995":132,"1996":69,"1997":132,"1998":131,"1999":134,"2000":140,"2001":131,"2002":134,"2003":131,"2004":133,"2005":132,"2006":131,"2007":200,"2008":138,"2009":140,"2010":132,"2011":122,"2012":201,"2013":132,"2014":140,"2015":148,"2016":122,"2017":202,"2018":69,"2019":140,"2020":69,"2021":132,"2022":139,"2023":130,"2024":133,"2025":131,"2026":138},16,47,41,32,2194,{"1997":126,"1998":205,"1999":126,"2000":145,"2001":145,"2002":126,"2003":205,"2004":127,"2005":129,"2006":146,"2007":132,"2008":136,"2009":47,"2010":131,"2011":138,"2012":206,"2013":207,"2014":208,"2015":162,"2016":209,"2017":209,"2018":210,"2019":211,"2020":212,"2021":213,"2022":214,"2023":215,"2024":216,"2025":217,"2026":218},10,54,64,62,93,123,118,122,168,159,177,205,255,154,1.76,{"1997":221,"1998":222,"1999":223,"2000":224,"2001":118,"2002":223,"2003":222,"2004":225,"2005":226,"2006":115,"2007":227,"2008":228,"2009":229,"2010":230,"2011":231,"2012":232,"2013":233,"2014":234,"2015":235,"2016":236,"2017":237,"2018":238,"2019":239,"2020":240,"2021":48,"2022":241,"2023":242,"2024":243,"2025":244,"2026":245},0.43,0.4,0.55,0.35,0.63,0.68,0.6,0.69,0.42,0.89,1.52,1.32,2.29,2.38,1.93,4.04,2.91,4.24,4.54,4.21,4.3,8.85,7.59,10.2,4.4,{"id":247,"createTime":248,"updateTime":10,"relativeEntities":249,"slug":250,"properties":251,"entityType":25,"verifyStatus":26,"verifyTime":261,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":147,"subjectFields":262,"manageAffiliations":263,"indexDatabases":264,"url":273,"thumbnailPath":28,"statistic":274,"gsStatistic":290,"type":55,"analyzePriority":28},"b5209d2b-2258-40ef-8732-874e80fe24a5","2023-08-01T04:13:30.887+00:00",[],"VNU-Journal-of-Science-Medical-and-Pharmaceutical-Sciences",{"country":252,"eissn":253,"issn":255,"title":257,"gsId":259},{"VOID":15},{"VOID":254},"25881132",{"VOID":256},"26159309",{"EN":258},"VNU Journal of Science: Medical and Pharmaceutical Sciences",{"VOID":260},"nxupvWQAAAAJ","2023-08-01T04:16:22.633+00:00",[],[],[265],{"id":266,"indexDatabase":267,"url":272,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"1c684ac3-c7bf-4466-8841-3c6146083c3c",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":268,"label":269,"description":270,"key":94,"publicationTags":271,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11969","https:\u002F\u002Fjs.vnu.edu.vn\u002FMPS",{"impactFactor":32,"impactFactorByYear":275,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":276,"totalPublicationByYear":277,"totalCitation":282,"totalCitationByYear":283,"totalCitationPerPublication":284,"totalCitationPerPublicationByYear":285,"hindexLast5Year":45,"hindex":45},{"2019":106,"2020":110,"2021":104,"2022":104,"2023":109,"2024":108},360,{"2016":140,"2017":278,"2018":69,"2019":148,"2020":279,"2021":200,"2022":280,"2023":281,"2024":200},34,48,49,50,163,{"2016":145,"2017":145,"2018":135,"2019":140,"2020":50,"2021":135,"2022":128,"2023":48},0.45,{"2016":224,"2017":117,"2018":286,"2019":287,"2020":288,"2021":284,"2022":289,"2023":104},0.72,0.87,1.1,0.37,{"impactFactor":28,"impactFactorByYear":28,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":136,"totalPublicationByYear":291,"totalCitation":127,"totalCitationByYear":292,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":294,"hindexLast5Year":123,"hindex":42},{"0":123,"2014":40,"2015":40,"2016":130},{"2016":40,"2019":123,"2021":123,"2023":45,"2024":42,"2025":40,"2026":40},0.71,{"2016":106},{"id":296,"createTime":297,"updateTime":10,"relativeEntities":298,"slug":299,"properties":300,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":51,"subjectFields":310,"manageAffiliations":311,"indexDatabases":312,"url":313,"thumbnailPath":28,"statistic":314,"gsStatistic":349,"type":55,"analyzePriority":28},"e7ce3904-ad2d-4341-b39e-98ebe8da5908","2023-06-13T10:30:04.853+00:00",[],"Communications-in-Physics",{"country":301,"eissn":302,"issn":304,"title":306,"gsId":308},{"VOID":15},{"VOID":303},"28155947",{"VOID":305},"08863166",{"EN":307},"Communications in Physics",{"VOID":309},"FStER9AAAAAJ",[],[],[],"https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fcip",{"impactFactor":32,"impactFactorByYear":315,"i10Index":199,"i10IndexLast5Year":45,"totalPublication":321,"totalPublicationByYear":322,"totalCitation":326,"totalCitationByYear":327,"totalCitationPerPublication":335,"totalCitationPerPublicationByYear":336,"hindexLast5Year":126,"hindex":126},{"2008":110,"2009":316,"2010":165,"2011":317,"2012":317,"2013":112,"2014":318,"2015":105,"2016":108,"2017":116,"2018":318,"2019":52,"2020":319,"2021":284,"2022":320,"2023":116,"2024":222},0.3,0.03,0.16,0.34,0.28,738,{"2007":323,"2008":145,"2009":145,"2010":136,"2011":139,"2012":324,"2013":138,"2014":151,"2015":69,"2016":151,"2017":325,"2018":142,"2019":50,"2020":201,"2021":141,"2022":152,"2023":150,"2024":278,"2025":123},14,107,56,947,{"2007":148,"2008":49,"2009":49,"2010":127,"2011":328,"2012":155,"2013":278,"2014":329,"2015":206,"2016":330,"2017":331,"2018":332,"2019":333,"2020":334,"2021":127,"2022":132,"2023":148},52,94,86,129,76,91,106,1.28,{"2007":337,"2008":338,"2009":338,"2010":293,"2011":339,"2012":340,"2013":341,"2014":342,"2015":179,"2016":232,"2017":343,"2018":344,"2019":180,"2020":345,"2021":346,"2022":347,"2023":348},2.14,0.78,1.41,0.83,0.97,1.45,2.3,2.11,2.59,0.44,0.65,0.75,{"impactFactor":28,"impactFactorByYear":28,"i10Index":133,"i10IndexLast5Year":145,"totalPublication":350,"totalPublicationByYear":351,"totalCitation":355,"totalCitationByYear":356,"totalCitationPerPublication":363,"totalCitationPerPublicationByYear":364,"hindexLast5Year":145,"hindex":323},1117,{"0":48,"1972":40,"1991":127,"1992":51,"1993":49,"1994":47,"1995":323,"1996":42,"1997":40,"1998":146,"1999":146,"2000":205,"2001":47,"2002":128,"2003":136,"2004":132,"2005":136,"2006":148,"2007":141,"2008":149,"2009":352,"2010":353,"2011":196,"2012":208,"2013":280,"2014":354,"2015":150,"2016":328,"2017":137,"2018":142,"2019":325,"2020":152,"2021":139,"2022":139,"2023":142,"2024":148,"2025":147,"2026":132},33,44,92,1611,{"2004":46,"2005":357,"2006":47,"2007":47,"2008":126,"2009":140,"2010":69,"2011":147,"2012":147,"2013":147,"2014":208,"2015":353,"2016":201,"2017":280,"2018":161,"2019":358,"2020":212,"2021":331,"2022":212,"2023":359,"2024":360,"2025":361,"2026":362},8,85,153,178,188,132,1.44,{"2004":365,"2005":169,"2006":289,"2007":320,"2008":117,"2009":171,"2010":366,"2011":367,"2012":368,"2013":225,"2014":369,"2015":288,"2016":171,"2017":370,"2018":371,"2019":231,"2020":372,"2021":373,"2022":374,"2023":375,"2024":376,"2025":377,"2026":378},0.18,0.66,0.74,0.5,0.67,1.29,1.89,2.84,3.49,3.3,4.25,5.93,6.06,4.71,{"id":380,"createTime":381,"updateTime":382,"relativeEntities":383,"slug":384,"properties":385,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":394,"translateLanguages":28,"viewCount":127,"subjectFields":395,"manageAffiliations":396,"indexDatabases":404,"url":418,"thumbnailPath":28,"statistic":419,"gsStatistic":446,"type":55,"analyzePriority":28},"2300fd63-13a8-4ee9-92b0-d24d9e616c6b","2023-05-29T12:05:31.684+00:00","2026-08-27T01:57:29.561+00:00",[],"Journal-of-Computer-Science-and-Cybernetics",{"country":386,"issn":387,"title":389,"gsId":392},{"VOID":15},{"VOID":388},"18139663",{"EN":390,"VI":391},"Journal of Computer Science and Cybernetics","Tạp chí tin học và điều khiển học",{"VOID":393},"hVh9fuMAAAAJ",[30,31],[],[397],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":398,"slug":28,"properties":399,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":403,"statistic":28},[],{"title":400,"country":401,"abbreviation":402},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[405],{"id":406,"indexDatabase":407,"url":412,"indexYears":413,"academicFieldIds":414,"indexDatabaseRanking":28},"0c897c2c-8ca4-4a7a-91b9-14955abc3043",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":408,"label":409,"description":410,"key":94,"publicationTags":411,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11305","2019-2021",[100,415,416,417],"a24a4497-b6ac-43f3-ae94-c044be819e49","b2d37900-0c9f-4074-a519-9ee0b570caa7","37da756c-1c5e-4925-87f2-a9bd3ce5859c","http:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjcc",{"impactFactor":32,"impactFactorByYear":420,"i10Index":129,"i10IndexLast5Year":42,"totalPublication":425,"totalPublicationByYear":426,"totalCitation":431,"totalCitationByYear":432,"totalCitationPerPublication":438,"totalCitationPerPublicationByYear":439,"hindexLast5Year":323,"hindex":323},{"2013":107,"2014":107,"2015":111,"2016":365,"2017":107,"2018":421,"2019":117,"2020":422,"2021":227,"2022":423,"2023":368,"2024":424},0.04,0.32,0.39,0.57,1184,{"2012":427,"2013":358,"2014":278,"2015":428,"2016":429,"2017":51,"2018":430,"2019":148,"2020":130,"2021":136,"2022":199,"2023":132,"2024":42},473,71,251,134,995,{"2012":433,"2013":434,"2014":434,"2015":333,"2016":435,"2017":436,"2018":437,"2019":211,"2020":281,"2021":434,"2022":126,"2023":152},149,45,114,51,232,0.84,{"2012":422,"2013":440,"2014":232,"2015":335,"2016":284,"2017":441,"2018":442,"2019":443,"2020":189,"2021":444,"2022":348,"2023":445},0.53,3.4,1.73,3.93,1.88,1.54,{"impactFactor":28,"impactFactorByYear":28,"i10Index":150,"i10IndexLast5Year":132,"totalPublication":447,"totalPublicationByYear":448,"totalCitation":449,"totalCitationByYear":450,"totalCitationPerPublication":192,"totalCitationPerPublicationByYear":460,"hindexLast5Year":51,"hindex":199},1105,{"0":47,"1981":40,"1985":199,"1986":135,"1987":136,"1988":323,"1989":126,"1990":199,"1991":127,"1992":126,"1993":47,"1994":129,"1995":130,"1996":132,"1997":142,"1998":148,"1999":201,"2000":196,"2001":353,"2002":353,"2003":352,"2004":132,"2005":131,"2006":148,"2007":147,"2008":133,"2009":131,"2010":139,"2011":201,"2012":281,"2013":142,"2014":202,"2015":69,"2016":140,"2017":136,"2018":140,"2019":134,"2020":134,"2021":133,"2022":134,"2023":134,"2024":136,"2025":49},3272,{"2007":145,"2008":323,"2009":46,"2010":48,"2011":129,"2012":148,"2013":140,"2014":69,"2015":152,"2016":160,"2017":162,"2018":451,"2019":452,"2020":453,"2021":454,"2022":455,"2023":456,"2024":457,"2025":458,"2026":459},109,173,236,318,398,469,442,440,297,{"2007":461,"2008":115,"2009":194,"2010":318,"2011":462,"2012":227,"2013":286,"2014":463,"2015":175,"2016":464,"2017":465,"2018":466,"2019":467,"2020":468,"2021":469,"2022":470,"2023":471,"2024":472,"2025":473},0.29,0.46,0.91,2.27,2.42,4.19,7.86,10.73,11.78,18.09,21.32,18.42,62.86,{"id":475,"createTime":476,"updateTime":382,"relativeEntities":477,"slug":478,"properties":479,"entityType":25,"verifyStatus":26,"verifyTime":491,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":202,"subjectFields":492,"manageAffiliations":493,"indexDatabases":509,"url":510,"thumbnailPath":28,"statistic":511,"gsStatistic":525,"type":55,"analyzePriority":28},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":480,"issn":481,"title":483,"introduce":486,"gsId":489},{"VOID":15},{"VOID":482},"23541210",{"EN":484,"VI":485},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"EN":487,"VI":488},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"VOID":490},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",[],[494],{"id":495,"createTime":28,"updateTime":28,"relativeEntities":496,"slug":28,"properties":497,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":507,"parentIds":508,"statistic":28},"6413896b-eca9-442b-a73f-182a58a0ce40",[],{"title":498,"address":501,"country":504,"abbreviation":505},{"EN":499,"VI":500},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"EN":502,"VI":503},"No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam","Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam",{"VOID":15},{"VOID":506},"ctump","http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":32,"impactFactorByYear":512,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":520,"totalCitationByYear":521,"totalCitationPerPublication":108,"totalCitationPerPublicationByYear":523,"hindexLast5Year":45,"hindex":45},{"2022":513,"2023":111,"2024":106},0.01,1556,{"2020":47,"2021":516,"2022":517,"2023":518,"2024":519,"2025":122},57,306,801,358,161,{"2021":146,"2022":280,"2023":522},99,{"2021":524,"2022":318,"2023":104},0.23,{"impactFactor":28,"impactFactorByYear":28,"i10Index":123,"i10IndexLast5Year":123,"totalPublication":526,"totalPublicationByYear":527,"totalCitation":526,"totalCitationByYear":528,"totalCitationPerPublication":40,"totalCitationPerPublicationByYear":531,"hindexLast5Year":49,"hindex":49},476,{"0":205,"2019":123,"2021":139,"2022":459,"2023":451,"2024":357,"2025":49,"2026":48},{"2021":42,"2022":123,"2023":161,"2024":529,"2025":360,"2026":530},136,83,{"2021":105,"2022":513,"2023":532,"2024":127,"2025":533,"2026":534},0.62,25.43,13.83,{"id":536,"createTime":537,"updateTime":382,"relativeEntities":538,"slug":539,"properties":540,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":552,"translateLanguages":28,"viewCount":133,"subjectFields":553,"manageAffiliations":554,"indexDatabases":555,"url":556,"thumbnailPath":557,"statistic":558,"gsStatistic":594,"type":55,"analyzePriority":28},"6984a56a-db70-403b-9cc4-4013e1ceaffa","2023-05-09T06:47:40.346+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Nghi%C3%AAn%20c%E1%BB%A9u%20n%C6%B0%E1%BB%9Bc%20ngo%C3%A0i",{"country":541,"issn":542,"title":544,"introduce":547,"gsId":550},{"VOID":15},{"VOID":543},"25252445",{"EN":545,"VI":546},"VNU Journal of Foreign Studies","Tạp chí Nghiên cứu nước ngoài",{"EN":548,"VI":549},"{\"ops\":[{\"insert\":\"\\n\\nThe \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research. In 2002, with the rapid expansion of the field of Foreign Languages and International Studies, the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\"\\n was delighted to announce the launch of the \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n.\\n\\n\\nSince 2017, as a natural development from its predecessor \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Foreign Studies\"},{\"insert\":\"\\n, the\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"VNU Journal of Foreign Studies \"},{\"insert\":\"\\ncontinues to be an official, independent publication of the University of Languages and International Studies (ULIS) under Vietnam National University (VNU).\\nThe\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\" VNU Journal of Foreign Studies\"},{\"attributes\":{\"italic\":true},\"insert\":\" \"},{\"insert\":\"\\npublishes \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"blind\"},{\"insert\":\"\\n \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"peer-reviewed\"},{\"insert\":\"\\n research papers, discussions and reviews concerning:\\nLinguisticsForeign language educationInternational studiesRelated social sciences and humanities\\nBimonthly in 4 English editions and 2 Vietnamese editions in the current year in both print and electronic forms, the journal provides maximum exposure for published articles, making research available to all to read and share.\\n\\n\\n\"}]}","{\"ops\":[{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học, Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n được thành lập năm 1985 với mục đích xuất bản các bài báo nghiên cứu trong nước và quốc tế về tất cả các lĩnh vực khoa học tự nhiên và công nghệ, khoa học xã hội và nhân văn. Kể từ đó, tạp chí đã phát triển về chất lượng, quy mô và phạm vi với hàng chục số báo liên quan đến nghiên cứu học thuật. Năm 2002, với sự phát triển nhanh chóng của lĩnh vực Ngoại ngữ và Quốc tế học, \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Tạp chí Khoa học Đại học Quốc gia Hà Nội\"},{\"insert\":\"\\n đã vui mừng thông báo ra mắt Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài.\"},{\"insert\":\"\\n\\n\\nKể từ năm 2017, như một sự kế thừa và phát triển từ tiền thân Chuyên san \\n\"},{\"attributes\":{\"italic\":true},\"insert\":\"Nghiên cứu Nước ngoài\"},{\"insert\":\"\\n của Tạp chí Khoa học, Đại học Quốc gia Hà Nội, \\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tạp chí\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\" \"},{\"insert\":\"\\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài \"},{\"insert\":\"\\ntiếp tục là ấn phẩm khoa học chính thức và độc lập của Trường Đại học Ngoại ngữ, Đại học Quốc gia Hà Nội.\\nTạp chí \\n\"},{\"attributes\":{\"italic\":true,\"bold\":true},\"insert\":\"Nghiên cứu nước ngoài\"},{\"insert\":\"\\n xuất bản các bài báo nghiên cứu, trao đổi và đánh giá đã được phản biện kín về:\\nNgôn ngữ họcGiảng dạy ngoại ngữ\u002Fngôn ngữQuốc tế họcCác ngành khoa học xã hội và nhân văn có liên quan\\nTạp chí xuất bản định kì 06 số\u002Fnăm (gồm 04 số tiếng Anh\u002Fnăm và 2 số tiếng Việt\u002Fnăm) dưới dạng bản in và bản điện tử. Tạp chí cung cấp khả năng tiếp cận tối đa tới các bài báo đã xuất bản nhằm giúp độc giả dễ dàng đọc và chia sẻ.\\n\"}]}",{"VOID":551},"jyihv3YAAAAJ",[30,31],[],[],[],"https:\u002F\u002Fjfs.ulis.vnu.edu.vn\u002Findex.php\u002Ffs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6984a56a-db70-403b-9cc4-4013e1ceaffa\u002F92693604f5caf63c64520c5c2cd756b5.jpg",{"impactFactor":32,"impactFactorByYear":559,"i10Index":560,"i10IndexLast5Year":205,"totalPublication":561,"totalPublicationByYear":562,"totalCitation":568,"totalCitationByYear":569,"totalCitationPerPublication":579,"totalCitationPerPublicationByYear":580,"hindexLast5Year":140,"hindex":140},{"2007":317,"2010":112,"2011":109,"2012":421,"2013":165,"2014":421,"2015":421,"2016":111,"2017":116,"2018":104,"2019":109,"2020":320,"2021":284,"2022":168,"2023":116,"2024":108},67,1200,{"2002":51,"2003":51,"2004":47,"2005":352,"2006":142,"2007":131,"2008":147,"2009":139,"2010":278,"2011":138,"2012":69,"2013":206,"2014":137,"2015":69,"2016":196,"2017":563,"2018":209,"2019":564,"2020":565,"2021":566,"2022":530,"2023":567,"2024":428,"2025":281},130,78,90,80,61,3204,{"2002":42,"2003":123,"2004":123,"2005":570,"2006":47,"2007":127,"2008":571,"2009":572,"2010":196,"2011":573,"2012":130,"2013":560,"2014":574,"2015":149,"2016":325,"2017":575,"2018":576,"2019":577,"2020":578,"2021":453,"2022":206,"2023":205,"2025":51},189,223,765,246,98,171,377,355,199,2.67,{"2002":194,"2003":116,"2004":365,"2005":581,"2006":582,"2007":226,"2008":583,"2009":584,"2010":585,"2011":586,"2012":228,"2013":585,"2014":587,"2015":588,"2016":589,"2017":232,"2018":590,"2019":591,"2020":592,"2021":593,"2022":347,"2023":318,"2025":316},5.73,0.31,7.19,20.68,1.24,7.03,2.58,1.59,1.33,4.05,4.55,2.21,2.95,{"impactFactor":28,"impactFactorByYear":28,"i10Index":595,"i10IndexLast5Year":596,"totalPublication":597,"totalPublicationByYear":598,"totalCitation":609,"totalCitationByYear":610,"totalCitationPerPublication":625,"totalCitationPerPublicationByYear":626,"hindexLast5Year":142,"hindex":152},379,311,2120,{"0":361,"1960":40,"1971":40,"1975":40,"1987":40,"1988":40,"1989":40,"1990":45,"1992":40,"1993":40,"1994":46,"1995":46,"1996":45,"1997":42,"1998":49,"1999":42,"2000":123,"2001":42,"2002":48,"2003":46,"2004":145,"2005":131,"2006":51,"2007":131,"2008":135,"2009":146,"2010":127,"2011":122,"2012":148,"2013":352,"2014":201,"2015":149,"2016":599,"2017":600,"2018":601,"2019":209,"2020":602,"2021":603,"2022":604,"2023":605,"2024":606,"2025":607,"2026":608},77,75,97,143,167,156,182,231,230,128,13225,{"2003":149,"2004":150,"2005":201,"2006":196,"2007":157,"2008":436,"2009":328,"2010":611,"2011":612,"2012":333,"2013":522,"2014":613,"2015":520,"2016":614,"2017":615,"2018":616,"2019":617,"2020":618,"2021":619,"2022":620,"2023":621,"2024":622,"2025":623,"2026":624},74,88,146,228,310,347,413,636,944,1261,1400,1846,2511,1882,6.24,{"2003":627,"2004":628,"2005":629,"2006":630,"2007":186,"2008":631,"2009":45,"2010":632,"2011":633,"2012":634,"2013":42,"2014":635,"2015":636,"2016":192,"2017":637,"2018":638,"2019":628,"2020":639,"2021":640,"2022":641,"2023":642,"2024":643,"2025":644,"2026":645},9.2,4.44,1.64,2.8,2.43,4.35,3.83,3.03,3.56,3.5,4.13,3.58,4.45,5.65,8.08,7.69,7.99,10.92,14.7,{"id":647,"createTime":648,"updateTime":382,"relativeEntities":649,"slug":650,"properties":651,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":665,"translateLanguages":28,"viewCount":142,"subjectFields":666,"manageAffiliations":667,"indexDatabases":668,"url":677,"thumbnailPath":678,"statistic":679,"gsStatistic":699,"type":55,"analyzePriority":28},"21d239d8-ac9d-48c7-a176-9d8aadc5eba5","2023-08-21T02:43:48.721+00:00",[],"Khoa-h%E1%BB%8Dc-%C4%90HQGHN-Khoa-h%E1%BB%8Dc-T%E1%BB%B1-nhi%C3%AAn-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87",{"country":652,"eissn":653,"issn":655,"title":657,"introduce":660,"gsId":662},{"VOID":15},{"VOID":654},"25881140",{"VOID":656},"26159317",{"EN":658,"VI":659},"VNU Journal of Science: Natural Science and Technology","Khoa học ĐHQGHN: Khoa học Tự nhiên và Công nghệ",{"EN":661},"{\"ops\":[{\"insert\":\"The \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" was established in 1985 for the publication of national and international research papers in all fields of natural sciences and technology, social sciences and humanities. Since then, the journal has grown in quality, size and scope and now comprises a dozen of serials spanning academic research.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"With the rapid expansion of the field of Economics, the VNU \"},{\"attributes\":{\"italic\":true},\"insert\":\"Journal\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"of\"},{\"insert\":\" \"},{\"attributes\":{\"italic\":true},\"insert\":\"Science\"},{\"insert\":\" is delighted to announce the launch of the \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science: Natural Sciences and Technology (JS: NST) \"},{\"insert\":\"since 1985. This serial publication provides researchers with the opportunity to publish research covering aspects in these areas in the popular \"},{\"attributes\":{\"italic\":true},\"insert\":\"VNU Journal of Science\"},{\"insert\":\" series.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"As a fully open access publication, the journal will provide maximum exposure for published articles, making the research available to all to read and share. The journal will be published quarterly in March, June, September and December.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"JS: NST is an open access journal publishing double-blinded peer-reviewed research papers, communications and reviews dealing with Biology, Bio-technology, Chemistry, Chemical engineering, Energy, Environmental technology and Materials engineering.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Publication Ethics\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"VNUJS is committed to maintaining the highest standards of publication ethics and takes all possible measures against any publication malpractices. The journal follows the guidelines and recommendations of the Committee on Publication Ethics (C.O.P.E) to ensure ethical publishing practices.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Plagiarism is strictly prohibited and will not be tolerated. Any form of plagiarism, including but not limited to copying, paraphrasing, or reusing previously published work without proper attribution, will result in rejection of the manuscript and potential sanctions against the author. VNUJS utilizes DoIt as plagiarism detection software to verify the originality of submitted manuscripts.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The publication ethics statement with full detail of the responsibilities of authors, reviewers and editors can be found \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fjs.vnu.edu.vn\u002FNST\u002Fethics\"},\"insert\":\"here\"},{\"attributes\":{\"bold\":true},\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Peer Review Process\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Any manuscript followed the journal’s scope and author guideline will be assigned to the managing editors. All manuscripts have undergone editorial screening and anonymous double-blind peer-review by the at least one independent expert in the field. The managing editor makes an editorial decision, which is subject to endorsement by the Editor – in - Chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The journal publishing process can be found in detail \"},{\"attributes\":{\"bold\":true,\"color\":\"#464d50\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fdrive.google.com\u002Ffile\u002Fd\u002F136BOGahfq9_5BB3TzSBsLBkQKfCUe5yN\u002Fview?usp=share_link\"},\"insert\":\"here\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"VOID":663},"ZfBridMAAAAJ","Admin update database",[30,31],[],[],[669],{"id":670,"indexDatabase":671,"url":676,"indexYears":28,"academicFieldIds":28,"indexDatabaseRanking":28},"6684da33-2cb9-49f9-8332-28f0bcd72e39",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":672,"label":673,"description":674,"key":94,"publicationTags":675,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=11968","https:\u002F\u002Fjs.vnu.edu.vn\u002FNST","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F21d239d8-ac9d-48c7-a176-9d8aadc5eba5\u002Fb081d4211e382646c2cdc054ead551b3.jpg",{"impactFactor":32,"impactFactorByYear":680,"i10Index":130,"i10IndexLast5Year":40,"totalPublication":682,"totalPublicationByYear":683,"totalCitation":685,"totalCitationByYear":686,"totalCitationPerPublication":691,"totalCitationPerPublicationByYear":692,"hindexLast5Year":47,"hindex":47},{"2000":317,"2005":513,"2007":107,"2010":513,"2011":317,"2012":106,"2013":107,"2014":317,"2015":107,"2016":107,"2017":421,"2018":317,"2019":421,"2020":113,"2021":582,"2022":681,"2023":194,"2024":104},0.19,1700,{"1985":131,"1986":353,"1987":130,"1988":69,"1989":69,"1990":200,"1991":196,"1992":146,"1993":279,"1994":148,"1995":200,"1996":201,"1999":278,"2000":140,"2001":128,"2002":202,"2003":353,"2004":138,"2005":202,"2006":136,"2007":278,"2008":139,"2009":137,"2010":141,"2011":278,"2012":132,"2013":202,"2014":202,"2015":278,"2016":684,"2017":359,"2018":160,"2019":162,"2020":281,"2021":157,"2022":436,"2023":358,"2024":136,"2025":135},165,870,{"1995":123,"1999":123,"2001":45,"2002":130,"2003":40,"2004":123,"2005":42,"2007":69,"2008":687,"2009":352,"2010":688,"2011":137,"2012":127,"2013":47,"2014":46,"2015":146,"2016":331,"2017":689,"2018":331,"2019":690,"2020":353,"2021":567,"2022":130,"2023":357},82,60,55,102,0.51,{"1995":421,"1999":165,"2001":167,"2002":532,"2003":107,"2004":165,"2005":111,"2007":693,"2008":694,"2009":287,"2010":445,"2011":695,"2012":119,"2013":319,"2014":318,"2015":696,"2016":338,"2017":118,"2018":697,"2019":219,"2020":698,"2021":341,"2022":423,"2023":111},0.85,2.22,1.12,0.38,2.19,0.88,{"impactFactor":28,"impactFactorByYear":28,"i10Index":126,"i10IndexLast5Year":123,"totalPublication":570,"totalPublicationByYear":700,"totalCitation":701,"totalCitationByYear":702,"totalCitationPerPublication":703,"totalCitationPerPublicationByYear":704,"hindexLast5Year":46,"hindex":205},{"0":48,"1999":146,"2000":47,"2001":45,"2002":40,"2003":199,"2004":123,"2005":42,"2006":123,"2007":145,"2008":145,"2009":46,"2010":49,"2011":47,"2012":47,"2013":49,"2014":45,"2015":45,"2016":157,"2017":40},425,{"2008":42,"2009":357,"2010":47,"2011":51,"2012":199,"2013":135,"2014":323,"2015":51,"2016":278,"2017":69,"2018":69,"2019":137,"2020":142,"2021":140,"2022":148,"2023":122,"2024":202,"2025":135,"2026":126},2.25,{"2008":169,"2009":705,"2010":706,"2011":707,"2012":342,"2013":42,"2014":636,"2015":708,"2016":709,"2017":69},1.6,1.57,1.36,3.75,0.54,{"id":711,"createTime":712,"updateTime":382,"relativeEntities":713,"slug":714,"properties":715,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":664,"languages":28,"translateLanguages":28,"viewCount":150,"subjectFields":727,"manageAffiliations":728,"indexDatabases":729,"url":730,"thumbnailPath":731,"statistic":732,"gsStatistic":738,"type":55,"analyzePriority":28},"954132b5-ca74-461c-b819-45ad6e49a404","2023-08-17T03:30:52.301+00:00",[],"HPU2-Journal-of-Science-Natural-Sciences-and-Technology",{"country":716,"issn":717,"title":719,"introduce":722,"gsId":725},{"VOID":15},{"VOID":718},"28155637",{"EN":720,"VI":721},"HPU2 Journal of Science: Natural Sciences and Technology","TẠP CHÍ KHOA HỌC TRƯỜNG ĐHSP HÀ NỘI 2: CHUYÊN SAN KHOA HỌC TỰ NHIÊN VÀ CÔNG NGHỆ",{"EN":723,"VI":724},"{\"ops\":[{\"insert\":\"HPU2 journal of Science aims to provide an interdisciplinary platform for the dissemination of advances in sciences and technology. The journal publishes original papers of scientific or technological value in all areas of natural, social or educational sciences.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Natural sciences and technology is in papers that describe valuable findings in physics, mathematics, chemistry, biology; solving engineering or technological problems.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Social Sciences and Humanity is to facilitate the publication of high-quality papers in various areas of social sciences and studies for human development.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"The main interest of HPU2 Journal of Science: Educational Sciences is to publish papers in the field of educational sciences and applications of advances to education for improving and enhancing science education at all levels.\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Papers that are published by HPU2 Journal of Science are doubled-blind, peer-reviewed by at least two experts, are evaluated by the section editor and editor in chief.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Types of Articles\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Research articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Academic reports of original research that have never been published elsewhere in any languages. Manuscripts, where appropriate, should contain the following sections in the order: Title, Authors, Author affiliations, Email address of corresponding authors, Abstract, Keywords, Nomenclature (if any), Introduction, Experiment, Theory, Results and Discussion, Conclusions, Conflict of Interest, Acknowledgments (if any), References, Appendix (if any). Pre-published are to be formatted according to Templates (MS-Word version). \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Review articles\"},{\"attributes\":{\"align\":\"justify\",\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"In addition to invited reviews, literature reviews, systematic reviews, and critical reviews will be accepted for consideration. The manuscript should be composed and organized according to the required sequence: Titles, Author names, Affiliations, Email addresses, Abstract, Keywords, Main text, Conclusion, Conflict of Interest, Acknowledgments (if any), References. Although, the main text structure may vary based on the review subtopics, the articles should be formatted according to suitable Templates as research articles.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Khoa học Trường ĐHSP Hà Nội 2 nhằm mục đích cung cấp một nền tảng liên ngành của sự phổ biến những tiến bộ của khoa học và công nghệ. Tạp chí xuất bản các bài báo gốc có giá trị khoa học hoặc công nghệ trong tất cả các lĩnh vực khoa học tự nhiên, xã hội hoặc giáo dục.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học tự nhiên và công nghệ:\"},{\"insert\":\" Là các bài báo mô tả những phát hiện có giá trị trong vật lý, toán học, hóa học, sinh học; giải quyết các vấn đề kỹ thuật hoặc công nghệ.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học Xã hội và Nhân văn:\"},{\"insert\":\" là các bài báo xuất bản chất lượng cao trong các lĩnh vực khác nhau của khoa học xã hội và nghiên cứu phát triển con người.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Chuyên san Khoa học giáo dục:\"},{\"insert\":\" là các bài báo xuất bản trong lĩnh vực khoa học giáo dục và các ứng dụng của tiến bộ vào giáo dục để cải thiện và nâng cao giáo dục khoa học ở tất cả các cấp.\"},{\"attributes\":{\"list\":\"bullet\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí trường ĐHSP Hà Nội 2 xuất bản được phản biện kín, xét duyệt bởi ít nhất 02 chuyên gia, và được đánh giá, chọn lựa từ ban biên tập và Tổng biên tập.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Các loại bài báo\"},{\"insert\":\":\\nBài báo nghiên cứu:\"},{\"attributes\":{\"list\":\"ordered\"},\"insert\":\"\\n\"},{\"insert\":\"Báo cáo học thuật về nghiên cứu ban đầu chưa từng được xuất bản ở bất kỳ nơi nào, hay bằng bất kỳ ngôn ngữ nào khác. Bản thảo thích hợp, nên chứa các phần sau theo thứ tự: Tiêu đề, Tác giả, Liên kết tác giả, Địa chỉ email của tác giả tương ứng, Tóm tắt, Từ khóa, Danh pháp (nếu có), Giới thiệu, Thử nghiệm, Lý thuyết, Kết quả và thảo luận, Kết luận, Xung đột quan tâm, Lời cảm ơn (nếu có), Tài liệu tham khảo, Phụ lục (nếu có). Bản xuất bản trước phải được định dạng theo Mẫu (phiên bản MS-Word).\\n2. Bài báo tổng quan:\\nNgoài các bài phê bình được mời, các bài phê bình tài liệu, bài phê bình có hệ thống và bài phê bình sẽ được chấp nhận để xem xét. Bản thảo cần được soạn thảo và sắp xếp theo trình tự yêu cầu: Tên sách, Tên tác giả, Liên kết, Địa chỉ email, Tóm tắt, Từ khóa, Nội dung chính, Kết luận, Xung đột lợi ích, Lời cảm ơn (nếu có), Tài liệu tham khảo. Mặc dù, cấu trúc văn bản chính có thể thay đổi dựa trên các chủ đề phụ của bài đánh giá, các bài báo nên được định dạng theo các Mẫu phù hợp như các bài báo nghiên cứu.\\n\"}]}",{"VOID":726},"YPoBvsIAAAAJ",[],[],[],"https:\u002F\u002Fsj.hpu2.edu.vn\u002Findex.php\u002Fjournal","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F954132b5-ca74-461c-b819-45ad6e49a404\u002F2790ef1d0a7d7a40a504c2fc1647f670.jpg",{"impactFactor":32,"impactFactorByYear":733,"i10Index":32,"i10IndexLast5Year":32,"totalPublication":329,"totalPublicationByYear":735,"totalCitation":134,"totalCitationByYear":736,"totalCitationPerPublication":524,"totalCitationPerPublicationByYear":737,"hindexLast5Year":123,"hindex":123},{"2024":734},0.17,{"2022":136,"2023":278,"2024":142},{"2022":357,"2023":126,"2024":123},{"2022":169,"2023":224,"2024":165},{"impactFactor":28,"impactFactorByYear":28,"i10Index":45,"i10IndexLast5Year":45,"totalPublication":330,"totalPublicationByYear":739,"totalCitation":154,"totalCitationByYear":740,"totalCitationPerPublication":741,"totalCitationPerPublicationByYear":742,"hindexLast5Year":46,"hindex":46},{"0":123,"2022":134,"2023":136,"2024":69,"2025":145},{"2023":46,"2024":136,"2025":201,"2026":278},1.22,{"2023":113,"2024":340,"2025":743},4.56,{"id":745,"createTime":746,"updateTime":747,"relativeEntities":748,"slug":749,"properties":750,"entityType":25,"verifyStatus":26,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":69,"subjectFields":762,"manageAffiliations":763,"indexDatabases":771,"url":817,"thumbnailPath":28,"statistic":818,"gsStatistic":850,"type":55,"analyzePriority":28},"21ccdb34-414d-420f-8a60-a592a2fa848e","2023-05-29T10:42:53.358+00:00","2026-08-27T01:57:29.560+00:00",[],"Vietnam-Journal-of-Earth-Sciences",{"country":751,"eissn":752,"issn":754,"title":756,"introduce":758,"gsId":760},{"VOID":15},{"VOID":753},"26159783",{"VOID":755},"08667187",{"EN":757},"Vietnam Journal of Earth Sciences",{"EN":759},"Science of the Earth, formerly Vietnam Journal of Earth Sciences, is a peer-reviewed journal to publish high-quality articles on the entire range of earth sciences and the environment, focused on the Asia Pacific region and their correlations and connections to the globe. The journal publishes fundamental and applied research in earth sciences and the environment, including geology, geophysics, geography, soil science, hydrology, meteorology, oceanography, petroleum, geohazards, environmental sciences, environmental engineering, sustainable development, geoinformatics, geodesy, GIS, and remote sensing.",{"VOID":761},"5htfr3YAAAAJ",[],[764],{"id":73,"createTime":28,"updateTime":28,"relativeEntities":765,"slug":28,"properties":766,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":82,"parentIds":770,"statistic":28},[],{"title":767,"country":768,"abbreviation":769},{"EN":77,"VI":78},{"VOID":15},{"VOID":81},[],[772,789,800],{"id":773,"indexDatabase":774,"url":784,"indexYears":785,"academicFieldIds":786,"indexDatabaseRanking":788},"6ace2085-a177-4a27-b309-8813b832111e",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":776,"label":777,"description":779,"key":781,"publicationTags":782,"standard":28},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":778,"VI":778},"Scopus - Elsevier",{"EN":778,"VI":780},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[783],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F21101039869","2018-2024",[787],"1689391c-5702-4349-aaa7-d720ee4321fc","NONE",{"id":790,"indexDatabase":791,"url":796,"indexYears":797,"academicFieldIds":798,"indexDatabaseRanking":28},"dadb15a8-ee22-41c2-a287-49e969d9a998",{"id":88,"createTime":28,"updateTime":28,"relativeEntities":792,"label":793,"description":794,"key":94,"publicationTags":795,"standard":28},[],{"EN":91,"VI":91},{"EN":93,"VI":93},[96],"https:\u002F\u002Fasean-cites.org\u002Fjournal_info?jid=10629","2016-2022",[799],"e04f14cf-280b-4aa8-b711-b77ddd79cbaf",{"id":801,"indexDatabase":802,"url":814,"indexYears":28,"academicFieldIds":815,"indexDatabaseRanking":28},"06f278ee-37b9-41eb-a9b0-3d2d77fa502b",{"id":803,"createTime":28,"updateTime":28,"relativeEntities":804,"label":805,"description":807,"key":810,"publicationTags":811,"standard":28},"88bab0f7-443b-476c-a72a-7fa5222da393",[],{"EN":806,"VI":806},"ISI\u002FESCI  - Emerging Sources Citation Index",{"EN":808,"VI":809},"ESCI database","Cơ sở dữ liệu ESCI","esci",[812,813],"ESCI","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0866-7187",[816],"0db73426-2364-455f-81a4-efe0f91d712e","https:\u002F\u002Fvjs.ac.vn\u002Findex.php\u002Fjse\u002F",{"impactFactor":32,"impactFactorByYear":819,"i10Index":151,"i10IndexLast5Year":132,"totalPublication":824,"totalPublicationByYear":825,"totalCitation":827,"totalCitationByYear":828,"totalCitationPerPublication":838,"totalCitationPerPublicationByYear":839,"hindexLast5Year":129,"hindex":129},{"2007":513,"2008":513,"2010":513,"2011":107,"2012":513,"2013":513,"2014":317,"2015":107,"2016":54,"2017":168,"2018":222,"2019":820,"2020":821,"2021":371,"2022":445,"2023":822,"2024":823},1.03,1.08,1.49,1.43,1180,{"2000":689,"2001":688,"2002":281,"2003":160,"2004":279,"2005":325,"2006":516,"2007":137,"2008":200,"2009":162,"2010":436,"2011":826,"2012":434,"2013":689,"2014":280,"2015":152,"2016":150,"2017":148,"2018":352,"2019":147,"2020":152,"2021":69,"2022":148,"2023":280,"2024":139,"2025":45},79,2421,{"2000":205,"2001":51,"2002":145,"2003":146,"2004":126,"2005":51,"2006":130,"2007":128,"2008":127,"2009":152,"2010":122,"2011":137,"2012":567,"2013":200,"2014":829,"2015":687,"2016":830,"2017":831,"2018":832,"2019":833,"2020":834,"2021":835,"2022":836,"2023":837,"2024":145,"2025":40},73,197,219,380,281,328,148,183,160,2.05,{"2000":365,"2001":168,"2002":365,"2003":167,"2004":168,"2005":121,"2006":224,"2007":840,"2008":118,"2009":367,"2010":284,"2011":170,"2012":707,"2013":693,"2014":822,"2015":841,"2016":842,"2017":843,"2018":844,"2019":845,"2020":846,"2021":847,"2022":848,"2023":849,"2024":52,"2025":168},0.47,1.91,4.93,7.3,11.52,9.06,7.63,5.1,6.1,3.27,{"impactFactor":28,"impactFactorByYear":28,"i10Index":435,"i10IndexLast5Year":155,"totalPublication":130,"totalPublicationByYear":851,"totalCitation":852,"totalCitationByYear":853,"totalCitationPerPublication":860,"totalCitationPerPublicationByYear":861,"hindexLast5Year":136,"hindex":133},{"1017":40,"2015":40,"2016":123,"2017":42,"2018":42,"2019":40,"2020":45,"2022":123,"2023":123,"2024":40},3528,{"2014":323,"2015":140,"2016":201,"2017":158,"2018":522,"2019":613,"2020":854,"2021":855,"2022":701,"2023":856,"2024":857,"2025":858,"2026":859},280,403,436,525,589,366,176.4,{"2015":140,"2016":862,"2017":134,"2018":352,"2019":613,"2020":159,"2022":863,"2023":864,"2024":857},20.5,212.5,218,{"code":866,"data":867,"meta":28},"SUCCESS",{"id":868,"createTime":869,"updateTime":870,"relativeEntities":871,"slug":872,"properties":873,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":879,"manageAffiliations":904,"indexDatabases":912,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},"7fa6a754-28aa-4ea5-813c-51357b724729","2023-12-05T06:17:50.358+00:00","2025-11-21T09:58:54.998+00:00",[],"Knowledge-Based-Systems",{"issn":874,"title":876},{"VOID":875},"09507051",{"EN":877},"Knowledge-Based Systems","PENDING",[880,886,892,898],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":882,"label":883,"description":885,"parentId":28,"standard":28,"scholarHubFieldId":28},"6a3cb349-a9fc-40fb-9aa8-c9946de1e629",[],{"EN":884},"Artificial Intelligence",{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":888,"label":889,"description":891,"parentId":28,"standard":28,"scholarHubFieldId":28},"aae089e7-8b62-4df4-ab86-aada3693b3f8",[],{"EN":890},"Software",{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":894,"label":895,"description":897,"parentId":28,"standard":28,"scholarHubFieldId":28},"c673de98-4cf7-457f-82dd-3489e0368ca7",[],{"EN":896},"Management Information Systems",{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":900,"label":901,"description":903,"parentId":28,"standard":28,"scholarHubFieldId":28},"e408ae20-6803-4097-9614-89dd11b88962",[],{"EN":902},"Information Systems and Management",{},[905],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":907,"slug":28,"properties":908,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":911,"statistic":28},"c749757b-dddf-4e6f-9697-b9c441adc06c",[],{"title":909},{"EN":910},"Elsevier",[],[913,929],{"id":914,"indexDatabase":915,"url":926,"indexYears":28,"academicFieldIds":927,"indexDatabaseRanking":28},"c969f6a8-8095-44c6-9de0-02ff37a4d19c",{"id":916,"createTime":28,"updateTime":28,"relativeEntities":917,"label":918,"description":920,"key":923,"publicationTags":924,"standard":28},"a4921856-b128-4d9f-8f1f-e80813d3bbd4",[],{"EN":919,"VI":919},"ISI\u002FSCIE - Science Citation Index Expanded",{"EN":921,"VI":922},"SCIE database","Cơ sở dữ liệu SCIE","scie",[925,813],"SCIE","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0950-7051",[928],"1acb72da-cafe-4349-b117-01c5aabcd399",{"id":930,"indexDatabase":931,"url":936,"indexYears":937,"academicFieldIds":938,"indexDatabaseRanking":943},"6a77512c-2972-4e71-95d4-88717a329508",{"id":775,"createTime":28,"updateTime":28,"relativeEntities":932,"label":933,"description":934,"key":781,"publicationTags":935,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],"https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F24772","1987-2025",[939,940,941,942],"668a627d-f270-4944-8b67-168dd9df5805","ea95f5ee-62c8-4ccb-8e3e-d3a8bc9e97cb","f8ab36fc-bc72-48f2-a425-9f3e042f2272","b9d39d61-9a3d-4dc5-9ca6-68f27e2cfc9f","SCOPUS__Q2",{"meta":945,"data":947},{"total":946},"3775",[948,1050,1132,1284,1395,1490,1667,1794,1904,2039],{"id":949,"createTime":950,"updateTime":951,"relativeEntities":952,"slug":953,"properties":954,"entityType":961,"verifyStatus":26,"verifyTime":951,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":963,"fullTextUrl":28,"authors":964,"publicationType":996,"publisherRelationship":997,"citationCount":28,"citationInfo":28,"publishDate":1046,"publishYear":1047,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1048,"openAccess":28,"references":28,"isForceReanalyzing":1049},"002effb9-21b4-4b53-a1b6-46fbb5838931","2023-12-28T16:27:05.879+00:00","2025-01-25T06:27:21.921+00:00",[],"Opportunistic-software-architecture-for-support-of-design-coordination",{"title":955,"references":957,"doi":959},{"EN":956},"Opportunistic software architecture for support of design coordination",{"VOID":958},"Derrington, 1987, Management of the design process, 19\nMarechal, 1987, The ARCADE and OSA contribution to the theory of integrated CAD systems, 407\nAndreasen, 1990, The concept of dispositions, J. Eng. Des., Vol 1, 17, 10.1080\u002F09544829008901640\nHarker, 1988, The evolution of organisation design, IEE Rev., 271, 10.1049\u002Fir:19880103\nMacCallum, 1985, An intelligent concept design assistant, 301\nCarter, 1991, The support of engineering design coordination by cooperating knowledge resources\nBrown, 1985, Expert systems for a class of mechanical design activity, 259\nBrown, 1985, Capturing mechanical design knowledge, 121\nKitzmiller, 1987, Design in a distributed blackboard framework, 223\nSriram, 1986, DESTINY: a model for integrated structural design, Int. J. AI Eng., Vol 1, 109\nFenves, 1990, Integrated software environment for building design and construction, Comput.-Aided Des., Vol 22, 27, 10.1016\u002F0010-4485(90)90026-9\nDaniell, 1989\nJones, 1980\nNii, 1986, Blackboard systems: the blackboard model of problem solving and the evolution of blackboard architectures, AI Magazine, Vol 7, 38\nNii, 1986, Blackboard systems: blackboard application systems, blackboard systems from a knowledge engineering perspective, AI Magazine, Vol 7, 82\nDavid, 1987, Multi-expert systems for CAD, 57\nChalfan, 1986, A knowledge system that integrates heterogeneous software for a design application, AI Magazine, Vol 7, 80\nAnderson, 1989, Product structure guide\nHyde, 1981\nCorby, 1986, Blackboard architectures in computer aided engineering, Int. J. AI Eng., Vol 1, 95\nEastman, 1980, A prototype integrated building model\nEnglemore, 1988\nHayes-Roth, 1985, A blackboard architecture for control, Artif. Intell., Vol 26, 251, 10.1016\u002F0004-3702(85)90063-3\nErman, 1980, The Hearsay-II speech understanding system: integrating knowledge to resolve uncertainty, ACM Comput. Surv., Vol 12, 213, 10.1145\u002F356810.356816\nKloth, 1989, Some ideas on a blackboard system for design tasks\n‘Generator handbook’ NEI Parsons (internal document)\n‘Design sheet calculation manual’ NEI Parsons (internal document)\nMacCallum, 1985, A knowledge based system for handling quantitative information\nCarter, 1988, The use of a numerical design tool to model an electrical generator\nSchön, D ‘Designing as reflective conversation with the materials of a design situation’ Research in Engineering Design Vol 3, Issue 3, Springer-Verlag, USA",{"VOID":960},"10.1016\u002F0950-7051(92)90024-a","PUBLICATION","Auto Verify","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F095070519290024A",[965,981],{"id":966,"sortIndex":32,"researcher":28,"roles":967,"affiliations":969,"properties":978,"displayName":980,"givenName":28,"familyName":28},"90578ec2-f771-497b-a026-96dd62edcfaf",[968],"AUTHOR",[970],{"id":971,"sortIndex":32,"affiliation":972,"properties":28},"de604f3a-806e-4996-ac56-31ad71ff6520",{"id":971,"createTime":28,"updateTime":28,"relativeEntities":973,"slug":28,"properties":974,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":977,"statistic":28},[],{"title":975},{"VI":976},"CAD Centre, University of Strathclyde, 75 Montrose Street, Glasgow G1 1XJ, UK",[],{"title":979},{"VI":980},"K.J. MacCallum",{"id":982,"sortIndex":40,"researcher":28,"roles":983,"affiliations":984,"properties":993,"displayName":995,"givenName":28,"familyName":28},"5776e67d-abd5-41ad-b47c-5e4222de069e",[968],[985],{"id":986,"sortIndex":32,"affiliation":987,"properties":28},"35f7b672-a07f-4662-81eb-671dfeb26915",{"id":986,"createTime":28,"updateTime":28,"relativeEntities":988,"slug":28,"properties":989,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":992,"statistic":28},[],{"title":990},{"VI":991},"Engineering Design Research Centre, 1 Todd Campus, West of Scotland Science Park, Glasgow G20 0XA, UK",[],{"title":994},{"VI":995},"I.M. Carter","ARTICLE",{"url":963,"publisher":998,"properties":1041},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":999,"slug":872,"properties":1000,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1003,"manageAffiliations":1020,"indexDatabases":1026,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1001,"title":1002},{"VOID":875},{"EN":877},[1004,1008,1012,1016],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1005,"label":1006,"description":1007,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1009,"label":1010,"description":1011,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1013,"label":1014,"description":1015,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":1017,"label":1018,"description":1019,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[1021],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":1022,"slug":28,"properties":1023,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1025,"statistic":28},[],{"title":1024},{"EN":910},[],[1027,1034],{"id":930,"indexDatabase":1028,"url":936,"indexYears":937,"academicFieldIds":1033,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1029,"label":1030,"description":1031,"key":781,"publicationTags":1032,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":1035,"url":926,"indexYears":28,"academicFieldIds":1040,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":1036,"label":1037,"description":1038,"key":923,"publicationTags":1039,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":1042,"volume":1044},{"VOID":1043},"55-65",{"VOID":1045},"5","1992-03-01",1992,[943,925],false,{"id":1051,"createTime":1052,"updateTime":1053,"relativeEntities":1054,"slug":1055,"properties":1056,"entityType":961,"verifyStatus":26,"verifyTime":1053,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1063,"fullTextUrl":28,"authors":1064,"publicationType":996,"publisherRelationship":1080,"citationCount":28,"citationInfo":28,"publishDate":1129,"publishYear":1130,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1131,"openAccess":28,"references":28,"isForceReanalyzing":1049},"00323765-6c1b-4562-9686-f3b2b45a1bcd","2024-01-14T22:14:30.435+00:00","2025-01-06T16:55:27.482+00:00",[],"Synthesizing-credit-data-using-autoencoders-and-generative-adversarial-networks",{"title":1057,"references":1059,"doi":1061},{"EN":1058},"Synthesizing credit data using autoencoders and generative adversarial networks",{"VOID":1060},"Oreski, 2012, Hybrid system with genetic algorithm and artificial neural networks and its application to retail credit risk assessment, Expert Syst. Appl., 39, 12605, 10.1016\u002Fj.eswa.2012.05.023\nEngelmann, 2021, Conditional Wasserstein GAN-based oversampling of tabular data for imbalanced learning, Expert Syst. Appl., 174, 10.1016\u002Fj.eswa.2021.114582\nWaheed, 2021, Balancing sequential data to predict students at-risk using adversarial networks, Comput. Electr. Eng., 93, 10.1016\u002Fj.compeleceng.2021.107274\nWoldesellasse, 2022, Data augmentation using conditional generative adversarial network (cGAN): Application for prediction of corrosion pit depth and testing using neural network, J. Pipeline Sci. Eng.\nHabibi, 2023, Imbalanced tabular data modelization using CTGAN and machine learning to improve IoT botnet attacks detection, Eng. Appl. Artif. Intell., 118, 10.1016\u002Fj.engappai.2022.105669\nP. Ghosh, M.S. Sajjadi, A. Vergari, M. Black, B. Scholkopf, From Variational to Deterministic Autoencoders, in: International Conference on Learning Representations, 2019.\nA. Brock, J. Donahue, K. Simonyan, Large Scale GAN Training for High Fidelity Natural Image Synthesis, in: International Conference on Learning Representations, 2018.\nJ. Gu, J. Cai, S.R. Joty, L. Niu, G. Wang, Look, imagine and match: Improving textual-visual cross-modal retrieval with generative models, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2018, pp. 7181–7189.\nG. Izacard, É. Grave, Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering, in: Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, 2021, pp. 874–880.\nYogatama, 2017, Generative and discriminative text classification with recurrent neural networks\nGoodfellow, 2020, Generative adversarial networks, Commun. ACM, 63, 139, 10.1145\u002F3422622\nXu, 2019, Modeling tabular data using conditional GAN, Adv. Neural Inf. Process. Syst., 32, 7335\nLuo, 2020, Unsupervised quadratic surface support vector machine with application to credit risk assessment, European J. Oper. Res., 280, 1008, 10.1016\u002Fj.ejor.2019.08.010\nTripathi, 2020, Evolutionary extreme learning machine with novel activation function for credit scoring, Eng. Appl. Artif. Intell., 96, 10.1016\u002Fj.engappai.2020.103980\nShen, 2019, A novel ensemble classification model based on neural networks and a classifier optimisation technique for imbalanced credit risk evaluation, Physica A, 526, 10.1016\u002Fj.physa.2019.121073\nPławiak, 2020, DGHNL: A new deep genetic hierarchical network of learners for prediction of credit scoring, Inform. Sci., 516, 401, 10.1016\u002Fj.ins.2019.12.045\nXia, 2020, A novel tree-based dynamic heterogeneous ensemble method for credit scoring, Expert Syst. Appl., 159, 10.1016\u002Fj.eswa.2020.113615\nZhang, 2021, A new hybrid ensemble model with voting-based outlier detection and balanced sampling for credit scoring, Expert Syst. Appl., 174, 10.1016\u002Fj.eswa.2021.114744\nHou, 2020, A novel dynamic ensemble selection classifier for an imbalanced data set: An application for credit risk assessment, Knowl.-Based Syst., 208, 10.1016\u002Fj.knosys.2020.106462\nDastile, 2020, Statistical and machine learning models in credit scoring: A systematic literature survey, Appl. Soft Comput., 91, 10.1016\u002Fj.asoc.2020.106263\nGuo, 2019, A multi-stage self-adaptive classifier ensemble model with application in credit scoring, IEEE Access, 7, 78549, 10.1109\u002FACCESS.2019.2922676\nFeng, 2018, Dynamic ensemble classification for credit scoring using soft probability, Appl. Soft Comput., 65, 139, 10.1016\u002Fj.asoc.2018.01.021\nTripathi, 2018, Credit scoring model based on weighted voting and cluster based feature selection, Procedia Comput. Sci., 132, 22, 10.1016\u002Fj.procs.2018.05.055\nTomczak, 2015, Classification restricted Boltzmann machine for comprehensible credit scoring model, Expert Syst. Appl., 42, 1789, 10.1016\u002Fj.eswa.2014.10.016\nMancisidor, 2020, Deep generative models for reject inference in credit scoring, Knowl.-Based Syst., 196, 10.1016\u002Fj.knosys.2020.105758\nShen, 2021, A new deep learning ensemble credit risk evaluation model with an improved synthetic minority oversampling technique, Appl. Soft Comput., 98, 10.1016\u002Fj.asoc.2020.106852\nMancisidor, 2022, Generating customer’s credit behavior with deep generative models, Knowl.-Based Syst., 245, 10.1016\u002Fj.knosys.2022.108568\nThabtah, 2020, Data imbalance in classification: Experimental evaluation, Inform. Sci., 513, 429, 10.1016\u002Fj.ins.2019.11.004\nJunior, 2020, A novel approach to define the local region of dynamic selection techniques in imbalanced credit scoring problems, Expert Syst. Appl., 152\nLi, 2020, ACO resampling: Enhancing the performance of oversampling methods for class imbalance classification, Knowl.-Based Syst., 196, 10.1016\u002Fj.knosys.2020.105818\nChen, 2021, A hybrid data-level ensemble to enable learning from highly imbalanced dataset, Inform. Sci., 554, 157, 10.1016\u002Fj.ins.2020.12.023\nX. Mao, Q. Li, H. Xie, R.Y. Lau, Z. Wang, S. Paul Smolley, Least squares generative adversarial networks, in: Proceedings of the IEEE International Conference on Computer Vision, 2017, pp. 2794–2802.\nT. Miyato, T. Kataoka, M. Koyama, Y. Yoshida, Spectral Normalization for Generative Adversarial Networks, in: International Conference on Learning Representations, 2018.\nT. Karras, S. Laine, T. Aila, A style-based generator architecture for generative adversarial networks, in: Proceedings of the IEEE\u002FCVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 4401–4410.\nXu, 2018\nChoi, 2017, Generating multi-label discrete patient records using generative adversarial networks, 286\nPark, 2018, Data synthesis based on generative adversarial networks, Proc. VLDB Endow., 11, 1071, 10.14778\u002F3231751.3231757\nRadford, 2016\nJ. Jordon, J. Yoon, M. Van Der Schaar, PATE-GAN: Generating synthetic data with differential privacy guarantees, in: International Conference on Learning Representations, 2018.\nFiore, 2019, Using generative adversarial networks for improving classification effectiveness in credit card fraud detection, Inform. Sci., 479, 448, 10.1016\u002Fj.ins.2017.12.030\nDouzas, 2018, Effective data generation for imbalanced learning using conditional generative adversarial networks, Expert Syst. Appl., 91, 464, 10.1016\u002Fj.eswa.2017.09.030\nWang, 2020, Imbalanced sample fault diagnosis of rotating machinery using conditional variational auto-encoder generative adversarial network, Appl. Soft Comput., 92, 10.1016\u002Fj.asoc.2020.106333\nAshrapov, 2020\nBank, 2020\nGoodfellow, 2016\nRumelhart, 1986, Learning representations by back-propagating errors, Nature, 323, 533, 10.1038\u002F323533a0\nRibeiro, 2018, A study of deep convolutional auto-encoders for anomaly detection in videos, Pattern Recognit. Lett., 105, 13, 10.1016\u002Fj.patrec.2017.07.016\nTschannen, 2018\nDelgado, 2021, Deep learning with small datasets: Using autoencoders to address limited datasets in construction management, Appl. Soft Comput., 112\nSiddiqi, 2012\nZhao, 2015, Investigation and improvement of multi-layer perceptron neural networks for credit scoring, Expert Syst. Appl., 42, 3508, 10.1016\u002Fj.eswa.2014.12.006\nTrinkle, 2016, Research opportunities for neural networks: The case for credit, Int. J. Intell. Syst. Account. Financ. Manage., 23, 240, 10.1002\u002Fisaf.1394\nBranco, 2015\nH. He, Y. Bai, E.A. Garcia, S. Li, ADASYN: Adaptive synthetic sampling approach for imbalanced learning, in: Proceedings of IJCNN, 2008, pp. 1322–1328.\nKunakorntum, 2020, A synthetic minority based on probabilistic distribution (SyMProD) oversampling for imbalanced datasets, IEEE Access, 8, 114692, 10.1109\u002FACCESS.2020.3003346\nDouzas, 2017, Self-organizing map oversampling (SOMO) for imbalanced data set learning, Expert Syst. Appl., 82, 40, 10.1016\u002Fj.eswa.2017.03.073\nBarua, 2014, MWMOTE–majority weighted minority oversampling technique for imbalanced data set learning, IEEE Trans. Knowl. Data Eng., 26, 405, 10.1109\u002FTKDE.2012.232\nBatista, 2004, A study of the behavior of several methods for balancing machine learning training data, SIGKDD Explor. Newsl., 6, 20, 10.1145\u002F1007730.1007735\nNekooeimehr, 2016, Adaptive semi-unsupervised weighted oversampling (a-SUWO) for imbalanced datasets, Expert Syst. Appl., 46, 405, 10.1016\u002Fj.eswa.2015.10.031\nPuntumapon, 2012, A pruning-based approach for searching precise and generalized region for synthetic minority over-sampling, 371\nCieslak, 2006, Combating imbalance in network intrusion datasets, 732\nDouzas, 2018, Improving imbalanced learning through a heuristic oversampling method based on k-means and SMOTE, Inform. Sci., 465, 1, 10.1016\u002Fj.ins.2018.06.056\nLee, 2017, Gaussian-based SMOTE algorithm for solving skewed class distributions, Int. J. Fuzzy Log. Intell. Syst., 17, 229, 10.5391\u002FIJFIS.2017.17.4.229\nRamentol, 2012, SMOTE-RSB*: A hybrid preprocessing approach based on oversampling and undersampling for high imbalanced data-sets using SMOTE and rough sets theory, Knowl. Inf. Syst., 33, 245, 10.1007\u002Fs10115-011-0465-6\nSiriseriwan, 2017, Adaptive neighbor synthetic minority oversampling technique under 1nn outcast handling, 39, 565\nKoziarski, 2017, CCR: A combined cleaning and resampling algorithm for imbalanced data classification, Int. J. Appl. Math. Comput. Sci., 27, 727, 10.1515\u002Famcs-2017-0050\nRong, 2014, Stochastic sensitivity oversampling technique for imbalanced data, 161\nEl Moutaouakil, 2022, Optimal entropy genetic fuzzy-c-means SMOTE (OEGFCM-SMOTE), Knowl.-Based Syst.\nZhang, 2022, SMOTE-RkNN: A hybrid re-sampling method based on SMOTE and reverse k-nearest neighbors, Inform. Sci., 595, 70, 10.1016\u002Fj.ins.2022.02.038\nKovács, 2019, An empirical comparison and evaluation of minority oversampling techniques on a large number of imbalanced datasets, Appl. Soft Comput., 83, 10.1016\u002Fj.asoc.2019.105662\nMasters, 2018\nDemšar, 2006, Statistical comparisons of classifiers over multiple data sets, J. Mach. Learn. Res., 7, 1",{"VOID":1062},"10.1016\u002Fj.knosys.2023.110646","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705123003969",[1065],{"id":1066,"sortIndex":32,"researcher":28,"roles":1067,"affiliations":1068,"properties":1077,"displayName":1079,"givenName":28,"familyName":28},"8a6d1d0b-4279-4df9-9fcc-a73ff9dd4c8e",[968],[1069],{"id":1070,"sortIndex":32,"affiliation":1071,"properties":28},"d004b5bb-e05b-49f6-8cac-5a9f6ab4baf8",{"id":1070,"createTime":28,"updateTime":28,"relativeEntities":1072,"slug":28,"properties":1073,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1076,"statistic":28},[],{"title":1074},{"VI":1075},"Faculty of Informatics, University of Pula, Croatia",[],{"title":1078},{"VI":1079},"Goran Oreski",{"url":1063,"publisher":1081,"properties":1124},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1082,"slug":872,"properties":1083,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1086,"manageAffiliations":1103,"indexDatabases":1109,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1084,"title":1085},{"VOID":875},{"EN":877},[1087,1091,1095,1099],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1088,"label":1089,"description":1090,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1092,"label":1093,"description":1094,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1096,"label":1097,"description":1098,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":1100,"label":1101,"description":1102,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[1104],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":1105,"slug":28,"properties":1106,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1108,"statistic":28},[],{"title":1107},{"EN":910},[],[1110,1117],{"id":930,"indexDatabase":1111,"url":936,"indexYears":937,"academicFieldIds":1116,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1112,"label":1113,"description":1114,"key":781,"publicationTags":1115,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":1118,"url":926,"indexYears":28,"academicFieldIds":1123,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":1119,"label":1120,"description":1121,"key":923,"publicationTags":1122,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":1125,"volume":1127},{"VOID":1126},"110646",{"VOID":1128},"274","2023-08-01",2023,[943,925],{"id":1133,"createTime":1134,"updateTime":1135,"relativeEntities":1136,"slug":1137,"properties":1138,"entityType":961,"verifyStatus":26,"verifyTime":1135,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1145,"fullTextUrl":28,"authors":1146,"publicationType":996,"publisherRelationship":1233,"citationCount":28,"citationInfo":28,"publishDate":1282,"publishYear":1130,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1283,"openAccess":28,"references":28,"isForceReanalyzing":1049},"00516818-baaa-42e3-a8d3-f024b10d8cc2","2024-02-08T17:00:33.850+00:00","2025-02-06T13:31:27.322+00:00",[],"Learning-graph-deep-autoencoder-for-anomaly-detection-in-multi-attributed-networks",{"title":1139,"references":1141,"doi":1143},{"EN":1140},"Learning graph deep autoencoder for anomaly detection in multi-attributed networks",{"VOID":1142},"Li, 2017, Radar: Residual analysis for anomaly detection in attributed networks, 2152\nLiu, 2017, Accelerated local anomaly detection via resolving attributed networks, 2337\nPfeiffer III, 2014, Attributed graph models: Modeling network structure with correlated attributes, 831\nChalapathy, 2019\nFernandes, 2019, A comprehensive survey on network anomaly detection, Telecommun. Syst., 70, 447, 10.1007\u002Fs11235-018-0475-8\nAkoglu, 2015, Graph based anomaly detection and description: a survey, Data Min. Knowl. Discov., 29, 626, 10.1007\u002Fs10618-014-0365-y\nShao, 2017, An efficient approach to event detection and forecasting in dynamic multivariate social media networks, 1631\nAhmed, 2016, A survey of network anomaly detection techniques, J. Netw. Comput. Appl., 60, 19, 10.1016\u002Fj.jnca.2015.11.016\nTong, 2012, Non-negative residual matrix factorization with application to graph anomaly detection, 143\nSun, 2005, Neighborhood formation and anomaly detection in bipartite graphs, 418\nGao, 2010, On community outliers and their efficient detection in information networks, 813\nPerozzi, 2016, Scalable anomaly ranking of attributed neighborhoods, 207\nGao, 2011, A spectral framework for detecting inconsistency across multi-source object relationships, 1050\nDing, 2019, Deep anomaly detection on attributed networks, 594\nSricharan, 2014, Localizing anomalous changes in time-evolving graphs, 1347\nZhou, 2017, Anomaly detection with robust deep autoencoders, 665\nLeCun, 2015, Deep learning, Nature, 521, 436, 10.1038\u002Fnature14539\nDing, 2019, Interactive anomaly detection on attributed networks, 357\nLiu, 2021, Anomaly detection on attributed networks via contrastive self-supervised learning, IEEE Trans. Neural Netw. Learn. Syst., 33, 2378, 10.1109\u002FTNNLS.2021.3068344\nDing, 2019, Deep anomaly detection on attributed networks, 594\nSong, 2007, Conditional anomaly detection, IEEE Trans. Knowl. Data Eng., 19, 631, 10.1109\u002FTKDE.2007.1009\nFan, 2020, Anomalydae: Dual autoencoder for anomaly detection on attributed networks, 5685\nChen, 2020, Generative adversarial attributed network anomaly detection, 1989\nSong, 2007, Conditional anomaly detection, IEEE Trans. Knowl. Data Eng., 19, 631, 10.1109\u002FTKDE.2007.1009\nDing, 2019, Interactive anomaly detection on attributed networks, 357\nBreunig, 2000, LOF: identifying density-based local outliers, 93\nHuang, 2021, A multi-channel anomaly detection method with feature selection and multi-scale analysis, Comput. Netw., 185, 10.1016\u002Fj.comnet.2020.107645\nXie, 2020, Unsupervised spectral mapping and feature selection for hyperspectral anomaly detection, Neural Netw., 132, 144, 10.1016\u002Fj.neunet.2020.08.010\nJiang, 2015, A relative decision entropy-based feature selection approach, Pattern Recognit., 48, 2151, 10.1016\u002Fj.patcog.2015.01.023\nJiang, 2015, A novel approach for discretization of continuous attributes in rough set theory, Knowl.-Based Syst., 73, 324, 10.1016\u002Fj.knosys.2014.10.014\nHe, 2016, Experience report: System log analysis for anomaly detection, 207\nZhang, 2017, Automated IT system failure prediction: A deep learning approach, 1291\nPerozzi, 2014, Focused clustering and outlier detection in large attributed graphs, 1346\nMüller, 2013, Ranking outlier nodes in subspaces of attributed graphs, 216\nHorng, 2011, A novel intrusion detection system based on hierarchical clustering and support vector machines, Expert Syst. Appl., 38, 306, 10.1016\u002Fj.eswa.2010.06.066\nManzoor, 2016, Fast memory-efficient anomaly detection in streaming heterogeneous graphs, 1035\nAggarwal, 2011, Outlier detection in graph streams\nLiu, 2017, Accelerated local anomaly detection via resolving attributed networks\nShao, 2018, An efficient framework for detecting evolving anomalous subgraphs in dynamic networks, 2258\nSakhaei-nia, 2020, Anomaly detection in dynamic social networks based on behavioral measurement, Electron. Cyber Def.\nMiao, 2018, Distributed online one-class support vector machine for anomaly detection over networks, IEEE Trans. Cybern., 49, 1475, 10.1109\u002FTCYB.2018.2804940\nHu, 2016, An embedding approach to anomaly detection, 385\nBronstein, 2017, Geometric deep learning: Going beyond euclidean data, IEEE Signal Process. Mag., 34, 18, 10.1109\u002FMSP.2017.2693418\nPan, 2016, Tri-party deep network representation, Network, 11, 12\nWang, 2016, Structural deep network embedding, 1225\nChalapathy, 2018\nHamilton, 2017, Inductive representation learning on large graphs, 1024\nLi, 2019, MAD-GAN: Multivariate anomaly detection for time series data with generative adversarial networks, 703\nBruna, 2013\nSandryhaila, 2013, Discrete signal processing on graphs: Graph fourier transform, 6167\nPei, 2020\nMesgaran, 2020\nZheng, 2019, AddGraph: Anomaly detection in dynamic graph using attention-based temporal GCN",{"VOID":1144},"10.1016\u002Fj.knosys.2022.110084","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705122011807",[1147,1162,1175,1188,1203,1218],{"id":1148,"sortIndex":32,"researcher":28,"roles":1149,"affiliations":1150,"properties":1159,"displayName":1161,"givenName":28,"familyName":28},"2f75b834-00c6-4af4-b9e2-7fb274658061",[968],[1151],{"id":1152,"sortIndex":32,"affiliation":1153,"properties":28},"0b853f36-b74f-4b6c-b5f2-02ec0088c205",{"id":1152,"createTime":28,"updateTime":28,"relativeEntities":1154,"slug":28,"properties":1155,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1158,"statistic":28},[],{"title":1156},{"VI":1157},"School of New Media and Communications, Tianjin University, Tianjin, China",[],{"title":1160},{"VI":1161},"Minglai Shao",{"id":1163,"sortIndex":40,"researcher":28,"roles":1164,"affiliations":1165,"properties":1172,"displayName":1174,"givenName":28,"familyName":28},"99561812-206b-4d82-94f1-9a73b83411a7",[968],[1166],{"id":1152,"sortIndex":32,"affiliation":1167,"properties":28},{"id":1152,"createTime":28,"updateTime":28,"relativeEntities":1168,"slug":28,"properties":1169,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1171,"statistic":28},[],{"title":1170},{"VI":1157},[],{"title":1173},{"VI":1174},"Yujie Lin",{"id":1176,"sortIndex":123,"researcher":28,"roles":1177,"affiliations":1178,"properties":1185,"displayName":1187,"givenName":28,"familyName":28},"7bf100ed-ccf7-40ab-8f5a-841000c0ef48",[968],[1179],{"id":1152,"sortIndex":32,"affiliation":1180,"properties":28},{"id":1152,"createTime":28,"updateTime":28,"relativeEntities":1181,"slug":28,"properties":1182,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1184,"statistic":28},[],{"title":1183},{"VI":1157},[],{"title":1186},{"VI":1187},"Qiyao Peng",{"id":1189,"sortIndex":42,"researcher":28,"roles":1190,"affiliations":1191,"properties":1200,"displayName":1202,"givenName":28,"familyName":28},"24cb2943-fcfb-498e-94ca-3df6062e1e26",[968],[1192],{"id":1193,"sortIndex":32,"affiliation":1194,"properties":28},"615997b3-c252-4f87-81b0-88d52337d33e",{"id":1193,"createTime":28,"updateTime":28,"relativeEntities":1195,"slug":28,"properties":1196,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1199,"statistic":28},[],{"title":1197},{"VI":1198},"School of Information Science and Engineering, Shandong Normal University, Jinan, China",[],{"title":1201},{"VI":1202},"Jun Zhao",{"id":1204,"sortIndex":45,"researcher":28,"roles":1205,"affiliations":1206,"properties":1215,"displayName":1217,"givenName":28,"familyName":28},"dd27a0df-b3ef-43d8-9cfa-1f2f93a3cf11",[968],[1207],{"id":1208,"sortIndex":32,"affiliation":1209,"properties":28},"15c0ba28-cb60-4deb-9993-40d7a84720d7",{"id":1208,"createTime":28,"updateTime":28,"relativeEntities":1210,"slug":28,"properties":1211,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1214,"statistic":28},[],{"title":1212},{"VI":1213},"School of Computer Science and Engineering, Beihang University, Beijing, China",[],{"title":1216},{"VI":1217},"Zhan Pei",{"id":1219,"sortIndex":46,"researcher":28,"roles":1220,"affiliations":1221,"properties":1230,"displayName":1232,"givenName":28,"familyName":28},"80240b97-bf28-4599-ab90-6c200fc96ccf",[968],[1222],{"id":1223,"sortIndex":32,"affiliation":1224,"properties":28},"b10dec13-4f3f-477f-9f6d-f8ed1b168612",{"id":1223,"createTime":28,"updateTime":28,"relativeEntities":1225,"slug":28,"properties":1226,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1229,"statistic":28},[],{"title":1227},{"VI":1228},"College of Intelligence and Computing, Tianjin University, Tianjin, China",[],{"title":1231},{"VI":1232},"Yueheng Sun",{"url":1145,"publisher":1234,"properties":1277},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1235,"slug":872,"properties":1236,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1239,"manageAffiliations":1256,"indexDatabases":1262,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1237,"title":1238},{"VOID":875},{"EN":877},[1240,1244,1248,1252],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1241,"label":1242,"description":1243,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1245,"label":1246,"description":1247,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1249,"label":1250,"description":1251,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":1253,"label":1254,"description":1255,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[1257],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":1258,"slug":28,"properties":1259,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1261,"statistic":28},[],{"title":1260},{"EN":910},[],[1263,1270],{"id":930,"indexDatabase":1264,"url":936,"indexYears":937,"academicFieldIds":1269,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1265,"label":1266,"description":1267,"key":781,"publicationTags":1268,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":1271,"url":926,"indexYears":28,"academicFieldIds":1276,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":1272,"label":1273,"description":1274,"key":923,"publicationTags":1275,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":1278,"volume":1280},{"VOID":1279},"110084",{"VOID":1281},"260","2023-01-01",[943,925],{"id":1285,"createTime":1286,"updateTime":1287,"relativeEntities":1288,"slug":1289,"properties":1290,"entityType":961,"verifyStatus":26,"verifyTime":1297,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1298,"fullTextUrl":28,"authors":1299,"publicationType":996,"publisherRelationship":1343,"citationCount":28,"citationInfo":28,"publishDate":1392,"publishYear":1393,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1394,"openAccess":28,"references":28,"isForceReanalyzing":1049},"0058c8ed-5864-47f5-9aa3-ebb03b01435f","2024-01-06T00:02:54.387+00:00","2025-01-13T12:27:11.618+00:00",[],"Class-imbalanced-positive-instances-augmentation-via-three-line-hybrid",{"title":1291,"references":1293,"doi":1295},{"EN":1292},"Class-imbalanced positive instances augmentation via three-line hybrid",{"VOID":1294},"He, 2009, Learning from imbalanced data, IEEE Trans. Knowl. Data Eng., 21, 1263, 10.1109\u002FTKDE.2008.239\nDas, 2018, Handling data irregularities in classification: foundations, trends, and future challenges, Pattern Recognit., 81, 674, 10.1016\u002Fj.patcog.2018.03.008\nVuttipittayamongkol, 2021, On the class overlap problem in imbalanced data classification, Knowl.-Based Syst., 212, 10.1016\u002Fj.knosys.2020.106631\nWang, 2021, A novel deep metric learning model for imbalanced fault diagnosis and toward open-set classification, Knowl.-Based Syst., 220, 10.1016\u002Fj.knosys.2021.106925\nAn, 2021, Self-learning transferable neural network for intelligent fault diagnosis of rotating machinery with unlabeled and imbalanced data, Knowl.-Based Syst., 230, 10.1016\u002Fj.knosys.2021.107374\nAndresini, 2021, Nearest cluster-based intrusion detection through convolutional neural networks, Knowl.-Based Syst., 216, 10.1016\u002Fj.knosys.2021.106798\nChen, 2021, Multi-scale self-organizing map assisted deep autoencoding Gaussian mixture model for unsupervised intrusion detection, Knowl.-Based Syst., 224, 10.1016\u002Fj.knosys.2021.107086\nWang, 2021, Cognitive structure learning model for hierarchical multi-label text classification, Knowl.-Based Syst., 218, 10.1016\u002Fj.knosys.2021.106876\nMunkhdalai, 2020, GEV-NN: A deep neural network architecture for class imbalance problem in binary classification, Knowl.-Based Syst., 194, 10.1016\u002Fj.knosys.2020.105534\nLi, 2021, How to identify early defaults in online lending: a cost-sensitive multi-layer learning framework, Knowl.-Based Syst., 221, 10.1016\u002Fj.knosys.2021.106963\nTomek, 1976, An experiment with the edited nearest-neighbor rule, IEEE Trans. Syst. Man Cybern., 6, 448\nMenardi, 2014, Training and assessing classification rules with unbalanced data, Data Min. Knowl. Discov., 28, 92, 10.1007\u002Fs10618-012-0295-5\nGarcıa, 2012, Evolutionary-based selection of generalized instances for imbalanced classification, Knowl.-Based Syst., 25, 3, 10.1016\u002Fj.knosys.2011.01.012\nKoziarski, 2020, Radial-based undersampling for imbalanced data classification, Pattern Recognit., 102, 10.1016\u002Fj.patcog.2020.107262\nXing, 2018, A study on unstable cuts and its application to sample selection, Int. J. Mach. Learn. Cybern., 9, 1541, 10.1007\u002Fs13042-017-0663-y\nM. Kubat, S. Matwin, Addressing the curse of imbalanced training sets: One-sided selection, in: Proceedings of the 14th International Conference on Machine Learning, Vol. 97, 1997, pp. 179-186.\nSmith, 2014, An instance level analysis of data complexity, Mach. Learn., 95, 225, 10.1007\u002Fs10994-013-5422-z\nWang, 2021, Local distribution-based adaptive minority oversampling for imbalanced data classification, Neurocomputing, 422, 200, 10.1016\u002Fj.neucom.2020.05.030\nZhang, 2014, RWO-sampling: A random walk over-sampling approach to imbalanced data classification, Inf. Fusion, 20, 99, 10.1016\u002Fj.inffus.2013.12.003\nMirzaei, 2021, CDBH: A clustering and density-based hybrid approach for imbalanced data classification, Expert Syst. Appl., 164, 10.1016\u002Fj.eswa.2020.114035\nHoyos-Osorio, 2021, Relevant information undersampling to support imbalanced data classification, Neurocomputing, 436, 136, 10.1016\u002Fj.neucom.2021.01.033\nBunkhumpornpat, 2017, DBMUTE: density-based majority under-sampling technique, Knowl. Inf. Syst., 50, 827, 10.1007\u002Fs10115-016-0957-5\nH. Zhang, M. Cisse, Y.N. Dauphin, D. Lopez-Paz, mixup: beyond empirical risk minimization, in: International Conference on Learning Representations, 2018.\nSeng, 2021, A neighborhood undersampling stacked ensemble (NUS-SE) in imbalanced classification, Expert Syst. Appl., 168, 10.1016\u002Fj.eswa.2020.114246\nYang, 2019, Hybrid classifier ensemble for imbalanced data, IEEE Trans. Neural Netw. Learn. Syst., 31, 1387, 10.1109\u002FTNNLS.2019.2920246\nCastro, 2013, Novel cost-sensitive approach to improve the multilayer perceptron performance on imbalanced data, IEEE Trans. Neural Netw. Learn. Syst., 24, 888, 10.1109\u002FTNNLS.2013.2246188\nCheng, 2016, Cost-sensitive large margin distribution machine for classification of imbalanced data, Pattern Recognit. Lett., 80, 107, 10.1016\u002Fj.patrec.2016.06.009\nLi, 2021, A hybrid method with dynamic weighted entropy for handling the problem of class imbalance with overlap in credit card fraud detection, Expert Syst. Appl., 175, 10.1016\u002Fj.eswa.2021.114750\nCarvalho, 2002, A genetic-algorithm for discovering small-disjunct rules in data mining, Appl. Soft Comput., 2, 75, 10.1016\u002FS1568-4946(02)00031-5\nKang, 2016, A noise-filtered under-sampling scheme for imbalanced classification, IEEE Trans. Cybern., 47, 4263, 10.1109\u002FTCYB.2016.2606104\nKoziarski, 2020, Combined cleaning and resampling algorithm for multi-class imbalanced data with label noise, Knowl.-Based Syst., 204, 10.1016\u002Fj.knosys.2020.106223\nShin, 2021, MI-MOTE: Multiple imputation-based minority oversampling technique for imbalanced and incomplete data classification, Inform. Sci., 575, 80, 10.1016\u002Fj.ins.2021.06.043\nChawla, 2002, SMOTE: synthetic minority over-sampling technique, J. Artificial Intelligence Res., 16, 321, 10.1613\u002Fjair.953\nH. Han, W.Y. Wang, B.H. Mao, Borderline-SMOTE: a new over-sampling method in imbalanced data sets learning, in: International Conference on Intelligent Computing, 2005, pp. 878-887.\nC. Bunkhumpornpat, K. Sinapiromsaran, C. Lursinsap, Safe-level-smote: Safe-level-synthetic minority over-sampling technique for handling the class imbalanced problem, in: Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2009, pp. 475-482.\nH. He, Y. Bai, E.A. Garcia, S. Li, ADASYN: Adaptive synthetic sampling approach for imbalanced learning, in: Proceedings of the 5th IEEE International Joint Conference on Neural Networks, 2008, pp. 1322-1328.\nPuntumapon, 2016, Cluster-based minority over-sampling for imbalanced datasets, IEICE Trans. Inf. Syst., 99, 3101, 10.1587\u002Ftransinf.2016EDP7130\nBunkhumpornpat, 2012, DBSMOTE: Densitybased synthetic minority over-sampling technique, Appl. Intell., 36, 664, 10.1007\u002Fs10489-011-0287-y\nBarua, 2014, MWMOTE-majority weighted minority oversampling technique for imbalanced data set learning, IEEE Trans. Knowl. Data Eng., 26, 405, 10.1109\u002FTKDE.2012.232\nDouzas, 2018, Improving imbalanced learning through a heuristic oversampling method based on k-means and SMOTE, Inform. Sci., 465, 1, 10.1016\u002Fj.ins.2018.06.056\nLiang, 2020, LR-SMOTE-an improved unbalanced data set oversampling based on K-means and SVM, Knowl.-Based Syst., 196, 10.1016\u002Fj.knosys.2020.105845\nElyan, 2021, CDSMOTE: class decomposition and synthetic minority class oversampling technique for imbalanced-data classification, Neural Comput. Appl., 33, 2839, 10.1007\u002Fs00521-020-05130-z\nSoltanzadeh, 2021, RCSMOTE: Range-controlled synthetic minority over-sampling technique for handling the class imbalance problem, Inform. Sci., 542, 92, 10.1016\u002Fj.ins.2020.07.014\nSáez, 2015, SMOTE-IPF: Addressing the noisy and borderline examples problem in imbalanced classification by a re-sampling method with filtering, Inform. Sci., 291, 184, 10.1016\u002Fj.ins.2014.08.051\nMaulidevi, 2021, SMOTE-LOF for noise identification in imbalanced data classification, J. King Saud Univ.-Comput. Inf. Sci.\nWong, 2018, A hybrid evolutionary preprocessing method for imbalanced datasets, Inform. Sci., 454, 161, 10.1016\u002Fj.ins.2018.04.068\nZhu, 2020, EHSO: Evolutionary hybrid sampling in overlapping scenarios for imbalanced learning, Neurocomputing, 417, 333, 10.1016\u002Fj.neucom.2020.08.060\nSong, 2021, Dimension decided harris hawks optimization with Gaussian mutation: Balance analysis and diversity patterns, Knowl.-Based Syst., 215, 10.1016\u002Fj.knosys.2020.106425\nYao, 1996, Fast evolutionary programming, Evol. Program., 3, 451\nWei, 2020, IA-SUWO: An improving adaptive semi-unsupervised weighted oversampling for imbalanced classification problems, Knowl.-Based Syst., 203, 10.1016\u002Fj.knosys.2020.106116\nRong, 2014, Stochastic sensitivity oversampling technique for imbalanced data, 161\nDai, 2022, Multi-granularity relabeled under-sampling algorithm for imbalanced data, Appl. Soft Comput., 124, 10.1016\u002Fj.asoc.2022.109083\nKovács, 2019, An empirical comparison and evaluation of minority oversampling techniques on a large number of imbalanced datasets, Appl. Soft Comput., 83, 10.1016\u002Fj.asoc.2019.105662\nM. Peng, Q. Zhang, X. Xing, T. Gui, X. Huang, Y.G. Jiang, K. Ding, Z. Chen, Trainable undersampling for class-imbalance learning, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33, 1, 2019, pp. 4707-4714.",{"VOID":1296},"10.1016\u002Fj.knosys.2022.109902","2025-01-13T12:27:11.617+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705122009959",[1300,1315,1328],{"id":1301,"sortIndex":32,"researcher":28,"roles":1302,"affiliations":1303,"properties":1312,"displayName":1314,"givenName":28,"familyName":28},"40816033-dd2f-4251-b215-eac687df6110",[968],[1304],{"id":1305,"sortIndex":32,"affiliation":1306,"properties":28},"01d9a3f7-0324-45a4-a81f-5c4c510e05ec",{"id":1305,"createTime":28,"updateTime":28,"relativeEntities":1307,"slug":28,"properties":1308,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1311,"statistic":28},[],{"title":1309},{"VI":1310},"Department of Automation, College of Information Science and Engineering, China University of Petroleum, Beijing, Beijing, China",[],{"title":1313},{"VI":1314},"Qi Dai",{"id":1316,"sortIndex":40,"researcher":28,"roles":1317,"affiliations":1318,"properties":1325,"displayName":1327,"givenName":28,"familyName":28},"30d78948-0941-4883-983a-40fbbb385ccb",[968],[1319],{"id":1305,"sortIndex":32,"affiliation":1320,"properties":28},{"id":1305,"createTime":28,"updateTime":28,"relativeEntities":1321,"slug":28,"properties":1322,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1324,"statistic":28},[],{"title":1323},{"VI":1310},[],{"title":1326},{"VI":1327},"Jian-wei Liu",{"id":1329,"sortIndex":123,"researcher":28,"roles":1330,"affiliations":1331,"properties":1340,"displayName":1342,"givenName":28,"familyName":28},"c9995d3e-cb80-46fe-8580-7383839585e4",[968],[1332],{"id":1333,"sortIndex":32,"affiliation":1334,"properties":28},"4456708d-3849-4607-9544-d770da31d053",{"id":1333,"createTime":28,"updateTime":28,"relativeEntities":1335,"slug":28,"properties":1336,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1339,"statistic":28},[],{"title":1337},{"VI":1338},"College of Science, North China University of Science and Technology (NCUST), Tangshan, China",[],{"title":1341},{"VI":1342},"Jia-peng Yang",{"url":1298,"publisher":1344,"properties":1387},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1345,"slug":872,"properties":1346,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1349,"manageAffiliations":1366,"indexDatabases":1372,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1347,"title":1348},{"VOID":875},{"EN":877},[1350,1354,1358,1362],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1351,"label":1352,"description":1353,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1355,"label":1356,"description":1357,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1359,"label":1360,"description":1361,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":1363,"label":1364,"description":1365,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[1367],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":1368,"slug":28,"properties":1369,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1371,"statistic":28},[],{"title":1370},{"EN":910},[],[1373,1380],{"id":930,"indexDatabase":1374,"url":936,"indexYears":937,"academicFieldIds":1379,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1375,"label":1376,"description":1377,"key":781,"publicationTags":1378,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":1381,"url":926,"indexYears":28,"academicFieldIds":1386,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":1382,"label":1383,"description":1384,"key":923,"publicationTags":1385,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":1388,"volume":1390},{"VOID":1389},"109902",{"VOID":1391},"257","2022-12-01",2022,[943,925],{"id":1396,"createTime":1397,"updateTime":1398,"relativeEntities":1399,"slug":1400,"properties":1401,"entityType":961,"verifyStatus":26,"verifyTime":1398,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1408,"fullTextUrl":28,"authors":1409,"publicationType":996,"publisherRelationship":1438,"citationCount":28,"citationInfo":28,"publishDate":1487,"publishYear":1488,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1489,"openAccess":28,"references":28,"isForceReanalyzing":1049},"005c65fd-1161-4583-95fc-fb39e7aa9e6f","2023-12-06T11:11:59.472+00:00","2024-12-28T08:35:58.794+00:00",[],"Reusing-JessTab-rules-in-Prot%C3%A9g%C3%A9",{"title":1402,"references":1404,"doi":1406},{"EN":1403},"Reusing JessTab rules in Protégé",{"VOID":1405},"G. Antoniou, F. van Harmelen, Web Ontology Language: OWL, in: Staab and Studer [23], pp. 67–92.\nBagula, 2004, Hybrid traffic engineering: the least path interference algorithm, 89\nNASA\u002FJohnson Space Center, CLIPS. \u003Chttp:\u002F\u002Fwww.ghg.net\u002Fclips\u002FCLIPS.html\u002F>.\nCuthbert, 1973, APL models for operational planning of shipment routing loading and scheduling, 622\nEriksson, 2002, The JESSTAB approach to Protégé and JESS integration, 237\n1998\nFriedman-Hill, 2003\nGolbreich, 2004, Combining rule and ontology reasoners for the semantic web, 6\nI. Horrocks, P.F. Patel-Schneider, H. Boley, S. Tabet, B. Grosof, M. Deal, SWRL: A Semantic Web Rule Language Combining OWL and RuleML. W3C Member Submission, May 2004.\nGoogle Inc. Google. \u003Chttp:\u002F\u002Fwww.google.com\u002F>.\nK. Johar, R. Simha, Jword 2.0. \u003Chttp:\u002F\u002Fwww.seas.gwu.edu\u002Fsimhaweb\u002Fsoftware\u002Fjword\u002Findex.html\u002F>.\nJ. Kopena, DAMLJessKB. \u003Chttp:\u002F\u002Fedge.mcs.drexel.edu\u002Fassemblies\u002Fsoftware\u002Fdamljesskb\u002Fdamljesskb.html\u002F>.\nKorf, 1985, Depth-first iterative-deepening: an optimal admissible tree search, Artif. Intell., 27, 97, 10.1016\u002F0004-3702(85)90084-0\nB. McBride, The Resource Description Framework (RDF) and its Vocabulary Description Language RDFS, in: Staab and Studer [23], pp. 51–66.\nMcGuiness, 2000, An environment for merging and testing large ontologies, 483\nP. Mitra, G. Wiederhold, Resolving terminological heterogeneity in ontologies, in: Proceedings of Workshop on Ontologies and Semantic Interoperability at the 15th European Conference on Artificial Intelligence (ECAI 2002), 2002.\nP. Mitra, G. Wiederhold, An ontology-composition algebra, in: Staab and Studer [23], pp. 93–116.\nN.F. Noy, M.A. Musen, PROMPT: algorithm and tool for automated ontology merging and alignment, in: Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), 2000.\nNoy, 2003, The PROMPT suite: interactive tools for ontology merging and mapping, Int. J. Hum-Comput. Stud., 59, 983, 10.1016\u002Fj.ijhcs.2003.08.002\nJ. Park, M. Musen, The Virtual Knowledge Constructor: A Schema for Mapping Across Ontologies in Knowledge-Based Systems, PhD Thesis Proposal, Stanford University, 1999.\nA. Seaborne, RDQL: A Query Language for RDF, W3C Member Submission, January 2004.\nM. Sintek, OKBC Tab Website. \u003Chttp:\u002F\u002Fprotege.stanford.edu\u002Fplugins\u002Fokbctab\u002Fokbc_tab.html\u002F>.\nS. Staab, R. Studer (Ed.), Handbook on Ontologies, International Handbooks on Information Systems, Springer, 2004.\nStanford Medical Informatics, Stanford University, Protégé Website. \u003Chttp:\u002F\u002Fprotege.stanford.edu\u002F>.\nThe Rule Markup Initiative, RuleML Homepage. \u003Chttp:\u002F\u002Fwww.ruleml.org\u002F>.\nT. White, Can’t Beat Jazzy: Introducing the Java Platform’s Jazzy New Spell Checker API. \u003Chttp:\u002F\u002Fwww-106.ibm.com\u002Fdeveloperworks\u002Fjava\u002Flibrary\u002Fj-jazzy\u002F>.",{"VOID":1407},"10.1016\u002Fj.knosys.2005.11.010","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705106000049",[1410,1425],{"id":1411,"sortIndex":32,"researcher":28,"roles":1412,"affiliations":1413,"properties":1422,"displayName":1424,"givenName":28,"familyName":28},"5de535dd-a879-4196-b7ae-5cd2381ddf54",[968],[1414],{"id":1415,"sortIndex":32,"affiliation":1416,"properties":28},"df20dbbc-d5d0-4c20-8584-71ede39aa0f3",{"id":1415,"createTime":28,"updateTime":28,"relativeEntities":1417,"slug":28,"properties":1418,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1421,"statistic":28},[],{"title":1419},{"VI":1420},"Department of Computing Science, University of Aberdeen, Aberdeen AB24 3UE, Scotland, UK",[],{"title":1423},{"VI":1424},"D. Corsar",{"id":1426,"sortIndex":40,"researcher":28,"roles":1427,"affiliations":1428,"properties":1435,"displayName":1437,"givenName":28,"familyName":28},"b768cc3e-f4b8-495f-9700-09b8b0686889",[968],[1429],{"id":1415,"sortIndex":32,"affiliation":1430,"properties":28},{"id":1415,"createTime":28,"updateTime":28,"relativeEntities":1431,"slug":28,"properties":1432,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1434,"statistic":28},[],{"title":1433},{"VI":1420},[],{"title":1436},{"VI":1437},"D. Sleeman",{"url":1408,"publisher":1439,"properties":1482},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1440,"slug":872,"properties":1441,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1444,"manageAffiliations":1461,"indexDatabases":1467,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1442,"title":1443},{"VOID":875},{"EN":877},[1445,1449,1453,1457],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1446,"label":1447,"description":1448,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1450,"label":1451,"description":1452,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1454,"label":1455,"description":1456,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":1458,"label":1459,"description":1460,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[1462],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":1463,"slug":28,"properties":1464,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1466,"statistic":28},[],{"title":1465},{"EN":910},[],[1468,1475],{"id":930,"indexDatabase":1469,"url":936,"indexYears":937,"academicFieldIds":1474,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1470,"label":1471,"description":1472,"key":781,"publicationTags":1473,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":1476,"url":926,"indexYears":28,"academicFieldIds":1481,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":1477,"label":1478,"description":1479,"key":923,"publicationTags":1480,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":1483,"volume":1485},{"VOID":1484},"291-297",{"VOID":1486},"19","2006-09-01",2006,[943,925],{"id":1491,"createTime":1492,"updateTime":1493,"relativeEntities":1494,"slug":1495,"properties":1496,"entityType":961,"verifyStatus":26,"verifyTime":1503,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1504,"fullTextUrl":28,"authors":1505,"publicationType":996,"publisherRelationship":1615,"citationCount":28,"citationInfo":28,"publishDate":1664,"publishYear":1665,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1666,"openAccess":28,"references":28,"isForceReanalyzing":1049},"0061bc6f-ed7e-4b77-9bc1-5dcd3e4be0ff","2024-02-07T03:44:16.297+00:00","2025-01-15T09:45:17.023+00:00",[],"Topic-level-knowledge-sub-graphs-for-multi-turn-dialogue-generation",{"title":1497,"references":1499,"doi":1501},{"EN":1498},"Topic-level knowledge sub-graphs for multi-turn dialogue generation",{"VOID":1500},"Zhang, 2020, A memory network based end-to-end personalized task-oriented dialogue generation, Knowl. Based Syst., 207, 10.1016\u002Fj.knosys.2020.106398\nZhang, 2019, ReCoSa: Detecting the relevant contexts with self-attention for multi-turn dialogue generation, 3721\nSordoni, 2015, A hierarchical recurrent encoder-decoder for generative context-aware query suggestion, 553\nWang, 2020, Dual dynamic memory network for end-to-end multi-turn task-oriented dialog systems, 4100\nZhang, 2020, Modeling topical relevance for multi-turn dialogue generation, 3737\nXu, 2020, Enhancing dialog coherence with event graph grounded content planning, 3941\nGhazvininejad, 2018, A knowledge-grounded neural conversation model, 5110\nZhou, 2018, Commonsense knowledge aware conversation generation with graph attention, 4623\nZhang, 2020, Grounded conversation generation as guided traverses in commonsense knowledge graphs, 2031\nJi, 2020, Language generation with multi-hop reasoning on commonsense knowledge graph, 725\nSarkar, 2020, Suggest me a movie for tonight: Leveraging knowledge graphs for conversational recommendation, 4179\nPage, 1999\nLiu, 2020, Towards conversational recommendation over multi-type dialogs, 1036\nZhou, 2020, Kdconv: A Chinese multi-domain dialogue dataset towards multi-turn knowledge-driven conversation, 7098\nSerban, 2016, Building end-to-end dialogue systems using generative hierarchical neural network models, 3776\nTian, 2020, Response-anticipated memory for on-demand knowledge integration in response generation, 650\nLi, 2017, Adversarial learning for neural dialogue generation, 2157\nYan, 2013, A biterm topic model for short texts, 1445\nFeng, 2020, User group based emotion detection and topic discovery over short text, World Wide Web, 1553, 10.1007\u002Fs11280-019-00760-3\nWu, 2020, Neural mixed counting models for dispersed topic discovery, 6159\nCai, 2016, Context-aware ontologies generation with basic level concepts from collaborative tags, Neurocomputing, 25, 10.1016\u002Fj.neucom.2016.02.070\nYin, 2019, A deeper graph neural network for recommender systems, Knowl. Based Syst., 185, 10.1016\u002Fj.knosys.2019.105020\nHe, 2021, Multi-goal multi-agent learning for task-oriented dialogue with bidirectional teacher-student learning, Knowl. Based Syst., 213, 10.1016\u002Fj.knosys.2020.106667\nCai, 2008, A formal model of fuzzy ontology with property hierarchy and object membership, Vol. 5231, 69\nLi, 2021, Deep attributed network representation learning of complex coupling and interaction, Knowl. Based Syst., 212, 10.1016\u002Fj.knosys.2020.106618\nWang, 2019, Efficient subgraph matching on large RDF graphs using MapReduce, Data Sci. Eng., 4, 24, 10.1007\u002Fs41019-019-0090-z\nZhang, 2020, TransRHS: A representation learning method for knowledge graphs with relation hierarchical structure, 2987\nZhang, 2020, Multi-turn dialogue generation in E-commerce platform with the context of historical dialogue, 1981\nSong, 2020, Learning to customize model structures for few-shot dialogue generation tasks, 5832\nYu, 2020\nNakano, 2020, A framework for building closed-domain chat dialogue systems, Knowl. Based Syst., 204, 10.1016\u002Fj.knosys.2020.106212\nJiang, 2020, Knowledge augmented dialogue generation with divergent facts selection, Knowl. Based Syst., 210, 10.1016\u002Fj.knosys.2020.106479\nLin, 2020, Generating informative conversational response using recurrent knowledge-interaction and knowledge-copy, 41\nJung, 2020, Attnio: Knowledge graph exploration with in-and-out attention flow for knowledge-grounded dialogue, 3484\nXu, 2020, Knowledge graph grounded goal planning for open-domain conversation generation, 9338\nWu, 2019, Proactive human-machine conversation with explicit conversation goal, 3794\nTang, 2019, Target-guided open-domain conversation, 5624\nWu, 2020, Topicka: Generating commonsense knowledge-aware dialogue responses towards the recommended topic fact, 3766\nPan, 2020, Semantic graphs for generating deep questions, 1463\nCho, 2014, Learning phrase representations using RNN encoder-decoder for statistical machine translation, 1724\nTu, 2016, Modeling coverage for neural machine translation, 1724\nPapineni, 2002, Bleu: a method for automatic evaluation of machine translation, 311\nLi, 2016, A diversity-promoting objective function for neural conversation models, 110\nBahdanau, 2015, Neural machine translation by jointly learning to align and translate\nGrave, 2018, Learning word vectors for 157 languages\nSutskever, 2014, Sequence to sequence learning with neural networks, 3104\nLian, 2019, Learning to select knowledge for response generation in dialog systems, 5081\nDevlin, 2019, BERT: pre-training of deep bidirectional transformers for language understanding, 4171",{"VOID":1502},"10.1016\u002Fj.knosys.2021.107499","2025-01-15T09:45:17.022+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705121007619",[1506,1521,1552,1574,1587,1600],{"id":1507,"sortIndex":32,"researcher":28,"roles":1508,"affiliations":1509,"properties":1518,"displayName":1520,"givenName":28,"familyName":28},"c7922eee-ff55-42a7-a101-b878f7817ef9",[968],[1510],{"id":1511,"sortIndex":32,"affiliation":1512,"properties":28},"d42ace7b-9903-4982-9e65-577a725c2c90",{"id":1511,"createTime":28,"updateTime":28,"relativeEntities":1513,"slug":28,"properties":1514,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1517,"statistic":28},[],{"title":1515},{"VI":1516},"School of Electrical Engineering, Guangxi University, Nanning, Guangxi, China",[],{"title":1519},{"VI":1520},"Jing Li",{"id":1522,"sortIndex":40,"researcher":28,"roles":1523,"affiliations":1524,"properties":1549,"displayName":1551,"givenName":28,"familyName":28},"4340a7f5-b534-4103-b0e3-9f91bbdb0185",[968],[1525,1531,1540],{"id":1511,"sortIndex":32,"affiliation":1526,"properties":28},{"id":1511,"createTime":28,"updateTime":28,"relativeEntities":1527,"slug":28,"properties":1528,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1530,"statistic":28},[],{"title":1529},{"VI":1516},[],{"id":1532,"sortIndex":40,"affiliation":1533,"properties":1539},"717d84fb-b910-4155-ad2d-706bd834d3ad",{"id":1532,"createTime":28,"updateTime":28,"relativeEntities":1534,"slug":28,"properties":1535,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1538,"statistic":28},[],{"title":1536},{"VI":1537},"Key Laboratory of Big Data and Intelligent Robot (SCUT), MOE of China, Guangzhou, China",[],{},{"id":1541,"sortIndex":123,"affiliation":1542,"properties":1548},"0497d5c2-0e71-43c8-9956-5e2a3d6ed9f4",{"id":1541,"createTime":28,"updateTime":28,"relativeEntities":1543,"slug":28,"properties":1544,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1547,"statistic":28},[],{"title":1545},{"VI":1546},"Guangxi Key Laboratory of Intelligent Control and Maintenance of Power Equipment, Guangxi, China",[],{},{"title":1550},{"VI":1551},"Qingbao Huang",{"id":1553,"sortIndex":123,"researcher":28,"roles":1554,"affiliations":1555,"properties":1571,"displayName":1573,"givenName":28,"familyName":28},"451186db-68ac-4a04-bf2f-3101e607a84a",[968],[1556,1564],{"id":1557,"sortIndex":32,"affiliation":1558,"properties":28},"28442bf7-eb4b-49ac-8a11-8c52f11aad54",{"id":1557,"createTime":28,"updateTime":28,"relativeEntities":1559,"slug":28,"properties":1560,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1563,"statistic":28},[],{"title":1561},{"VI":1562},"School of Software Engineering, South China University of Technology, Guangzhou, China",[],{"id":1532,"sortIndex":40,"affiliation":1565,"properties":1570},{"id":1532,"createTime":28,"updateTime":28,"relativeEntities":1566,"slug":28,"properties":1567,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1569,"statistic":28},[],{"title":1568},{"VI":1537},[],{},{"title":1572},{"VI":1573},"Yi Cai",{"id":1575,"sortIndex":42,"researcher":28,"roles":1576,"affiliations":1577,"properties":1584,"displayName":1586,"givenName":28,"familyName":28},"0fa6a346-a350-45f3-ba21-692bb930ad87",[968],[1578],{"id":1511,"sortIndex":32,"affiliation":1579,"properties":28},{"id":1511,"createTime":28,"updateTime":28,"relativeEntities":1580,"slug":28,"properties":1581,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1583,"statistic":28},[],{"title":1582},{"VI":1516},[],{"title":1585},{"VI":1586},"Yongkang Liu",{"id":1588,"sortIndex":45,"researcher":28,"roles":1589,"affiliations":1590,"properties":1597,"displayName":1599,"givenName":28,"familyName":28},"8d8a7f2e-9282-400a-99d7-5cf41f5a2148",[968],[1591],{"id":1511,"sortIndex":32,"affiliation":1592,"properties":28},{"id":1511,"createTime":28,"updateTime":28,"relativeEntities":1593,"slug":28,"properties":1594,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1596,"statistic":28},[],{"title":1595},{"VI":1516},[],{"title":1598},{"VI":1599},"Mingyi Fu",{"id":1601,"sortIndex":46,"researcher":28,"roles":1602,"affiliations":1603,"properties":1612,"displayName":1614,"givenName":28,"familyName":28},"962e660e-0e19-4def-b1f9-780fd0a75c60",[968],[1604],{"id":1605,"sortIndex":32,"affiliation":1606,"properties":28},"689033ec-a9d4-423f-8935-3f8c61ac34a5",{"id":1605,"createTime":28,"updateTime":28,"relativeEntities":1607,"slug":28,"properties":1608,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1611,"statistic":28},[],{"title":1609},{"VI":1610},"Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China",[],{"title":1613},{"VI":1614},"Qing Li",{"url":1504,"publisher":1616,"properties":1659},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1617,"slug":872,"properties":1618,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1621,"manageAffiliations":1638,"indexDatabases":1644,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1619,"title":1620},{"VOID":875},{"EN":877},[1622,1626,1630,1634],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1623,"label":1624,"description":1625,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1627,"label":1628,"description":1629,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1631,"label":1632,"description":1633,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":1635,"label":1636,"description":1637,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[1639],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":1640,"slug":28,"properties":1641,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1643,"statistic":28},[],{"title":1642},{"EN":910},[],[1645,1652],{"id":930,"indexDatabase":1646,"url":936,"indexYears":937,"academicFieldIds":1651,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1647,"label":1648,"description":1649,"key":781,"publicationTags":1650,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":1653,"url":926,"indexYears":28,"academicFieldIds":1658,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":1654,"label":1655,"description":1656,"key":923,"publicationTags":1657,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":1660,"volume":1662},{"VOID":1661},"107499",{"VOID":1663},"234","2021-12-01",2021,[943,925],{"id":1668,"createTime":1669,"updateTime":1670,"relativeEntities":1671,"slug":1672,"properties":1673,"entityType":961,"verifyStatus":26,"verifyTime":1670,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1680,"fullTextUrl":28,"authors":1681,"publicationType":996,"publisherRelationship":1742,"citationCount":28,"citationInfo":28,"publishDate":1791,"publishYear":1792,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1793,"openAccess":28,"references":28,"isForceReanalyzing":1049},"0091d321-8eaa-4da7-8187-1c84a9628a58","2024-01-21T07:37:58.184+00:00","2024-09-01T08:46:30.287+00:00",[],"Learning-to-rank-with-document-ranks-and-scores",{"title":1674,"references":1676,"doi":1678},{"EN":1675},"Learning to rank with document ranks and scores",{"VOID":1677},"AngizL, 2010, Aggregating preference ranking with fuzzy data envelopment analysis, Knowledge-Based Systems, 23, 512, 10.1016\u002Fj.knosys.2010.03.008\nBaeza-Yates, 1999\nC.J.C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Halmilton, G. Hullender, Learning to rank using gradient descent, in: Proceedings of the International Conference on Machine Learning, 2005, pp. 89–96.\nY. Cao, J. Xu, T.Y. Liu, H. Li, Y. Huang, H.W. Hon, Adapting ranking SVM to document retrieval, in: Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, 2006, pp. 186–193.\nZ. Cao, T. Qin, T.Y. Liu, M.F. Tsai, H. Li, Learning to rank: from pairwise approach to listwise approach, in: Proceedings of the International Conference on Machine Learning, 2007, pp. 129–136.\nN. Craswell, D. Hawking, R. Wilkinson, M. Wu, Overview of the TREC 2003 web track, in: Proceedings of the Twelfth Text Retrieval Conference, 2003, pp. 78–92.\nElAlami, 2011, A novel image retrieval model based on the most relevant features, Knowledge-Based Systems, 24, 23, 10.1016\u002Fj.knosys.2010.06.001\nFreund, 1997, A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and System Sciences, 55, 119, 10.1006\u002Fjcss.1997.1504\nFreund, 2003, An efficient boosting algorithm for combining preferences, Journal of Machine Learning Research, 4, 933\nR. Herbrich, T. Graepel, K. Obermayer, Support vector learning for ordinal regression, in: Proceedings of International Conference on Artificial Neural Networks, 1999, pp. 97–102.\nW.R. Hersh, C. Buckley, T.J. Leone, D.H. Hickam, OHSUMED: an interactive retrieval evaluation and new large test collection for research, in: Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, 1994, pp. 192–201.\nJarvelin, 2002, ACM Transactions on Information Systems, 20, 422, 10.1145\u002F582415.582418\nT. Joachims. Optimizing search engines using click through data, in: Proceedings of the ACM Conference on Knowledge Discovery and Data Mining, 2002, pp. 133–142.\nP. Li, C.J.C. Burges, Q. Wu, McRank: learning to rank using multiple classification and gradient boosting, in: Proceedings of Advances in Neural Information Processing System, 2007, pp. 845–852.\nT.Y. Liu, J. Xu, T. Qin, W. Xiong, H. Li, LETOR: benchmark dataset for research on learning to rank for information retrieval, in: Proceedings of the Learning to Rank Workshop in conjunction with the 30th ACM SIGIR Conference on Research and Development in Information Retrieval, 2007.\nR. Nallapati, Discriminative models for information retrieval, in: Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, 2004, pp. 64–71.\nOkabe, 2005, Learning filtering rulesets for ranking refinement in relevance feedback, Knowledge-Based Systems, 18, 117, 10.1016\u002Fj.knosys.2004.04.011\nT. Qin, X.D. Zhang, D.S. Wang, W.Y. Xiong, H. Li, Ranking with multiple hyperplanes, in: Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, 2007, pp. 279–286.\nSubramanyam Rallabandi, 2008, Knowledge-based image retrieval system, Knowledge-Based Systems, 21, 89, 10.1016\u002Fj.knosys.2007.02.002\nM. Taylor, J. Guiver, S. Robertson, T. Minka, SoftRank: optimising non-smooth rank metrics, in: Proceedings of the International Conference on Web Search and Data Mining, 2008, pp. 77–86.\nV. Vapnik, S. Golowich, A.J. Smola, Support vector method for function approximation, regression estimation, and signal processing, in: Proceedings of Advances in Neural Information Processing Systems, 1997, pp. 281–287.\nF. Xia, T. Liu, J. Wang, W. Zhang, H. Li, Listwise approach to learning to rank: theory and algorithm, in: Proceedings of the International Conference on Machine Learning, 2008, pp. 1192–1199.\nJ. Xu, H. Li, AdaRank: a boosting algorithm for information retrieval, in: Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, 2007, pp. 391–398.\nY. Yang, X. Liu, A re-examination of text categorization methods, in: Proceedings of ACM SIGIR Conference on Research and Development in Information Retrieval, 1999, pp. 42–49.\nY. Yue, T. Finley, F. Radlinski, T. Joachims, A support vector method for optimizing average precision, in: Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval, 2007, pp. 271–278.",{"VOID":1679},"10.1016\u002Fj.knosys.2010.12.005","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705110001772",[1682,1697,1712,1727],{"id":1683,"sortIndex":32,"researcher":28,"roles":1684,"affiliations":1685,"properties":1694,"displayName":1696,"givenName":28,"familyName":28},"d12a203a-50f4-42c5-99a8-9fefb63fc636",[968],[1686],{"id":1687,"sortIndex":32,"affiliation":1688,"properties":28},"aa2c2650-29f9-4904-90bf-8811733164b2",{"id":1687,"createTime":28,"updateTime":28,"relativeEntities":1689,"slug":28,"properties":1690,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1693,"statistic":28},[],{"title":1691},{"VI":1692},"School of Software, Sun Yat-Sen University, Guangzhou 510006, China",[],{"title":1695},{"VI":1696},"Yan Pan",{"id":1698,"sortIndex":40,"researcher":28,"roles":1699,"affiliations":1700,"properties":1709,"displayName":1711,"givenName":28,"familyName":28},"cde1588c-4c64-4a10-80b8-81c53902be1c",[968],[1701],{"id":1702,"sortIndex":32,"affiliation":1703,"properties":28},"e31ebddd-ffb6-4d4c-85f0-bfab801fb589",{"id":1702,"createTime":28,"updateTime":28,"relativeEntities":1704,"slug":28,"properties":1705,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1708,"statistic":28},[],{"title":1706},{"VI":1707},"Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China",[],{"title":1710},{"VI":1711},"Hai-Xia Luo",{"id":1713,"sortIndex":123,"researcher":28,"roles":1714,"affiliations":1715,"properties":1724,"displayName":1726,"givenName":28,"familyName":28},"508cc487-755f-437e-8c17-a44b281c26f6",[968],[1716],{"id":1717,"sortIndex":32,"affiliation":1718,"properties":28},"f5840293-8682-49de-bf50-df384e6c1552",{"id":1717,"createTime":28,"updateTime":28,"relativeEntities":1719,"slug":28,"properties":1720,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1723,"statistic":28},[],{"title":1721},{"VI":1722},"Department of Computer Science, South China Normal University, Guangzhou 510631, China",[],{"title":1725},{"VI":1726},"Yong Tang",{"id":1728,"sortIndex":42,"researcher":28,"roles":1729,"affiliations":1730,"properties":1739,"displayName":1741,"givenName":28,"familyName":28},"b434adc3-770d-4556-b59a-e17410c34dd8",[968],[1731],{"id":1732,"sortIndex":32,"affiliation":1733,"properties":28},"47c91eac-26f1-4708-9aa9-3ef623ad37ff",{"id":1732,"createTime":28,"updateTime":28,"relativeEntities":1734,"slug":28,"properties":1735,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1738,"statistic":28},[],{"title":1736},{"VI":1737},"Engineering Research Center of Computer Network and Information Systems, South China Normal University, Guangzhou 510631, China",[],{"title":1740},{"VI":1741},"Chang-Qin Huang",{"url":1680,"publisher":1743,"properties":1786},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1744,"slug":872,"properties":1745,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1748,"manageAffiliations":1765,"indexDatabases":1771,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1746,"title":1747},{"VOID":875},{"EN":877},[1749,1753,1757,1761],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1750,"label":1751,"description":1752,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1754,"label":1755,"description":1756,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1758,"label":1759,"description":1760,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":1762,"label":1763,"description":1764,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[1766],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":1767,"slug":28,"properties":1768,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1770,"statistic":28},[],{"title":1769},{"EN":910},[],[1772,1779],{"id":930,"indexDatabase":1773,"url":936,"indexYears":937,"academicFieldIds":1778,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1774,"label":1775,"description":1776,"key":781,"publicationTags":1777,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":1780,"url":926,"indexYears":28,"academicFieldIds":1785,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":1781,"label":1782,"description":1783,"key":923,"publicationTags":1784,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":1787,"volume":1789},{"VOID":1788},"478-483",{"VOID":1790},"24","2011-05-01",2011,[943,925],{"id":1795,"createTime":1796,"updateTime":1797,"relativeEntities":1798,"slug":1799,"properties":1800,"entityType":961,"verifyStatus":26,"verifyTime":1797,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1807,"fullTextUrl":28,"authors":1808,"publicationType":996,"publisherRelationship":1852,"citationCount":28,"citationInfo":28,"publishDate":1901,"publishYear":1902,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":1903,"openAccess":28,"references":28,"isForceReanalyzing":1049},"00b21bd9-0228-403b-8bce-4e44dcf94359","2023-12-27T12:40:55.287+00:00","2024-12-19T22:54:00.677+00:00",[],"Self-adaptive-feature-learning-based-on-a-priori-knowledge-for-facial-expression-recognition",{"title":1801,"references":1803,"doi":1805},{"EN":1802},"Self-adaptive feature learning based on a priori knowledge for facial expression recognition",{"VOID":1804},"Mo, 2019, Robust jointly sparse regression with generalized orthogonal learning for image feature selection, Pattern Recognit., 93, 164, 10.1016\u002Fj.patcog.2019.04.011\nHassan, 2019, Human emotion recognition using deep belief network architecture, Inf. Fusion, 51, 10, 10.1016\u002Fj.inffus.2018.10.009\nSun, 2019, Dictionary learning feature space via sparse representation classification for facial expression recognition, Artif. Intell. Rev., 51, 1, 10.1007\u002Fs10462-017-9554-6\nDu, 2019, Weighted patch-based manifold regularization dictionary pair learning model for facial expression using iterative optimization classification strategy, Comput. Vis. Image Understand., 186, 13, 10.1016\u002Fj.cviu.2019.06.003\nDu, 2020, Low-rank graph preserving discriminative dictionary learning for image recognition, Knowl.-Based Syst., 187, 10.1016\u002Fj.knosys.2019.06.031\nYang, 2012, An effective feature selection method via mutual information estimation, IEEE Trans. Syst. Man Cybern. B, 42, 1550, 10.1109\u002FTSMCB.2012.2195000\nLu, 2016, Low-rank preserving projections, IEEE Trans. Cybern., 46, 1900, 10.1109\u002FTCYB.2015.2457611\nWang, 2015, Micro-expression recognition using robust principle component analysis and local spatiotemporal directional features, Lecture Notes in Comput. Sci., 8925, 325, 10.1007\u002F978-3-319-16178-5_23\nZhang, 2018, Discriminative blockdiagonal representation learning for image recognition, IEEE Trans. Neural Netw. Learn. Syst., 29, 3111, 10.1109\u002FTNNLS.2017.2712801\nChan, 2015, PCANet: A simple deep learning baseline for image classification, IEEE Trans. Image Process., 24, 5017, 10.1109\u002FTIP.2015.2475625\nSun, 2018, Combining the Kernel collaboration representation and deep subspace learning for facial expression recognition, J. Circuits Syst. Comput., 27, 10.1142\u002FS0218126618501219\nSun, 2018, An extended dictionary representation approach with deep subspace learning for facial expression recognition, Neurocomputing, 316, 1, 10.1016\u002Fj.neucom.2018.07.045\nLi, 2005, 2D-LDA: A statistical linear discriminant analysis for image, Pattern Recognit. Lett., 26, 527, 10.1016\u002Fj.patrec.2004.09.007\nShikkenawis, 2016, On some variants of locality preserving projection, Neurocomputing, 173, 196, 10.1016\u002Fj.neucom.2015.01.100\nLee, 2014, Intra-class variation reduction using training expression images for sparse representation based facial expression recognition, IEEE Trans. Affect. Comput., 5, 340, 10.1109\u002FTAFFC.2014.2346515\nZarbakhsh, 2018, Low-rank sparse coding and region of interest pooling for dynamic 3D facial expression recognition, Signal Image Video Process., 12, 1611, 10.1007\u002Fs11760-018-1318-5\nXie, 2019, Deep multi-path convolutional neural network joint with salient region attention for facial expression recognition, Pattern Recognit., 92, 177, 10.1016\u002Fj.patcog.2019.03.019\nShao, 2019, Three convolutional neural network models for facial expression recognition in the wild, Neurocompting, 355, 82, 10.1016\u002Fj.neucom.2019.05.005\nYe, 2019, Facial expression recognition via region-based convolutional fusion network, J. Vis. Commun. Image Represent., 62, 1, 10.1016\u002Fj.jvcir.2019.04.009\nWu, 2018, Adaptive feature mapping for customizing deep learning based facial expression recognition model, IEEE Access., 6, 12451, 10.1109\u002FACCESS.2018.2805861\nJiang, 2013, Label consistent k-svd: learning a discriminative dictionary for recognition, IEEE Trans. Pattern Anal. Mach. Intell., 35, 2651, 10.1109\u002FTPAMI.2013.88\nLi, 2015, Learning a discriminative dictionary for facial expression recognition\nLi, 2017, A locality-constrained and label embedding dictionary learning algorithm for image classification, IEEE Trans. Neural Netw. Learn. Syst., 28, 278, 10.1109\u002FTNNLS.2015.2508025\nYang, 2014, Sparse representation based fisher discrimination dictionary learning for image classification, Int. J. Comput. Vis., 109, 209, 10.1007\u002Fs11263-014-0722-8\nCai, 2014, Support vector guided dictionary learning\nS. Gu, L. Zhang, W. Zuo, X. Feng, Projective dictionary pair learning for pattern classification, in: Proceedings of the 28th Annual Conference on Neural Information Processing Systems (NIPS), 2014, Montreal, QC, Canada, pp. 793-801.\nMairal, 2012, Task-driven dictionary learning, IEEE Trans. Pattern Anal. Mach. Intell., 34, 791, 10.1109\u002FTPAMI.2011.156\nTang, 2015, Learning low-rank class-specific dictionary and sparse intra-class variant dictionary for face recognition, PloS One, 10, 10.1371\u002Fjournal.pone.0142403\nRamirez, 2010, Classification and clustering via dictionary learning with structured incoherence and shared features\nWang, 2013, A max-margin perspective on sparse representation-based classification\nSun, 2017, Robust facial expression recognition with low-rank sparse error dictionary based probabilistic collaborative representation classification, Int. J. Artif. Intell. Tools, 26, 10.1142\u002FS0218213017500178\nLi, 2014, Learning low-rank and discriminative dictionary for image classification, Image Vis. Comput., 32, 814, 10.1016\u002Fj.imavis.2014.02.007\nWei, 2014, Robust face recognition with structurally incoherent low-rand matrix decomposition, IEEE Trans. Image Process., 23, 3294, 10.1109\u002FTIP.2014.2329451\nZhang, 2011, Sparse representation or collaborative representation: Which helps face recognition?\nYan, 2019, Multiple kernel dimensionality reduction based on collaborative representation for set oriented image classification, Expert Syst. Appl., 137, 380, 10.1016\u002Fj.eswa.2019.06.062\nSu, 2018, Multifeature dictionary learning for collaborative representation classification of hyperspectral imagery, IEEE Trans. Geosci. Remote Sens., 1\nTurk, 1991, Eigenfaces for recognition, J. Cogn. Neurosci., 3, 71, 10.1162\u002Fjocn.1991.3.1.71\nLyons, 1998, Coding facial expressions with Gabor wavelets, 200\nLucey, 2010, The extended Cohn-Kanade dataset (CK+) A complete dataset for action unit and emotion-specified expression, 94\nGoeleven, 2008, The karolinska directed emotional faces: A validation study, Cognit. Emot., 22, 1094, 10.1080\u002F02699930701626582\nTian, 2004, Evaluation of face resolution for expression analysis\nOuyang, 2013, Robust automatic facial expression detection method based on sparse representation plus LBP map, Optics, 124, 6827\nWright, 2009, Robust face recognition via sparse representation, IEEE Trans. Pattern Anal. Mach. Intell., 31, 210, 10.1109\u002FTPAMI.2008.79",{"VOID":1806},"10.1016\u002Fj.knosys.2020.106124","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705120303841",[1809,1824,1839],{"id":1810,"sortIndex":32,"researcher":28,"roles":1811,"affiliations":1812,"properties":1821,"displayName":1823,"givenName":28,"familyName":28},"2e2cfbeb-3627-4c4c-97eb-ad6df44b2776",[968],[1813],{"id":1814,"sortIndex":32,"affiliation":1815,"properties":28},"16a94683-72f2-471b-bbb8-e7776f061598",{"id":1814,"createTime":28,"updateTime":28,"relativeEntities":1816,"slug":28,"properties":1817,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1820,"statistic":28},[],{"title":1818},{"VI":1819},"School of Information Science and Engineering, Yanshan University, Hebei Street, Qinhuangdao, 066000, Hebei, China",[],{"title":1822},{"VI":1823},"Zhe Sun",{"id":1825,"sortIndex":40,"researcher":28,"roles":1826,"affiliations":1827,"properties":1836,"displayName":1838,"givenName":28,"familyName":28},"27582810-100f-4320-9ad4-521d78229ae1",[968],[1828],{"id":1829,"sortIndex":32,"affiliation":1830,"properties":28},"20a56891-f0c5-4d50-ab3f-5c0f4f114092",{"id":1829,"createTime":28,"updateTime":28,"relativeEntities":1831,"slug":28,"properties":1832,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1835,"statistic":28},[],{"title":1833},{"VI":1834},"School of Electrical Engineering and Computing, The University of Newcastle, University Drive, Callaghan, NSW, 2308, Australia",[],{"title":1837},{"VI":1838},"Raymond Chiong",{"id":1840,"sortIndex":123,"researcher":28,"roles":1841,"affiliations":1842,"properties":1849,"displayName":1851,"givenName":28,"familyName":28},"c0e315d9-5735-45e1-b373-cc85932e2540",[968],[1843],{"id":1814,"sortIndex":32,"affiliation":1844,"properties":28},{"id":1814,"createTime":28,"updateTime":28,"relativeEntities":1845,"slug":28,"properties":1846,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1848,"statistic":28},[],{"title":1847},{"VI":1819},[],{"title":1850},{"VI":1851},"Zheng-ping Hu",{"url":1807,"publisher":1853,"properties":1896},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1854,"slug":872,"properties":1855,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1858,"manageAffiliations":1875,"indexDatabases":1881,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1856,"title":1857},{"VOID":875},{"EN":877},[1859,1863,1867,1871],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1860,"label":1861,"description":1862,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":1864,"label":1865,"description":1866,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":1868,"label":1869,"description":1870,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":1872,"label":1873,"description":1874,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[1876],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":1877,"slug":28,"properties":1878,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1880,"statistic":28},[],{"title":1879},{"EN":910},[],[1882,1889],{"id":930,"indexDatabase":1883,"url":936,"indexYears":937,"academicFieldIds":1888,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":1884,"label":1885,"description":1886,"key":781,"publicationTags":1887,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":1890,"url":926,"indexYears":28,"academicFieldIds":1895,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":1891,"label":1892,"description":1893,"key":923,"publicationTags":1894,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":1897,"volume":1899},{"VOID":1898},"106124",{"VOID":1900},"204","2020-09-01",2020,[943,925],{"id":1905,"createTime":1906,"updateTime":1907,"relativeEntities":1908,"slug":1909,"properties":1910,"entityType":961,"verifyStatus":26,"verifyTime":1907,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":1917,"fullTextUrl":28,"authors":1918,"publicationType":996,"publisherRelationship":1990,"citationCount":28,"citationInfo":28,"publishDate":1282,"publishYear":1130,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2038,"openAccess":28,"references":28,"isForceReanalyzing":1049},"00b82aa0-64cc-4ef6-9a88-6055d8d04ce8","2024-01-13T16:48:24.464+00:00","2025-01-13T07:50:25.596+00:00",[],"Incremental-concept-cognitive-learning-approach-for-concept-classification-oriented-to-weighted-fuzzy-concepts",{"title":1911,"references":1913,"doi":1915},{"EN":1912},"Incremental concept-cognitive learning approach for concept classification oriented to weighted fuzzy concepts",{"VOID":1914},"Wang, 2009, On cognitive computing, Int. J. Softw. Sci. Comput. Intell., 1, 1, 10.4018\u002Fjssci.2009070101\nFeldman, 2003, The simplicity principle in human concept learning, Curr. Direct. Psychol. Sci., 12, 227, 10.1046\u002Fj.0963-7214.2003.01267.x\nFan, 2019, Attribute-oriented cognitive concept learning strategy: A multi-level method, Int. J. Mach. Learn. Cybern., 10, 2421, 10.1007\u002Fs13042-018-0879-5\nTsang, 2020, Multi-level cognitive concept learning method oriented to data sets with fuzziness: A perspective from features, Soft Comput., 24, 3753, 10.1007\u002Fs00500-019-04144-7\nZhang, 2020, Incremental concept-cognitive learning based on attribute topology, Internat. J. Approx. Reason., 118, 173, 10.1016\u002Fj.ijar.2019.12.010\nShi, 2018, Concept-cognitive learning model for incremental concept learning, IEEE Trans. Syst. Man Cybern.: Syst., 51, 809, 10.1109\u002FTSMC.2018.2882090\nShi, 2019, Concurrent concept-cognitive learning model for classification, Inform. Sci., 496, 65, 10.1016\u002Fj.ins.2019.05.009\nKuznetsov, 2004, Machine learning and formal concept analysis, 287\nMi, 2020, Fuzzy-based concept learning method: Exploiting data with fuzzy conceptual clustering, IEEE Trans. Cybern.\nWang, 2008, On concept algebra: A denotational mathematical structure for knowledge and software modeling, Int. J. Cogn. Inform. Nat. Intell., 2, 1, 10.4018\u002Fjcini.2008040101\nXu, 2014, A novel cognitive system model and approach to transformation of information granules, Internat. J. Approx. Reason., 55, 853, 10.1016\u002Fj.ijar.2013.10.002\nGuo, 2022, A novel outcome evaluation model of three-way decision: A change viewpoint, Inform. Sci., 607, 1089, 10.1016\u002Fj.ins.2022.06.022\nYuan, 2022, An incremental learning mechanism for object classification based on progressive fuzzy three-way concept, Inform. Sci., 584, 127, 10.1016\u002Fj.ins.2021.10.058\nLuo, 2018, Incremental rough set approach for hierarchical multicriteria classification, Inform. Sci., 429, 72, 10.1016\u002Fj.ins.2017.11.004\nWille, 1982, Restructuring lattice theory: An approach based on hierarchies of concepts, 445\nGanter, 1999\nYahia, 2000, Discovery of compact rules in relational databases, Inform. Sci., 4, 497\nQi, 2014, Three-way formal concept analysis, 732\nChen, 2020, Formal concept analysis of multi-scale formal context, J. Ambient Intell. Humaniz. Comput., 11, 5315, 10.1007\u002Fs12652-020-01867-6\nLi, 2013, An entropy-based weighted concept lattice for merging multi-source geo-ontologies, Entropy, 15, 2303, 10.3390\u002Fe15062303\nZhang, 2012, A completeness analysis of frequent weighted concept lattices and their algebraic properties, Data Knowl. Eng., 81, 104, 10.1016\u002Fj.datak.2012.08.002\nPeng, 2017, Social influence modeling using information theory in mobile social networks, Inform. Sci., 379, 146, 10.1016\u002Fj.ins.2016.08.023\nShannon, 1948, A mathematical theory of communication, Bell Syst. Tech. J., 27, 379, 10.1002\u002Fj.1538-7305.1948.tb01338.x\nKosko, 1986, Fuzzy entropy and conditioning, Inform. Sci., 40, 165, 10.1016\u002F0020-0255(86)90006-X\nLee, 2001, An efficient fuzzy classifier with feature selection based on fuzzy entropy, IEEE Trans. Syst. Man Cybern. B, 31, 426, 10.1109\u002F3477.931536\nLuca, 1972, A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory, Inf. Control, 20, 301, 10.1016\u002FS0019-9958(72)90199-4\nAl-Sharhan, 2001, Fuzzy entropy: A brief survey, 1135\nSingh, 2017, Concepts reduction in formal concept analysis with fuzzy setting using Shannon entropy, Int. J. Mach. Learn. Cybern., 8, 179, 10.1007\u002Fs13042-014-0313-6\nKumar, 2015, Formal concept analysis approach to cognitive functionalities of bidirectional associative memory, Biol. Inspired Cogn. Archit., 12, 20\nLi, 2015, Concept learning via granular computing: A cognitive viewpoint, Inform. Sci., 298, 447, 10.1016\u002Fj.ins.2014.12.010\nLi, 2019, Incremental cognition of concepts: Theories and methods, Chinese J. Comput., 42, 1\nYan, 2021, Incremental concept cognitive learning based on three-way partial order structure, Knowl.-Based Syst., 220, 10.1016\u002Fj.knosys.2021.106898\nZhao, 2017, Cognitive concept learning from incomplete information, Int. J. Mach. Learn. Cybern., 8, 159, 10.1007\u002Fs13042-016-0553-8\nLosing, 2018, Incremental on-line learning: A review and comparison of state of the art algorithms, Neurocomputing, 275, 1261, 10.1016\u002Fj.neucom.2017.06.084\nWitten, 2005, Data mining: Practical machine learning tools and techniques, Morgan Kaufmann, 2\nCover, 1967, Nearest neighbor pattern classification, IEEE Trans. Inform. Theory, 13, 21, 10.1109\u002FTIT.1967.1053964\nCutler, 2007, Random forests for classification in ecology, Ecology, 88, 2783, 10.1890\u002F07-0539.1\nAsuncion, 2007\nFriedman, 1940, A comparison of alternative tests of significance for the problem of M rankings, Ann. Math. Stat., 11, 86, 10.1214\u002Faoms\u002F1177731944\nDunn, 1961, Multiple comparisons among means, J. Amer. Statist. Assoc., 56, 52, 10.1080\u002F01621459.1961.10482090",{"VOID":1916},"10.1016\u002Fj.knosys.2022.110093","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705122011893",[1919,1934,1947,1962,1977],{"id":1920,"sortIndex":32,"researcher":28,"roles":1921,"affiliations":1922,"properties":1931,"displayName":1933,"givenName":28,"familyName":28},"d65b81a0-e4bf-460b-8365-f9eef3987ae6",[968],[1923],{"id":1924,"sortIndex":32,"affiliation":1925,"properties":28},"f2757483-204a-4c9d-8936-c32a8f140848",{"id":1924,"createTime":28,"updateTime":28,"relativeEntities":1926,"slug":28,"properties":1927,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1930,"statistic":28},[],{"title":1928},{"VI":1929},"School of Computer Science and Engineering, Macau University of Science and Technology, Taipa, Macao Special Administrative Region of China",[],{"title":1932},{"VI":1933},"Chengling Zhang",{"id":1935,"sortIndex":40,"researcher":28,"roles":1936,"affiliations":1937,"properties":1944,"displayName":1946,"givenName":28,"familyName":28},"6e20deea-9def-44b4-ae71-4f42501ba9af",[968],[1938],{"id":1924,"sortIndex":32,"affiliation":1939,"properties":28},{"id":1924,"createTime":28,"updateTime":28,"relativeEntities":1940,"slug":28,"properties":1941,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1943,"statistic":28},[],{"title":1942},{"VI":1929},[],{"title":1945},{"VI":1946},"Eric C.C. Tsang",{"id":1948,"sortIndex":123,"researcher":28,"roles":1949,"affiliations":1950,"properties":1959,"displayName":1961,"givenName":28,"familyName":28},"8459c66d-aeb4-4b4e-9788-7aa4f640ec2e",[968],[1951],{"id":1952,"sortIndex":32,"affiliation":1953,"properties":28},"b2cbf2f4-c179-48a6-9cc1-a76cfc56ed10",{"id":1952,"createTime":28,"updateTime":28,"relativeEntities":1954,"slug":28,"properties":1955,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1958,"statistic":28},[],{"title":1956},{"VI":1957},"College of Artificial Intelligence, Southwest University, Chongqing, 400715, China",[],{"title":1960},{"VI":1961},"Weihua Xu",{"id":1963,"sortIndex":42,"researcher":28,"roles":1964,"affiliations":1965,"properties":1974,"displayName":1976,"givenName":28,"familyName":28},"3f90baec-5713-4980-bdea-beb103450799",[968],[1966],{"id":1967,"sortIndex":32,"affiliation":1968,"properties":28},"8e1c0443-aebc-4d0c-a2a3-fea2b8987481",{"id":1967,"createTime":28,"updateTime":28,"relativeEntities":1969,"slug":28,"properties":1970,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1973,"statistic":28},[],{"title":1971},{"VI":1972},"School of Mathematics and Statistics, Minnan Normal University, Zhangzhou 363000, China",[],{"title":1975},{"VI":1976},"Yidong Lin",{"id":1978,"sortIndex":45,"researcher":28,"roles":1979,"affiliations":1980,"properties":1987,"displayName":1989,"givenName":28,"familyName":28},"81a5ab60-9e22-401c-b25e-4cadf1f781f5",[968],[1981],{"id":1924,"sortIndex":32,"affiliation":1982,"properties":28},{"id":1924,"createTime":28,"updateTime":28,"relativeEntities":1983,"slug":28,"properties":1984,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":1986,"statistic":28},[],{"title":1985},{"VI":1929},[],{"title":1988},{"VI":1989},"Lanzhen Yang",{"url":1917,"publisher":1991,"properties":2034},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":1992,"slug":872,"properties":1993,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":1996,"manageAffiliations":2013,"indexDatabases":2019,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":1994,"title":1995},{"VOID":875},{"EN":877},[1997,2001,2005,2009],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":1998,"label":1999,"description":2000,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":2002,"label":2003,"description":2004,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":2006,"label":2007,"description":2008,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":2010,"label":2011,"description":2012,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[2014],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":2015,"slug":28,"properties":2016,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2018,"statistic":28},[],{"title":2017},{"EN":910},[],[2020,2027],{"id":930,"indexDatabase":2021,"url":936,"indexYears":937,"academicFieldIds":2026,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2022,"label":2023,"description":2024,"key":781,"publicationTags":2025,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":2028,"url":926,"indexYears":28,"academicFieldIds":2033,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":2029,"label":2030,"description":2031,"key":923,"publicationTags":2032,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":2035,"volume":2037},{"VOID":2036},"110093",{"VOID":1281},[943,925],{"id":2040,"createTime":2041,"updateTime":2042,"relativeEntities":2043,"slug":2044,"properties":2045,"entityType":961,"verifyStatus":26,"verifyTime":2042,"verifyNote":962,"languages":28,"translateLanguages":28,"viewCount":32,"primaryUrl":2052,"fullTextUrl":28,"authors":2053,"publicationType":996,"publisherRelationship":2110,"citationCount":28,"citationInfo":28,"publishDate":1392,"publishYear":1393,"citationAnalyzeStatus":878,"lastCitationAnalyze":28,"indexDatabases":2159,"openAccess":28,"references":28,"isForceReanalyzing":1049},"00bed218-b544-4d72-9239-22167f9dc1f0","2023-12-12T16:24:27.953+00:00","2024-12-30T09:21:11.497+00:00",[],"Distributed-group-cooperation-with-multi-mechanism-fusion-in-an-adversarial-environment",{"title":2046,"references":2048,"doi":2050},{"EN":2047},"Distributed group cooperation with multi-mechanism fusion in an adversarial environment",{"VOID":2049},"Lim, 2017, Multi-objective hybrid algorithms for layout optimization in multi-robot cellular manufacturing systems, Knowl.- Based Syst., 120, 87, 10.1016\u002Fj.knosys.2016.12.026\nSchranz, 2020, Swarm robotic behaviors and current applications, Front. Robot. AI, 7, 1, 10.3389\u002Ffrobt.2020.00036\nFang, 2020, Cooperative pursuit with multi-pursuer and one faster free-moving evader, IEEE Trans. Cybern.\nPerelman, 2011, Cooperative differential games strategies for active aircraft protection from a homing missile, J. Guid. Control Dyn., 34, 761, 10.2514\u002F1.51611\nS. Bharadwaj, R. Dimitrova, U. Topcu, Synthesis of surveillance strategies via belief abstraction, in: Proc. of the 57th IEEE CDC, Miami Beach, FL, 2018, pp. 4159–4166.\nVundurthy, 2020, Protecting an autonomous delivery agent against a vision-guided adversary: Algorithms and experimental results, IEEE Trans. Ind. Inf., 16, 5667, 10.1109\u002FTII.2019.2958818\nLin, 2015, Nash strategies for pursuit-evasion differential games involving limited observations, IEEE Trans. Aerosp. Electron. Syst., 51, 1347, 10.1109\u002FTAES.2014.130569\nVon Moll, 2019, The multi-pursuer single-evader game, J. Intell. Robot. Syst., 96, 193, 10.1007\u002Fs10846-018-0963-9\nI.E. Weintraub, M. Pachter, E. Garcia, An introduction to pursuit-evasion differential games, in: Proc. of ACC, Denver, CO, 2020, pp. 1049–1066.\nD.M. Salmon, A pursuit-evasion game with multiple pursuers, in: Proc. of the 7th Annual Allerton Conf. on Circuit and System Theory, Monticello, IL, USA, 1969, pp. 595–604.\nKaaz, 1975, The relevance of multi-valued functions in the theory of pursuit games, Kybernetes, 4, 97, 10.1108\u002Feb005384\nGutman, 1987, Simple linear pursuit-evasion games, Comput. Math. Appl., 13, 83, 10.1016\u002F0898-1221(87)90095-2\nSelvakumar, 2021, Feedback strategies for a reach-avoid game with a single evader and multiple pursuers, IEEE Trans. Cybern., 51, 696, 10.1109\u002FTCYB.2019.2914869\nLee, 2021, A hopf-lax formula in hamilton–Jacobi analysis of reach-avoid problems, IEEE Control Syst. Lett., 5, 1055, 10.1109\u002FLCSYS.2020.3009933\nWeintraub, 2017, An optimal aircraft defense strategy for the active target defense scenario, 1\nE. Garcia, D.W. Casbeer, M. Pachter, Optimal target capture strategies in the target-attacker-defender differential game, in: Proc. of ACC, Milwaukee, WI, 2018, pp. 68–73.\nLiang, 2019, A differential game for cooperative target defense, Automatica, 102, 58, 10.1016\u002Fj.automatica.2018.12.034\nR. Yan, Z. Shi, Y. Zhong, Construction of the barrier for reach avoid differential games in three-dimensional space with four equal-speed players, in: Proc. of the 58th IEEE CDC, Nice, France, 2019, pp. 4067–4072.\nChen, 2016, Multi-player pursuit evasion games with one superior evader, Automatica, 71, 24, 10.1016\u002Fj.automatica.2016.04.012\nPachter, 2020, Cooperative pursuit by multiple pursuers of a single evader, J. Aerosp. Inf. Syst., 17, 371\nCasini, 2019, A discrete-time pursuit-evasion game in convex polygonal environments, Systems Control Lett., 125, 22, 10.1016\u002Fj.sysconle.2018.12.008\nVon Moll, 2017, Multiple-pursuer single-evader border defense differential game, J. Aerosp. Inf. Syst., 17, 407\nI.A. Alias, Y. Salleh, A. Azamov, Evasion differential game of two evaders and one pursuer with integral constraints, in: Proc. of ICMSS, Kuala Lumpur, Malaysia, 2013, pp. 140–145.\nHusodo, 2020, Enhanced social spider optimization algorithm for increasing performance of multiple pursuer drones in neutralizing attacks from multiple evader drones, IEEE Access, 8, 22145, 10.1109\u002FACCESS.2020.2969021\nGetz, 1981, Two-target pursuit-evasion differential games in the plane, J. Opt. Theory Appl., 34, 383, 10.1007\u002FBF00934679\nZha, 2017, Construction of barrier in a fishing game with point capture, IEEE Trans. Cybern., 47, 1409, 10.1109\u002FTCYB.2016.2546381\nMargellos, 2011, Hamilton–Jacobi formulation for reach-avoid differential games, IEEE Trans. Automat. Control, 56, 1849, 10.1109\u002FTAC.2011.2105730\nBera, 2017, A comprehensive differential game theoretic solution to a game of two cars, J. Opt. Theory Appl., 174, 818, 10.1007\u002Fs10957-017-1134-z\nZ.E. Fuchs, P.P. Khargonekar, J. Evers, Cooperative defense within a single-pursuer, two-evader pursuit evasion differential game, in: Proc. of the 49th IEEE CDC, Atlanta, GA, 2010, pp. 3091–3097.\nRamana, 2016, A cooperative pursuit strategy for a high speed evader, 1\nZhou, 2016, Cooperative pursuit with voronoi partitions, Automatica, 72, 64, 10.1016\u002Fj.automatica.2016.05.007\nAltaher, 2020, Intercepting a superior missile: Trajectory optimization approach to a pursuit-evasion game, Int. Game Theory Rev., 22, 1, 10.1142\u002FS0219198920500048\nZ. Li, X.J. Yu, Solution of pursuit\u002Fevasion differential games using genetic algorithms, in: Proc. of the 7th WCICA, Chongqing, China, 2008, pp. 3077–3080.\nS.Y. Jin, D. Dechev, Z.H. Qu, Parallel particle swarm optimization (PPSO) on the coverage problem in pursuit-evasion games, in: Proc. of HPC, Orlando, FL, 2012, pp. 1–8.\nJ.G. Zhu, W. Zou, Z. Zhu, Learning evasion strategy in pursuit-evasion by deep Q-network, in: Proc. of the 24th ICPR, Beijing, China, 2018, pp. 67–72.\nAwheda, 2016, A decentralized fuzzy learning algorithm for pursuit-evasion differential games with superior evaders, J. Intell. Robot. Syst., 83, 35, 10.1007\u002Fs10846-015-0315-y\nde Souza, 2021, Decentralized multi-agent pursuit using deep reinforcement learning, IEEE Robot. Autom. Lett., 6, 4552, 10.1109\u002FLRA.2021.3068952\nT.L. Saaty, Principles of the analytic hierarchy process, in: Proc. of the NATO-ARW, Porto, Portugal, 1987, pp. 27–73.\nHo, 2018, The state-of-the-art integrations and applications of the analytic hierarchy process, European J. Oper. Res., 267, 399, 10.1016\u002Fj.ejor.2017.09.007\nJ. Kennedy, R. Eberhart, Particle swarm optimization, in: Proc. of ICNN’95, Perth, WA, Australia, 1995, pp. 1942–1948.\nKashani, 2021, Particle swarm optimization variants for solving geotechnical problems: Review and comparative analysis, Arch. Comput. Methods Eng., 28, 1871, 10.1007\u002Fs11831-020-09442-0\nGad, 2022, Particle swarm optimization algorithm and its applications: A systematic review, Arch. Comput. Method Eng., 29, 2531, 10.1007\u002Fs11831-021-09694-4\nElbes, 2019, A survey on particle swarm optimization with emphasis on engineering and network applications, Evol. Intell., 12, 113, 10.1007\u002Fs12065-019-00210-z",{"VOID":2051},"10.1016\u002Fj.knosys.2022.109953","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0950705122010462",[2054,2069,2084,2097],{"id":2055,"sortIndex":32,"researcher":28,"roles":2056,"affiliations":2057,"properties":2066,"displayName":2068,"givenName":28,"familyName":28},"10c0dffa-d2c8-47f0-a456-754dad4f6297",[968],[2058],{"id":2059,"sortIndex":32,"affiliation":2060,"properties":28},"ec62dcb7-cb86-4601-a06a-a7f3e5bef81a",{"id":2059,"createTime":28,"updateTime":28,"relativeEntities":2061,"slug":28,"properties":2062,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2065,"statistic":28},[],{"title":2063},{"VI":2064},"School of Intelligent Systems Engineering, Sun Yat-Sen University, Shenzhen 518000, China",[],{"title":2067},{"VI":2068},"Yanjie Yang",{"id":2070,"sortIndex":40,"researcher":28,"roles":2071,"affiliations":2072,"properties":2081,"displayName":2083,"givenName":28,"familyName":28},"e10c46f3-43ae-411e-b0cc-fc1553dbc767",[968],[2073],{"id":2074,"sortIndex":32,"affiliation":2075,"properties":28},"0af8a998-4298-4e94-9a58-7c08aa7f9187",{"id":2074,"createTime":28,"updateTime":28,"relativeEntities":2076,"slug":28,"properties":2077,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2080,"statistic":28},[],{"title":2078},{"VI":2079},"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, China",[],{"title":2082},{"VI":2083},"Liu He",{"id":2085,"sortIndex":123,"researcher":28,"roles":2086,"affiliations":2087,"properties":2094,"displayName":2096,"givenName":28,"familyName":28},"d2f8b222-a5cf-4e34-abca-55e142ba87d0",[968],[2088],{"id":2059,"sortIndex":32,"affiliation":2089,"properties":28},{"id":2059,"createTime":28,"updateTime":28,"relativeEntities":2090,"slug":28,"properties":2091,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2093,"statistic":28},[],{"title":2092},{"VI":2064},[],{"title":2095},{"VI":2096},"Zhengping Fan",{"id":2098,"sortIndex":42,"researcher":28,"roles":2099,"affiliations":2100,"properties":2107,"displayName":2109,"givenName":28,"familyName":28},"0bed8073-25ca-4034-bfcf-3ffef4ff9465",[968],[2101],{"id":2074,"sortIndex":32,"affiliation":2102,"properties":28},{"id":2074,"createTime":28,"updateTime":28,"relativeEntities":2103,"slug":28,"properties":2104,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2106,"statistic":28},[],{"title":2105},{"VI":2079},[],{"title":2108},{"VI":2109},"Hui Cheng",{"url":2052,"publisher":2111,"properties":2154},{"id":868,"createTime":869,"updateTime":870,"relativeEntities":2112,"slug":872,"properties":2113,"entityType":25,"verifyStatus":878,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":45,"subjectFields":2116,"manageAffiliations":2133,"indexDatabases":2139,"url":28,"thumbnailPath":28,"statistic":28,"gsStatistic":28,"type":28,"analyzePriority":28},[],{"issn":2114,"title":2115},{"VOID":875},{"EN":877},[2117,2121,2125,2129],{"id":881,"createTime":28,"updateTime":28,"relativeEntities":2118,"label":2119,"description":2120,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":884},{},{"id":887,"createTime":28,"updateTime":28,"relativeEntities":2122,"label":2123,"description":2124,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":890},{},{"id":893,"createTime":28,"updateTime":28,"relativeEntities":2126,"label":2127,"description":2128,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":896},{},{"id":899,"createTime":28,"updateTime":28,"relativeEntities":2130,"label":2131,"description":2132,"parentId":28,"standard":28,"scholarHubFieldId":28},[],{"EN":902},{},[2134],{"id":906,"createTime":28,"updateTime":28,"relativeEntities":2135,"slug":28,"properties":2136,"entityType":28,"verifyStatus":28,"verifyTime":28,"verifyNote":28,"languages":28,"translateLanguages":28,"viewCount":28,"url":28,"parentIds":2138,"statistic":28},[],{"title":2137},{"EN":910},[],[2140,2147],{"id":930,"indexDatabase":2141,"url":936,"indexYears":937,"academicFieldIds":2146,"indexDatabaseRanking":943},{"id":775,"createTime":28,"updateTime":28,"relativeEntities":2142,"label":2143,"description":2144,"key":781,"publicationTags":2145,"standard":28},[],{"EN":778,"VI":778},{"EN":778,"VI":780},[783],[939,940,941,942],{"id":914,"indexDatabase":2148,"url":926,"indexYears":28,"academicFieldIds":2153,"indexDatabaseRanking":28},{"id":916,"createTime":28,"updateTime":28,"relativeEntities":2149,"label":2150,"description":2151,"key":923,"publicationTags":2152,"standard":28},[],{"EN":919,"VI":919},{"EN":921,"VI":922},[925,813],[928],{"pages":2155,"volume":2157},{"VOID":2156},"109953",{"VOID":2158},"258",[943,925]]