{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T20:57:37Z","timestamp":1780433857769,"version":"3.54.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T00:00:00Z","timestamp":1746576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T00:00:00Z","timestamp":1746576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Natural Science Foundation of China project under Grant","award":["62466016"],"award-info":[{"award-number":["62466016"]}]},{"name":"National Natural Science Foundation of China project under Grant","award":["62466016"],"award-info":[{"award-number":["62466016"]}]},{"name":"National Natural Science Foundation of China project under Grant","award":["62466016"],"award-info":[{"award-number":["62466016"]}]},{"name":"National Natural Science Foundation of China project under Grant","award":["62466016"],"award-info":[{"award-number":["62466016"]}]},{"name":"National Key Research and Development Pro-gram of China","award":["20212D0111000"],"award-info":[{"award-number":["20212D0111000"]}]},{"name":"National Key Research and Development Pro-gram of China","award":["20212D0111000"],"award-info":[{"award-number":["20212D0111000"]}]},{"name":"National Key Research and Development Pro-gram of China","award":["20212D0111000"],"award-info":[{"award-number":["20212D0111000"]}]},{"name":"National Key Research and Development Pro-gram of China","award":["20212D0111000"],"award-info":[{"award-number":["20212D0111000"]}]},{"name":"Key research and development plan of the Ministry of Science and Technology","award":["2021ZD0111002"],"award-info":[{"award-number":["2021ZD0111002"]}]},{"name":"Key research and development plan of the Ministry of Science and Technology","award":["2021ZD0111002"],"award-info":[{"award-number":["2021ZD0111002"]}]},{"name":"Key research and development plan of the Ministry of Science and Technology","award":["2021ZD0111002"],"award-info":[{"award-number":["2021ZD0111002"]}]},{"name":"Key research and development plan of the Ministry of Science and Technology","award":["2021ZD0111002"],"award-info":[{"award-number":["2021ZD0111002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s13042-025-02625-w","type":"journal-article","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T05:57:19Z","timestamp":1746597439000},"page":"6347-6365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Temporal knowledge graph representation learning with temporal feature and complex evolution"],"prefix":"10.1007","volume":"16","author":[{"given":"Qian","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siling","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengxing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uzair Aslam","family":"Bhatti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,7]]},"reference":[{"issue":"11","key":"2625_CR1","doi-asserted-by":"publisher","first-page":"13071","DOI":"10.1007\/s10462-023-10465-9","volume":"56","author":"C Peng","year":"2023","unstructured":"Peng C, Xia F, Naseriparsa M et al (2023) Knowledge graphs: Opportunities and challenges[J]. Artif Intell Rev 56(11):13071\u201313102","journal-title":"Artif Intell Rev"},{"key":"2625_CR2","doi-asserted-by":"crossref","unstructured":"Bollacker K et al (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data,  Vancouver, Canada: ACM, pp 1247\u20131250","DOI":"10.1145\/1376616.1376746"},{"key":"2625_CR3","doi-asserted-by":"crossref","unstructured":"Oram P (2001) WordNet: an electronic lexical database. Christiane Fellbaum (Ed.). Cambridge, MA: MIT Press, 1998. Pp. 423. Appl Psycholinguist 22(1):131\u2013134","DOI":"10.1017\/S0142716401221079"},{"key":"2625_CR4","doi-asserted-by":"crossref","unstructured":"Rebele T, Suchanek F, Hoffart J et al (2016) YAGO: A multilingual knowledge base from wikipedia, wordnet, and geonames[C]\/\/The Semantic Web\u2013ISWC 2016: 15th International Semantic Web Conference, Kobe, Japan, October 17\u201321, 2016, Proceedings, Part II 15. Springer International Publishing, pp 177\u2013185","DOI":"10.1007\/978-3-319-46547-0_19"},{"key":"2625_CR5","doi-asserted-by":"crossref","unstructured":"Auer S et al (2007) DBpedia: a nucleus for a web of open data. In: International semantic web conference. Springer, Berlin, pp\u00a0722\u2013735","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"2625_CR6","doi-asserted-by":"crossref","unstructured":"Li D, Qu H, Wang J (2023) A survey on knowledge graph-based recommender systems. In: 2023 China Automation Congress (CAC). Chongqing, China: IEEE, pp 2925\u20132930","DOI":"10.1109\/CAC59555.2023.10450693"},{"issue":"5","key":"2625_CR7","doi-asserted-by":"publisher","first-page":"750","DOI":"10.3390\/electronics9050750","volume":"9","author":"Y Dai","year":"2020","unstructured":"Dai Y et al (2020) A survey on knowledge graph embedding: approaches, applications and benchmarks. Electronics 9(5):750","journal-title":"Electronics"},{"issue":"7","key":"2625_CR8","doi-asserted-by":"publisher","first-page":"4357","DOI":"10.3390\/app13074357","volume":"13","author":"R Liu","year":"2023","unstructured":"Liu R et al (2023) A review of knowledge graph-based reasoning technology in the operation of power systems. Appl Sci 13(7):4357","journal-title":"Appl Sci"},{"issue":"12","key":"2625_CR9","doi-asserted-by":"publisher","first-page":"4117","DOI":"10.1080\/00207543.2021.2022803","volume":"61","author":"B Zhou","year":"2023","unstructured":"Zhou B et al (2023) Semantic-aware event link reasoning over industrial knowledge graph embedding time series data. Int J Prod Res 61(12):4117\u20134134","journal-title":"Int J Prod Res"},{"key":"2625_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jretconser.2022.103129","volume":"70","author":"A Lutfi","year":"2023","unstructured":"Lutfi A et al (2023) Drivers and impact of big data analytic adoption in the retail industry: a quantitative investigation applying structural equation modeling. J Retail Consum Serv 70:103129","journal-title":"J Retail Consum Serv"},{"key":"2625_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/dap.2022.26","volume":"4","author":"T Libel","year":"2022","unstructured":"Libel T (2022) Lesson (un) replicated: predicting levels of political violence in Afghan administrative units per month using ARFIMA and ICEWS data. Data Policy 4:e32","journal-title":"Data Policy"},{"key":"2625_CR12","unstructured":"Leetaru K, Schrodt P A. Gdelt: Global data on events, location, and tone, 1979\u20132012[C]\/\/ISA annual convention. Citeseer, 2013, 2(4): 1-49."},{"key":"2625_CR13","doi-asserted-by":"crossref","unstructured":"Chen S, Wang J (2022) A survey on temporal knowledge graphs-extrapolation and interpolation tasks. In: The international conference on natural computation, fuzzy systems and knowledge discovery. Springer, Berlin, pp\u00a01002\u20131014","DOI":"10.1007\/978-3-031-20738-9_110"},{"key":"2625_CR14","doi-asserted-by":"crossref","unstructured":"Chen Z et al (2023) Meta-learning based knowledge extrapolation for temporal knowledge graph. In: Proceedings of the ACM web conference 2023, Austin, TX, USA: Association for Computing Machinery (ACM), pp 2433\u20132443","DOI":"10.1145\/3543507.3583279"},{"key":"2625_CR15","doi-asserted-by":"crossref","unstructured":"Deng S, Rangwala H, Ning Y (2020) Dynamic knowledge graph based multi-event forecasting. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery and data mining,San Diego, CA, USA: Association for Computing Machinery (ACM), pp 1585\u20131595","DOI":"10.1145\/3394486.3403209"},{"key":"2625_CR16","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.procs.2022.01.096","volume":"199","author":"S Wen","year":"2022","unstructured":"Wen S et al (2022) Analysis of financial fraud based on manager knowledge graph. Procedia Comput Sci 199:773\u2013779","journal-title":"Procedia Comput Sci"},{"key":"2625_CR17","doi-asserted-by":"crossref","unstructured":"Jin Woojeong et al (2019) \u201cRecurrent event network: Autoregressive structure inference over temporal knowledge graphs\u201d. In: arXiv preprint arXiv:1904.05530","DOI":"10.18653\/v1\/2020.emnlp-main.541"},{"key":"2625_CR18","doi-asserted-by":"crossref","unstructured":"Zhu C et al (2021) Learning from history: modeling temporal knowledge graphs with sequential copy-generation networks. In: Proceedings of the AAAI conference on artificial intelligence, Virtual Conference: AAAI Press (Palo Alto, CA, USA), 2021, vol 35(5), pp 4732\u20134740","DOI":"10.1609\/aaai.v35i5.16604"},{"key":"2625_CR19","doi-asserted-by":"crossref","unstructured":"Li Z et al (2021) Temporal knowledge graph reasoning based on evolutional representation learning. In: Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval, Virtual Event, Canada: Association for Computing Machinery (ACM), pp 408\u2013417","DOI":"10.1145\/3404835.3462963"},{"key":"2625_CR20","doi-asserted-by":"crossref","unstructured":"Li Z et al (2022) Complex evolutional pattern learning for temporal knowledge graph reasoning. arXiv preprint. arXiv:2203.07782","DOI":"10.18653\/v1\/2022.acl-short.32"},{"key":"2625_CR21","doi-asserted-by":"crossref","unstructured":"Li Y, Sun S, Zhao J (2022) TiRGN: Time-Guided Recurrent Graph Network with Local-Global Historical Patterns for Temporal Knowledge Graph Reasoning[C]\/\/IJCAI, pp 2152\u20132158","DOI":"10.24963\/ijcai.2022\/299"},{"key":"2625_CR22","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M et al (2018) Modeling relational data with graph convolutional networks. In: The semantic web: 15th international conference, ESWC 2018, Heraklion, Crete, Greece, June 3\u20137, 2018, proceedings 15. Springer, Berlin, pp\u00a0593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"2625_CR23","doi-asserted-by":"crossref","unstructured":"Wang Z et al (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI conference on artificial intelligence, Qu\u00e9bec City, Canada: Association for the Advancement of Artificial Intelligence (AAAI)","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"2625_CR24","doi-asserted-by":"crossref","unstructured":"Lin Y et al (2015) Learning entity and relation embeddings for knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, Austin, Texas, USA: AAAI Press, vol 29(1)","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"2625_CR25","doi-asserted-by":"crossref","unstructured":"Ji G et al (2015) Knowledge graph embedding via dynamic mapping matrix. In: Proceedings of the 53rd annual meeting of the association for computational linguistics and the 7th international joint conference on natural language processing (volume 1: Long papers), Beijing, China: Association for Computational Linguistics, pp 687\u2013696","DOI":"10.3115\/v1\/P15-1067"},{"key":"2625_CR26","unstructured":"Sun Z, Deng Z H, Nie J Y et al (2019) Rotate: Knowledge graph embedding by relational rotation in complex space[J]. arXiv preprint arXiv:1902.10197"},{"issue":"1","key":"2625_CR27","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11280-022-01016-3","volume":"26","author":"Z Li","year":"2023","unstructured":"Li Z et al (2023) Transo: a knowledge-driven representation learning method with ontology information constraints. World Wide Web 26(1):297\u2013319","journal-title":"World Wide Web"},{"issue":"1","key":"2625_CR28","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11280-022-01016-3","volume":"26","author":"Z Li","year":"2023","unstructured":"Li Z et al (2023) Transo: a knowledge-driven representation learning method with ontology information constraints. World Wide Web 26(1):297\u2013319","journal-title":"World Wide Web"},{"key":"2625_CR29","doi-asserted-by":"crossref","unstructured":"Goel R et al (2020) Diachronic embedding for temporal knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, New York, NY, USA: AAAI Press, vol 34(4), pp 3988\u20133995","DOI":"10.1609\/aaai.v34i04.5815"},{"key":"2625_CR30","unstructured":"Lacroix T, Obozinski G, Usunier N (2020) Tensor decompositions for temporal knowledge base completion. arXiv preprint. arXiv:2004.04926"},{"key":"2625_CR31","doi-asserted-by":"crossref","unstructured":"Dettmers T et al (2018) Convolutional 2d knowledge graph embeddings. In: Proceedings of the AAAI conference on artificial intelligence, New Orleans, LA, USA: AAAI Press, vol 32(1)","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"2625_CR32","doi-asserted-by":"crossref","unstructured":"Shang C et al (2019) End-to-end structure-aware convolutional networks for knowledge base completion. In: Proceedings of the AAAI conference on artificial intelligence, Honolulu, HI, USA: AAAI Press, vol 33(01), pp 3060\u20133067","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"2625_CR33","doi-asserted-by":"crossref","unstructured":"Nguyen DQ et al (2017) A novel embedding model for knowledge base completion based on convolutional neural network. arXiv preprint. arXiv:1712.02121","DOI":"10.18653\/v1\/N18-2053"},{"key":"2625_CR34","doi-asserted-by":"crossref","unstructured":"Shang C et al (2019) End-to-end structure-aware convolutional networks for knowledge base completion. In: Proceedings of the AAAI conference on artificial intelligence,  Honolulu, HI, USA: AAAI, vol 33(01), pp 3060\u20133067","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"2625_CR35","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M et al (2018) Modeling relational data with graph convolutional networks. In: The semantic web: 15th international conference, ESWC 2018, Heraklion, Crete, Greece, June 3\u20137, 2018, proceedings 15. Springer, Berlin, pp\u00a0593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"2625_CR36","unstructured":"Vashishth S et al (2019) Composition-based multi-relational graph convolutional networks. arXiv preprint. arXiv:1911.03082"},{"key":"2625_CR37","doi-asserted-by":"crossref","unstructured":"Dasgupta SS, Ray SN, Talukdar P (2018) HyTE: hyperplane-based temporally aware knowledge graph embedding. In: Proceedings of the 2018 conference on empirical methods in natural language processing, Brussels, Belgium: Association for Computational Linguistics (ACL), pp 2001\u20132011","DOI":"10.18653\/v1\/D18-1225"},{"key":"2625_CR38","doi-asserted-by":"crossref","unstructured":"Leblay J, Chekol MW (2018) Deriving validity time in knowledge graph. In: Companion proceedings of the the web conference 2018, Lyon, France: Association for Computing Machinery (ACM), pp 1771\u20131776","DOI":"10.1145\/3184558.3191639"},{"key":"2625_CR39","doi-asserted-by":"crossref","unstructured":"Garc\u0131a-Dur\u00e1n A, Duman\u010di\u0107 S, Niepert M (2018) Learning sequence encoders for temporal knowledge graph completion. arXiv preprint. arXiv:1809.03202","DOI":"10.18653\/v1\/D18-1516"},{"key":"2625_CR40","doi-asserted-by":"crossref","unstructured":"Goel R et al (2020) Diachronic embedding for temporal knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, New York, NY, USA: AAAI, 2020, 34(04): 3988\u20133995.","DOI":"10.1609\/aaai.v34i04.5815"},{"key":"2625_CR41","doi-asserted-by":"crossref","unstructured":"Han Z et al (2020) DyERNIE: dynamic evolution of Riemannian manifold embeddings for temporal knowledge graph completion. arXiv preprint. arXiv:2011.03984","DOI":"10.18653\/v1\/2020.emnlp-main.593"},{"key":"2625_CR42","doi-asserted-by":"crossref","unstructured":"Li Z, Jin X, Li W et al (2021) Temporal knowledge graph reasoning based on evolutional representation learning[C]\/\/Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval, pp 408\u2013417","DOI":"10.1145\/3404835.3462963"},{"key":"2625_CR43","doi-asserted-by":"crossref","unstructured":"Wu J et al (2020) Temp: temporal message passing for temporal knowledge graph completion. arXiv preprint. arXiv:2010.03526","DOI":"10.18653\/v1\/2020.emnlp-main.462"},{"key":"2625_CR44","doi-asserted-by":"publisher","unstructured":"Han Z, Chen P, Ma Y et al (2020) xERTE: Explainable reasoning on temporal knowledge graphs for forecasting future links[J]. https:\/\/doi.org\/10.48550\/arXiv.2012.15537","DOI":"10.48550\/arXiv.2012.15537"},{"key":"2625_CR45","doi-asserted-by":"crossref","unstructured":"Liu Y et al (2022) TLogic: temporal logical rules for explainable link forecasting on temporal knowledge graphs. In: Proceedings of the AAAI conference on artificial intelligence, Virtual Conference: AAAI Press, vol 36(4), pp 4120\u20134127","DOI":"10.1609\/aaai.v36i4.20330"},{"key":"2625_CR46","doi-asserted-by":"crossref","unstructured":"Sun H et al (2021) Timetraveler: reinforcement learning for temporal knowledge graph forecasting. arXiv preprint. arXiv:2109.04101","DOI":"10.18653\/v1\/2021.emnlp-main.655"},{"key":"2625_CR47","doi-asserted-by":"crossref","unstructured":"Liu K et al (2023) RETIA: relation-entity twin-interact aggregation for temporal knowledge graph extrapolation. In: 2023 IEEE 39th international conference on data engineering (ICDE). Anaheim, CA, USA: IEEE, pp 1761\u20131774","DOI":"10.1109\/ICDE55515.2023.00138"},{"key":"2625_CR48","doi-asserted-by":"crossref","unstructured":"Xu Y et al (2023) Temporal knowledge graph reasoning with historical contrastive learning. In: Proceedings of the AAAI conference on artificial intelligence, Washington, D.C., USA: AAAI Press, vol 37(4), pp 4765\u20134773","DOI":"10.1609\/aaai.v37i4.25601"},{"issue":"6","key":"2625_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3648366","volume":"18","author":"X Li","year":"2024","unstructured":"Li X et al (2024) Intricate spatiotemporal dependency learning for temporal knowledge graph reasoning. ACM Trans Knowl Discov Data 18(6):1\u201319","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2625_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2023.104791","volume":"84","author":"H Xiao","year":"2023","unstructured":"Xiao H et al (2023) Transformers in medical image segmentation: a review. Biomed Signal Process Control 84:104791","journal-title":"Biomed Signal Process Control"},{"key":"2625_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118790","volume":"213","author":"J Zeng","year":"2023","unstructured":"Zeng J, Tang J (2023) Combining knowledge graph into metro passenger flow prediction: a split-attention relational graph convolutional network. Expert Syst Appl 213:118790","journal-title":"Expert Syst Appl"},{"issue":"11","key":"2625_CR52","doi-asserted-by":"publisher","first-page":"16591","DOI":"10.1007\/s11042-022-13820-0","volume":"82","author":"E Hassan","year":"2023","unstructured":"Hassan E et al (2023) The effect of choosing optimizer algorithms to improve computer vision tasks: a comparative study. Multimed Tools Appl 82(11):16591\u201316633","journal-title":"Multimed Tools Appl"},{"key":"2625_CR53","doi-asserted-by":"crossref","unstructured":"Nagubandi M et al (2022) Electric load forecasting using dual-stage attention network with cosine annealed warm restart schedule. In: 2022 International conference on emerging techniques in computational intelligence (ICETCI).  Hyderabad, India: IEEE, pp 141\u2013146","DOI":"10.1109\/ICETCI55171.2022.9921361"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02625-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02625-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02625-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T11:01:50Z","timestamp":1757156510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02625-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,7]]},"references-count":53,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2625"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02625-w","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,7]]},"assertion":[{"value":"15 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"In this study, all data used were obtained in accordance with the relevant ethical guidelines and regulations.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all participants involved in the data collection process. Any identifying information has been removed to ensure confidentiality and privacy. This research has been approved by the College of Information and Communication Engineering Review Board or Ethics Committee at Hainan University.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent for data used"}}]}}