{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:57:34Z","timestamp":1781110654929,"version":"3.54.1"},"reference-count":38,"publisher":"IGI Global Scientific Publishing","issue":"1","license":[{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"},{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"},{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/deed.en_US"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,23]]},"abstract":"<p>In this work, a simple yet robust neighboring-aware hierarchical-based clustering approach (NHC) is developed. NHC employs its dynamic technique to take into account the surroundings of each point when clustering, making it extremely competitive. NHC offers a straightforward design and reliable clustering. It comprises two key techniques, namely, neighboring- aware and filtering and merging. While the proposed neighboring-aware technique helps find the most coherent clusters, filtering and merging help reach the desired number of clusters during the clustering process. The NHC's performance, which includes all evaluation metrics and run time, has been thoroughly tested against nine clustering rivals using four similarity measures on several real-world numerical and textual datasets. The evaluation is done in two phases. First, we compare NHC to three common clustering methods and show its efficacy through empirical analysis. Second, a comparison with six relevant, contemporary competitors highlights NHC's extremely competitive performance.<\/p>","DOI":"10.4018\/ijswis.346377","type":"journal-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T16:09:27Z","timestamp":1716480567000},"page":"1-24","source":"Crossref","is-referenced-by-count":5,"title":["Neighboring-Aware Hierarchical Clustering"],"prefix":"10.4018","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2002-948X","authenticated-orcid":true,"given":"Ali A.","family":"Amer","sequence":"first","affiliation":[{"name":"Zayed University, UAE"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muna","family":"Al-Razgan","sequence":"additional","affiliation":[{"name":"King Saud University, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hassan I.","family":"Abdalla","sequence":"additional","affiliation":[{"name":"Zayed University, UAE"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4558-5394","authenticated-orcid":true,"given":"Mahfoudh","family":"Al-Asaly","sequence":"additional","affiliation":[{"name":"King Saud University, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0366-5932","authenticated-orcid":true,"given":"Taha","family":"Alfakih","sequence":"additional","affiliation":[{"name":"King Saud University, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muneer","family":"Al-Hammadi","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJSWIS.346377-0","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.641"},{"key":"IJSWIS.346377-1","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-023-00849-7"},{"key":"IJSWIS.346377-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2008.11.003"},{"key":"IJSWIS.346377-3","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-007-1935-1"},{"key":"IJSWIS.346377-4","doi-asserted-by":"publisher","DOI":"10.4018\/IJSWIS.295550"},{"issue":"17","key":"IJSWIS.346377-5","first-page":"3644","article-title":"A comparison study of document clustering using DOC2VEC versus TFIDF combined with LSA for small corpora.","volume":"98","author":"A.Amalia","year":"2020","journal-title":"Journal of Theoretical and Applied Information Technology"},{"key":"IJSWIS.346377-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2020.e03172"},{"key":"IJSWIS.346377-7","unstructured":"Arthur, D., & Vassilvitskii, S. (2007). K-means++: The advantages of careful seeding. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 07-09-January-2007, pp. 1027\u20131035). Association for Computing Machinery."},{"key":"IJSWIS.346377-8","doi-asserted-by":"publisher","DOI":"10.4018\/IJSWIS.297034"},{"key":"IJSWIS.346377-9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.04.002"},{"key":"IJSWIS.346377-10","unstructured":"Fern\u00e1ndez, A., & G\u00f3mez, S. (2021). mdendro: Extended Agglomerative Hierarchical Clustering."},{"key":"IJSWIS.346377-11","doi-asserted-by":"publisher","DOI":"10.1093\/llc\/fqt002"},{"key":"IJSWIS.346377-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.05.009"},{"key":"IJSWIS.346377-13","doi-asserted-by":"publisher","DOI":"10.4018\/IJSWIS.2018010102"},{"key":"IJSWIS.346377-14","unstructured":"Goyal, M. M., Agrawal, N., Sarma, M. K., & Kalita, N. (2015). Comparison clustering using cosine and fuzzy set based similarity measures of text documents. ArXiv, abs\/1505.00168."},{"key":"IJSWIS.346377-15","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-0868-6"},{"key":"IJSWIS.346377-16","first-page":"49","article-title":"Similarity measures for text document clustering.","author":"A.Huang","year":"2008","journal-title":"Proceedings of the Sixth New Zealand Computer Science Research Student Conference (NZCSRSC2008)"},{"key":"IJSWIS.346377-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.09.006"},{"key":"IJSWIS.346377-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113435"},{"key":"IJSWIS.346377-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.03.051"},{"key":"IJSWIS.346377-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103770"},{"key":"IJSWIS.346377-21","doi-asserted-by":"publisher","DOI":"10.1109\/ITI.2008.4588492"},{"key":"IJSWIS.346377-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.08.008"},{"key":"IJSWIS.346377-23","first-page":"1","article-title":"A method for kmeans-like clustering of categorical data.","volume":"\u2022\u2022\u2022","author":"T.-H. T.Nguyen","year":"2019","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"key":"IJSWIS.346377-24","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-5225-5191-1.ch003"},{"key":"IJSWIS.346377-25","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6717"},{"key":"IJSWIS.346377-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2018.04.023"},{"key":"IJSWIS.346377-27","doi-asserted-by":"publisher","DOI":"10.4018\/IJSWIS.2018100102"},{"key":"IJSWIS.346377-28","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5177-8"},{"key":"IJSWIS.346377-29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCYB.2008.4721382"},{"key":"IJSWIS.346377-30","first-page":"58","article-title":"Impact of similarity measures on web-page clustering.","author":"A.Strehl","year":"2000","journal-title":"Proceedings of the Workshop on Artificial Intelligence for Web Search (AAAI 2000)"},{"key":"IJSWIS.346377-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2013.03.009"},{"key":"IJSWIS.346377-32","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"},{"key":"IJSWIS.346377-33","doi-asserted-by":"publisher","DOI":"10.4018\/IJSWIS.306750"},{"key":"IJSWIS.346377-34","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1325\/1\/012106"},{"key":"IJSWIS.346377-35","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126619500658"},{"key":"IJSWIS.346377-36","doi-asserted-by":"publisher","DOI":"10.1142\/S1793351X15400085"},{"key":"IJSWIS.346377-37","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.07.026"}],"container-title":["International Journal on Semantic Web and Information Systems"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=346377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T06:29:17Z","timestamp":1738736957000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJSWIS.346377"}},"subtitle":["A New Algorithm and Extensive Evaluation"],"short-title":[],"issued":{"date-parts":[[2024,5,23]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijswis.346377","relation":{},"ISSN":["1552-6283","1552-6291"],"issn-type":[{"value":"1552-6283","type":"print"},{"value":"1552-6291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,23]]}}}