{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:23:21Z","timestamp":1740169401059,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Huzhou Science and Technology Plan Project","award":["2022GZ57"],"award-info":[{"award-number":["2022GZ57"]}]},{"name":"Science and Technology Research Program of Huzhou Vocational and Technical College","award":["2022GY06"],"award-info":[{"award-number":["2022GY06"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3374770","type":"journal-article","created":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T19:21:49Z","timestamp":1709839309000},"page":"42961-42973","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Web Text Clustering Accuracy and Efficiency With a Maximum Entropy Function Model: Overcoming High-Dimensional and Directional Challenges"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-9635-1013","authenticated-orcid":false,"given":"Xumin","family":"Zhao","sequence":"first","affiliation":[{"name":"Key Laboratory of Open Data of Zhejiang Province, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4925-9289","authenticated-orcid":false,"given":"Guojie","family":"Xie","sequence":"additional","affiliation":[{"name":"Key Laboratory of Open Data of Zhejiang Province, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4367-8535","authenticated-orcid":false,"given":"Yi","family":"Luo","sequence":"additional","affiliation":[{"name":"Key Laboratory of Open Data of Zhejiang Province, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fenghua","family":"Liu","sequence":"additional","affiliation":[{"name":"Huzhou Vocational and Technical College, Huzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6298-3327","authenticated-orcid":false,"given":"Hongpeng","family":"Bai","sequence":"additional","affiliation":[{"name":"School of Intelligence and Computing, Tianjin University, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2895440"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/s23125435"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/3744086"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03325-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2018.2852289"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/91.784198"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28349-8_2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2009.08.007"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2956527"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICADIWT.2014.6814687"},{"issue":"34","key":"ref12","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume-title":"Proc. KDD","volume":"96","author":"Ester"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.12.019"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015404"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-021-03670-3"},{"issue":"8","key":"ref16","first-page":"1","article-title":"Cryptography based on artificial neural network","volume":"4","author":"Jagtap","year":"2015","journal-title":"Int. J. Appl. Innov. Eng. Manag."},{"volume-title":"Methods and systems for performing high volume searches in a multi-tenant store","year":"2014","author":"Oliver","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1070\/RCR4994"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/app13010342"},{"key":"ref21","first-page":"1","article-title":"Learning the K in K-means","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"17","author":"Hamerly"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/widm.53"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICBDA.2017.8078834"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/13102818.2014.949045"},{"volume-title":"A comprehensive framework of machine learning model for clustering ham and spam emails based on unsupervised learning","year":"2021","author":"Karim","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-023-04651-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICAECIS58353.2023.10170468"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.9726\/kspse.2016.20.4.032"},{"issue":"8","key":"ref29","first-page":"13","article-title":"Customer segmentation of bank based on data mining\u2013security value based heuristic approach as a replacement to K-means segmentation","volume":"19","author":"Shashidhar","year":"2011","journal-title":"Int. J. Comput. Appl."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CSBW.2005.82"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2011.08.036"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/iThings-GreenCom-CPSCom-SmartData.2017.65"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2015.11.004"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.eacl-main.247"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1042"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.5220\/0008940304940505"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996454"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1982.12425"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/10485250903486078"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.02.003"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2016.06.005"},{"key":"ref42","article-title":"Entropy, optimization and counting","author":"Singh","year":"2013","journal-title":"arXiv:1304.8108"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00112"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-022-06896-1"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2012.11.052"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICACCS51430.2021.9441909"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10463017.pdf?arnumber=10463017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T20:47:15Z","timestamp":1711658835000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10463017\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3374770","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}