{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:20:54Z","timestamp":1740108054733,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T00:00:00Z","timestamp":1681257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T00:00:00Z","timestamp":1681257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the Natural Science Foundation of China","doi-asserted-by":"crossref","award":["40804112"],"award-info":[{"award-number":["40804112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Youth Project of Science and Technology Research Program of Chongqing Education Commission of China","award":["KJQN202001143"],"award-info":[{"award-number":["KJQN202001143"]}]},{"name":"the High Quality Development Plan of Graduate Education of Chongqing University of Technology","award":["gzlcx20223216"],"award-info":[{"award-number":["gzlcx20223216"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10044-023-01160-0","type":"journal-article","created":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T04:03:02Z","timestamp":1681272182000},"page":"907-916","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A self-adaptive graph-based clustering method with noise identification"],"prefix":"10.1007","volume":"26","author":[{"given":"Lin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2027-4258","authenticated-orcid":false,"given":"Chengyun","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,12]]},"reference":[{"key":"1160_CR1","unstructured":"Stevens S (1951) Mathematics measurement and psychophysics. Handbook of experimental psychology"},{"issue":"106","key":"1160_CR2","first-page":"970","volume":"96","author":"J Vargas Mu\u00f1oz","year":"2019","unstructured":"Vargas Mu\u00f1oz J, Gon\u00e7alves MA, Dias Z et al (2019) Hierarchical clustering-based graphs for large scale approximate nearest neighbor search. Pattern Recogn 96(106):970","journal-title":"Pattern Recogn"},{"key":"1160_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.patcog.2017.09.008","volume":"74","author":"Y Qin","year":"2018","unstructured":"Qin Y, Yu ZL, Wang CD et al (2018) A novel clustering method based on hybrid k-nearest-neighbor graph. Pattern Recogn 74:1\u201314","journal-title":"Pattern Recogn"},{"issue":"107","key":"1160_CR4","first-page":"001","volume":"97","author":"Y Kim","year":"2020","unstructured":"Kim Y, Do H, Kim SB (2020) Outer-points shaver: robust graph-based clustering via node cutting. Pattern Recogn 97(107):001","journal-title":"Pattern Recogn"},{"issue":"108","key":"1160_CR5","first-page":"177","volume":"121","author":"J Xia","year":"2022","unstructured":"Xia J, Zhang J, Wang Y et al (2022) WC-KNNG-PC: watershed clustering based on k-nearest-neighbor graph and Pauta criterion. Pattern Recogn 121(108):177","journal-title":"Pattern Recogn"},{"issue":"1","key":"1160_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover T, Hart P (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21\u201327","journal-title":"IEEE Trans Inf Theory"},{"key":"1160_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39964-3_62","volume-title":"On the move to meaningful internet systems 2003: CoopIS, DOA, and ODBASE. OTM 2003. Lecture Notes in Computer Science, vol 2888","author":"G Guo","year":"2003","unstructured":"Guo G, Wang H, Bell D, Bi Y, Greer K (2003) KNN model-based approach in classification. In: Meersman R, Tari Z, Schmidt DC (eds) On the move to meaningful internet systems 2003: CoopIS, DOA, and ODBASE. OTM 2003. Lecture Notes in Computer Science, vol 2888. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-39964-3_62"},{"key":"1160_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.patrec.2016.05.007","volume":"80","author":"Q Zhu","year":"2016","unstructured":"Zhu Q, Feng J, Huang J (2016) Natural neighbor: a self-adaptive neighborhood method without parameter k. Pattern Recogn Lett 80:30\u201336","journal-title":"Pattern Recogn Lett"},{"issue":"101","key":"1160_CR9","first-page":"504","volume":"91","author":"LT Li","year":"2020","unstructured":"Li LT, Xiong ZY, Dai QZ et al (2020) A novel graph-based clustering method using noise cutting. Inf Syst 91(101):504","journal-title":"Inf Syst"},{"issue":"1","key":"1160_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TBDATA.2019.2908178","volume":"7","author":"D Yan","year":"2021","unstructured":"Yan D, Wang Y, Wang J et al (2021) K-nearest neighbor search by random projection forests. IEEE Trans Big Data 7(1):147\u2013157","journal-title":"IEEE Trans Big Data"},{"issue":"9","key":"1160_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"key":"1160_CR12","doi-asserted-by":"crossref","unstructured":"Tarjan R (1971) Depth-first search and linear graph algorithms. In: 12th Annual symposium on switching and automata theory (SWAT 1971), pp 114\u2013121","DOI":"10.1109\/SWAT.1971.10"},{"key":"1160_CR13","unstructured":"MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proc. Fifth Berkeley Sympos. Math. Statist. and probability (Berkeley, Calif., 1965\/66). Univ. California Press, Berkeley, Calif., pp Vol. I: Statistics, pp 281\u2013297"},{"key":"1160_CR14","unstructured":"Ester M, Kriegel H, Sander J et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han J, Fayyad UM (eds) Proceedings of the second international conference on knowledge discovery and data mining (KDD-96), Portland, Oregon, USA. AAAI Press, pp 226\u2013231"},{"key":"1160_CR15","doi-asserted-by":"crossref","unstructured":"Ankerst M, Breunig MM, Kriegel H et al (1999) OPTICS: ordering points to identify the clustering structure. In: Delis A, Faloutsos C, Ghandeharizadeh S (eds) SIGMOD 1999, Proceedings ACM SIGMOD international conference on management of data, June 1\u20133, 1999. ACM Press, Philadelphia, Pennsylvania, USA, pp 49\u201360","DOI":"10.1145\/304181.304187"},{"issue":"5814","key":"1160_CR16","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science (New York, NY) 315(5814):972\u2013976","journal-title":"Science (New York, NY)"},{"key":"1160_CR17","unstructured":"Ng AY, Jordan MI, Weiss Y (2001) On spectral clustering: analysis and an algorithm. In: Proceedings of the 14th international conference on neural information processing systems: natural and synthetic, NIPS\u201901. MIT Press, Cambridge, pp 849\u2013856"},{"key":"1160_CR18","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf B, Platt J, Hofmann T (2007) A local learning approach for clustering, pp 1529\u20131536","DOI":"10.7551\/mitpress\/7503.003.0196"},{"key":"1160_CR19","doi-asserted-by":"crossref","unstructured":"McInnes L, Healy J (2017) Accelerated hierarchical density based clustering. In: 2017 IEEE International conference on data mining workshops (ICDMW), pp 33\u201342","DOI":"10.1109\/ICDMW.2017.12"},{"key":"1160_CR20","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh NX, Epps J, Bailey J (2010) Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J Mach Learn Res 11:2837\u20132854","journal-title":"J Mach Learn Res"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-023-01160-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-023-01160-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-023-01160-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T14:05:46Z","timestamp":1690034746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-023-01160-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,12]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1160"],"URL":"https:\/\/doi.org\/10.1007\/s10044-023-01160-0","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"type":"print","value":"1433-7541"},{"type":"electronic","value":"1433-755X"}],"subject":[],"published":{"date-parts":[[2023,4,12]]},"assertion":[{"value":"29 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2023","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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}