{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:01:29Z","timestamp":1783576889664,"version":"3.55.0"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1016\/j.ins.2022.08.047","type":"journal-article","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T22:40:46Z","timestamp":1660171246000},"page":"694-706","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["A geometric-based clustering method using natural neighbors"],"prefix":"10.1016","volume":"610","author":[{"given":"Shahin","family":"Pourbahrami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahdi","family":"Hashemzadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2022.08.047_b0005","doi-asserted-by":"crossref","unstructured":"S. Dutta, S. Sengupta, Implementation of K-means clustering in ECB framework of cloud computing environment, in: 2017 7th International Conference on Cloud Computing, Data Science & Engineering-Confluence, IEEE, 2017, pp. 293-297.","DOI":"10.1109\/CONFLUENCE.2017.7943165"},{"key":"10.1016\/j.ins.2022.08.047_b0010","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s11042-013-1367-2","article-title":"Counting moving people in crowds using motion statistics of feature-points","volume":"72","author":"Hashemzadeh","year":"2014","journal-title":"Multimedia Tools Appl."},{"key":"10.1016\/j.ins.2022.08.047_b0015","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1080\/18756891.2016.1237185","article-title":"A machine vision system for detecting fertile eggs in the incubation industry","volume":"9","author":"Hashemzadeh","year":"2016","journal-title":"Int J. Comput. Intell. Syst."},{"key":"10.1016\/j.ins.2022.08.047_b0020","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.asoc.2019.02.038","article-title":"New fuzzy C-means clustering method based on feature-weight and cluster-weight learning","volume":"78","author":"Hashemzadeh","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.ins.2022.08.047_b0025","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.eswa.2019.04.019","article-title":"Fire detection for video surveillance applications using ICA K-medoids-based color model and efficient spatio-temporal visual features","volume":"130","author":"Hashemzadeh","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2022.08.047_b0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artmed.2019.03.001","article-title":"Retinal blood vessel extraction employing effective image features and combination of supervised and unsupervised machine learning methods","volume":"95","author":"Hashemzadeh","year":"2019","journal-title":"Artif. Intell. Med."},{"key":"10.1016\/j.ins.2022.08.047_b0035","doi-asserted-by":"crossref","first-page":"1354003","DOI":"10.1142\/S0218001413540037","article-title":"Combining velocity and location-specific spatial clues in trajectories for counting crowded moving objects","volume":"27","author":"Hashemzadeh","year":"2013","journal-title":"Int. J. Pattern Recognit Artif Intell."},{"key":"10.1016\/j.ins.2022.08.047_b0040","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.eswa.2018.07.066","article-title":"A novel and efficient data point neighborhood construction algorithm based on Apollonius circle","volume":"115","author":"Pourbahrami","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2022.08.047_b0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2020.100315","article-title":"A survey of neighborhood construction algorithms for clustering and classifying data points","volume":"38","author":"Pourbahrami","year":"2020","journal-title":"Comput. Sci. Rev."},{"key":"10.1016\/j.ins.2022.08.047_b0050","series-title":"In: 2017 International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)","first-page":"787","article-title":"Using k-nearest neighbor information for parameter-free density based clustering","author":"Sharma","year":"2017"},{"key":"10.1016\/j.ins.2022.08.047_b0055","first-page":"59","article-title":"A new method for detection of clustering based on four zones Apollonius circle, Iran","volume":"3","author":"Pourbahrami","year":"2020","journal-title":"J. Comput. Sci."},{"key":"10.1016\/j.ins.2022.08.047_b0060","first-page":"100","article-title":"Clustering algorithm based on mutual K-nearest neighbor relationships, Statistical Analysis and Data Mining: The ASA","volume":"5","author":"Hu","year":"2012","journal-title":"Data Sci. J."},{"key":"10.1016\/j.ins.2022.08.047_b0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.108334","article-title":"Graph clustering via variational graph embedding","volume":"122","author":"Guo","year":"2022","journal-title":"Pattern Recogn."},{"key":"10.1016\/j.ins.2022.08.047_b0070","series-title":"In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","article-title":"Highly-efficient incomplete large-scale multi-view clustering with consensus bipartite graph","author":"Wang","year":"2022"},{"key":"10.1016\/j.ins.2022.08.047_b0075","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"10.1016\/j.ins.2022.08.047_b0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.105454","article-title":"Dense members of local cores-based density peaks clustering algorithm","volume":"193","author":"Cheng","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2022.08.047_b0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107589","article-title":"DenMune: density peak based clustering using mutual nearest neighbors","volume":"109","author":"Abbas","year":"2021","journal-title":"Pattern Recogn."},{"key":"10.1016\/j.ins.2022.08.047_b0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2020.02.049","article-title":"Improving neighborhood construction with apollonius region algorithm based on density for clustering","author":"Pourbahrami","year":"2020","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2022.08.047_b0095","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1109\/TNNLS.2018.2853710","article-title":"A novel cluster validity index based on local cores","volume":"30","author":"Cheng","year":"2018","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"10.1016\/j.ins.2022.08.047_b0100","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","article-title":"Chameleon: Hierarchical clustering using dynamic modeling","volume":"32","author":"Karypis","year":"1999","journal-title":"Computer"},{"key":"10.1016\/j.ins.2022.08.047_b0105","first-page":"1","article-title":"An adaptive detection of multilevel co-location patterns based on natural neighborhoods","author":"Liu","year":"2020","journal-title":"Int. J. Geograph. Inform. Sci."},{"key":"10.1016\/j.ins.2022.08.047_b0110","doi-asserted-by":"crossref","first-page":"205","DOI":"10.21105\/joss.00205","article-title":"hdbscan: Hierarchical density based clustering","volume":"2","author":"McInnes","year":"2017","journal-title":"J. Open Source Software"},{"key":"10.1016\/j.ins.2022.08.047_b0115","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.3390\/app12052405","article-title":"An Implementation of the HDBSCAN* Clustering Algorithm","volume":"12","author":"Stewart","year":"2022","journal-title":"Appl. Sci."},{"key":"10.1016\/j.ins.2022.08.047_b0120","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.patrec.2016.07.026","article-title":"Optimum-path forest based on k-connectivity: Theory and applications","volume":"87","author":"Papa","year":"2017","journal-title":"Pattern Recogn. Lett."},{"key":"10.1016\/j.ins.2022.08.047_b0125","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1016\/j.patrec.2008.01.028","article-title":"Effective clustering and boundary detection algorithm based on Delaunay triangulation","volume":"29","author":"Liu","year":"2008","journal-title":"Pattern Recogn. Lett."},{"key":"10.1016\/j.ins.2022.08.047_b0130","doi-asserted-by":"crossref","first-page":"9814","DOI":"10.1073\/pnas.1700770114","article-title":"Robust continuous clustering","volume":"114","author":"Shah","year":"2017","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.ins.2022.08.047_b0135","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1186\/s40537-018-0122-y","article-title":"Efficiency of random swap clustering","volume":"5","author":"Fr\u00e4nti","year":"2018","journal-title":"J. Big Data"},{"key":"10.1016\/j.ins.2022.08.047_b0140","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.neucom.2016.12.040","article-title":"Adaptive edited natural neighbor algorithm","volume":"230","author":"Yang","year":"2017","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ins.2022.08.047_b0145","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.patrec.2016.05.007","article-title":"Natural neighbor: a self-adaptive neighborhood method without parameter K","volume":"80","author":"Zhu","year":"2016","journal-title":"Pattern Recogn. Lett."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020025522009331?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0020025522009331?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T05:51:07Z","timestamp":1758088267000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025522009331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":29,"alternative-id":["S0020025522009331"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2022.08.047","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A geometric-based clustering method using natural neighbors","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ins.2022.08.047","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}