{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:37Z","timestamp":1740169357003,"version":"3.37.3"},"reference-count":75,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004705","name":"King Mongkut\u2019s University of Technology Thonburi (KMUTT) through the Petchra Pra Jom Klao Scholarship","doi-asserted-by":"publisher","award":["49\/2562"],"award-info":[{"award-number":["49\/2562"]}],"id":[{"id":"10.13039\/501100004705","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008665","name":"Interdisciplinary Centre for Security, Reliability, and Trust (SnT), Faculty of Science, Technology and Medicine, University of Luxembourg","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3329429","type":"journal-article","created":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T18:23:36Z","timestamp":1698863016000},"page":"122273-122294","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning Graph Clustering With User-Specified Density"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7928-8942","authenticated-orcid":false,"given":"Rohi","family":"Tariq","sequence":"first","affiliation":[{"name":"School of Information Technology, King Mongkut&#x2019;s University of Technology Thonburi, Bangkok, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9227-4839","authenticated-orcid":false,"given":"Kittichai","family":"Lavangnananda","sequence":"additional","affiliation":[{"name":"School of Information Technology, King Mongkut&#x2019;s University of Technology Thonburi, Bangkok, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9338-2834","authenticated-orcid":false,"given":"Pascal","family":"Bouvry","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Science, Technology and Medicine, University of Luxembourg, Esch-sur-Alzette, Luxembourg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6069-1315","authenticated-orcid":false,"given":"Pornchai","family":"Mongkolnam","sequence":"additional","affiliation":[{"name":"School of Information Technology, King Mongkut&#x2019;s University of Technology Thonburi, Bangkok, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2020.101739"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.11.011"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3340960"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108665"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0774-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(99)00008-2"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"ref53","first-page":"229","article-title":"Fluid communities: A competitive, scalable and diverse community detection algorithm","author":"par\u00e9s","year":"2017","journal-title":"Proc 6th Complex Netw Their Appl"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref54","first-page":"1","article-title":"On spectral clustering: Analysis and an algorithm","volume":"14","author":"ng","year":"2001","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.06.064"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2906949"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.056117"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-003-0346-3"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1038\/srep00336"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.12.009"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/11569596_31"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3390\/e23050497"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-022-00466-y"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.04.016"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.056107"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1140\/epjst\/e2010-01179-1"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0210-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"ref8","first-page":"281","article-title":"Classification and analysis of multivariate observations","author":"macqueen","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Statist Probab"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113764"},{"key":"ref9","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"ester","year":"1996","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.11.025"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3175317"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-019-00626-8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.03.051"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3114099"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0165-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-011-0224-z"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1002\/wics.1319"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347121"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115746"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.04.015"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.042301"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.03.075"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.08.013"},{"key":"ref39","first-page":"1","article-title":"The igraph software package for complex network research","volume":"1695","author":"cs\u00e1rdi","year":"2006","journal-title":"InterJ Complex Syst"},{"key":"ref38","doi-asserted-by":"crossref","DOI":"10.25080\/TCWV9851","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"hagberg","year":"2008"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2982400"},{"key":"ref70","first-page":"42","article-title":"Evaluating the quality of clustering algorithms using cluster path lengths","author":"aidi","year":"2010","journal-title":"Proc 10th Adv Data Mining Appl Theor Aspects"},{"key":"ref73","first-page":"17","article-title":"Relative density based k-nearest neighbors clustering algorithm","author":"liu","year":"2003","journal-title":"Proc Int Conf Mach Learn Cybern"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-05777-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.10.024"},{"key":"ref68","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"shi","year":"2000","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2012.2227704"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/43.310898"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.11.008"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-23932-z"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-41695-z"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2875626"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3091106"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100376"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/s20205858"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.062805"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.03.072"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.07.034"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2023.01.196"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0159161"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23780-5_13"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10304131.pdf?arnumber=10304131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T06:24:03Z","timestamp":1730442243000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10304131\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":75,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3329429","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}