{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:28:39Z","timestamp":1775240919483,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62306050"],"award-info":[{"award-number":["62306050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11227-023-05885-x","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T04:09:44Z","timestamp":1709006984000},"page":"13096-13123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A heuristic hybrid instance reduction approach based on adaptive relative distance and k-means clustering"],"prefix":"10.1007","volume":"80","author":[{"given":"Junnan","family":"Li","sequence":"first","affiliation":[]},{"given":"Qing","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Shuang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"issue":"9","key":"5885_CR1","doi-asserted-by":"publisher","first-page":"3501","DOI":"10.1109\/TFUZZ.2021.3117450","volume":"30","author":"H Zhu","year":"2022","unstructured":"Zhu H, Wang X, Wang R (2022) Fuzzy monotonic K-nearest neighbor versus monotonic fuzzy K-nearest neighbor. IEEE Trans Fuzzy Syst 30(9):3501\u20133513","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"5885_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117159","volume":"201","author":"Y Ma","year":"2022","unstructured":"Ma Y, Huang R, Yan M, Li G, Wang T (2022) Attention-based local mean K-nearest centroid neighbor classifier. Expert Syst Appl 201:117159","journal-title":"Expert Syst Appl"},{"key":"5885_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.eswa.2016.09.031","volume":"67","author":"Z Pan","year":"2017","unstructured":"Pan Z, Wang Y, Ku W (2017) A new k-harmonic nearest neighbor classifier based on the multi-local means. Expert Syst Appl 67:115\u2013125","journal-title":"Expert Syst Appl"},{"key":"5885_CR4","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.patrec.2020.10.005","volume":"140","author":"MM Kumbure","year":"2020","unstructured":"Kumbure MM, Luukka P, Collan M (2020) A new fuzzy k-nearest neighbor classifier based on the Bonferroni mean. Pattern Recognit Lett 140:172\u2013178","journal-title":"Pattern Recognit Lett"},{"issue":"9","key":"5885_CR5","doi-asserted-by":"publisher","first-page":"2084","DOI":"10.1109\/TPAMI.2018.2853161","volume":"41","author":"JP Heo","year":"2019","unstructured":"Heo JP, Lin Z, Yoon SE (2019) Distance encoded product quantization for approximate K-nearest neighbor search in high-dimensional space. IEEE Trans Pattern Anal Mach Intell 41(9):2084\u20132097","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"7","key":"5885_CR6","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1109\/TNNLS.2012.2198832","volume":"23","author":"K Nikolaidis","year":"2012","unstructured":"Nikolaidis K, Rodriguez-Martinez E, Goulermas JY, Wu QH (2012) Spectral graph optimization for instance reduction. IEEE Trans Neural Netw Learn Syst 23(7):1169\u20131175","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"1","key":"5885_CR7","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/TKDE.2014.2324590","volume":"27","author":"J Xuan","year":"2015","unstructured":"Xuan J et al (2015) Towards effective bug triage with software data reduction techniques. IEEE Trans Knowl Data Eng 27(1):264\u2013280","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5885_CR8","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"3","author":"DL Wilson","year":"1972","unstructured":"Wilson DL (1972) Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans Syst Man Cybern SMC-2 3:408\u2013421","journal-title":"IEEE Trans Syst Man Cybern SMC-2"},{"issue":"3","key":"5885_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"14","author":"P Hart","year":"1968","unstructured":"Hart P (1968) The condensed nearest neighbor rule. IEEE Trans Inf Theory 14(3):515\u2013516","journal-title":"IEEE Trans Inf Theory"},{"key":"5885_CR10","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1007\/s10489-019-01598-y","volume":"50","author":"J Li","year":"2020","unstructured":"Li J, Zhu Q, Wu Q (2020) A parameter-free hybrid instance selection algorithm based on local sets with natural neighbors. Appl Intell 50:1527\u20131541","journal-title":"Appl Intell"},{"issue":"7","key":"5885_CR11","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1016\/S0167-8655(02)00225-8","volume":"24","author":"J S\u00e1nchez","year":"2003","unstructured":"S\u00e1nchez J, Barandela R, Marques A, Alejo R, Badenas J (2003) Analysis of new techniques to obtain quality training sets. Pattern Recognit Lett 24(7):1015\u20131022","journal-title":"Pattern Recognit Lett"},{"issue":"22","key":"5885_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.neucom.2016.12.040","volume":"230","author":"L Yang","year":"2017","unstructured":"Yang L, Zhu Q, Huang J, Cheng D (2017) Adaptive edited natural neighbor algorithm. Neurocomputing 230(22):427\u2013433","journal-title":"Neurocomputing"},{"key":"5885_CR13","first-page":"997","volume":"9","author":"E Marchiori","year":"2008","unstructured":"Marchiori E (2008) Hit miss networks with applications to instance selection. J Mach Learn Res 9:997\u20131017","journal-title":"J Mach Learn Res"},{"issue":"3","key":"5885_CR14","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1016\/j.patcog.2010.08.014","volume":"44","author":"K Nikolaidis","year":"2011","unstructured":"Nikolaidis K, Goulermas JY, Wu QH (2011) A class boundary preserving algorithm for data condensation. Pattern Recognit 44(3):704\u2013715","journal-title":"Pattern Recognit"},{"issue":"5","key":"5885_CR15","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.patrec.2011.07.019","volume":"33","author":"JR Rico-Juan","year":"2012","unstructured":"Rico-Juan JR, I\u00f1esta JM (2012) New rank methods for reducing the size of the training set using the nearest neighbor rule. Pattern Recognit Lett 33(5):654\u2013660","journal-title":"Pattern Recognit Lett"},{"issue":"2","key":"5885_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.patrec.2009.09.022","volume":"31","author":"CG Vallejo","year":"2010","unstructured":"Vallejo CG, Troyano JA, Ortega FJ (2010) InstanceRank: bringing order to datasets. Pattern Recognit Lett 31(2):131\u2013142","journal-title":"Pattern Recognit Lett"},{"issue":"1","key":"5885_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.patcog.2012.07.007","volume":"46","author":"P Hernandezleal","year":"2013","unstructured":"Hernandezleal P, Carrascoochoa JA, Mart\u00ednezTrinidad JF, Olveralopez JA (2013) Instancerank based on borders for instance selection. Pattern Recognit 46(1):365\u2013375","journal-title":"Pattern Recognit"},{"issue":"3","key":"5885_CR18","first-page":"647","volume":"149","author":"J Li","year":"2015","unstructured":"Li J, Wang Y (2015) A new fast reduction technique based on binary nearest neighbor tree. Neurocomputing 149(3):647\u20131657","journal-title":"Neurocomputing"},{"issue":"17","key":"5885_CR19","doi-asserted-by":"publisher","first-page":"6894","DOI":"10.1016\/j.eswa.2013.06.053","volume":"40","author":"GDC Cavalcanti","year":"2013","unstructured":"Cavalcanti GDC, Ren TI, Pereira CL (2013) ATISA: adaptive threshold-based instance selection algorithm. Expert Syst Appl 40(17):6894\u20136900","journal-title":"Expert Syst Appl"},{"issue":"4","key":"5885_CR20","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1016\/j.patcog.2014.10.001","volume":"48","author":"E Leyva","year":"2015","unstructured":"Leyva E, Antonio G, Ra\u00fal P (2015) Three new instance selection methods based on local sets: a comparative study with several approaches from a bi-objective perspective. Pattern Recognit 48(4):1523\u20131537","journal-title":"Pattern Recognit"},{"key":"5885_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.asoc.2018.05.029","volume":"70","author":"L Yang","year":"2018","unstructured":"Yang L, Zhu Q, Huang J, Cheng D, Wu Q, Hong X (2018) Natural neighborhood graph-based instance reduction algorithm without parameters. Appl Soft Comput 70:279\u2013287","journal-title":"Appl Soft Comput"},{"key":"5885_CR22","doi-asserted-by":"publisher","first-page":"13235","DOI":"10.1007\/s00500-019-03865-z","volume":"23","author":"L Yang","year":"2019","unstructured":"Yang L, Zhu Q, Huang J, Cheng D, Wu Q, Hong X (2019) Constraint nearest neighbor for instance reduction. Soft Comput 23:13235\u201313245","journal-title":"Soft Comput"},{"issue":"9","key":"5885_CR23","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1109\/TKDE.2019.2911582","volume":"23","author":"I Khan","year":"2020","unstructured":"Khan I, Luo Z, Huang JZ, Shahzad W (2020) Variable weighting in fuzzy k-means clustering to determine the number of clusters. IEEE Trans Knowl Data Eng 23(9):1838\u20131853","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"5885_CR24","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 Recognit Lett 80(1):30\u201336","journal-title":"Pattern Recognit Lett"},{"key":"5885_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ab.2020.113592","volume":"593","author":"Y Zhu","year":"2020","unstructured":"Zhu Y, Jia C, Li G, Song J (2020) Inspector: a lysine succinylation predictor based on edited nearest-neighbor undersampling and adaptive synthetic oversampling. Anal Biochem 593:113592","journal-title":"Anal Biochem"},{"key":"5885_CR26","doi-asserted-by":"publisher","first-page":"109183","DOI":"10.1016\/j.patcog.2022.109183","volume":"136","author":"Y Aziz","year":"2023","unstructured":"Aziz Y, Memon KH (2023) Fast geometrical extraction of nearest neighbors from multi-dimensional data. Pattern Recognit 136:109183","journal-title":"Pattern Recognit"},{"issue":"1","key":"5885_CR27","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1109\/TVCG.2021.3114865","volume":"28","author":"Y Zhao","year":"2022","unstructured":"Zhao Y, Wang Y, Zhang J, Fu CW, Xu M, Moritz D (2022) KD-Box: line-segment-based KD-tree for interactive exploration of large-scale time-series data. IEEE Trans Vis Comput Graph 28(1):890\u2013900","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"4","key":"5885_CR28","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1109\/TKDE.2018.2842019","volume":"31","author":"M Mohammadi","year":"2019","unstructured":"Mohammadi M, Hofman W, Tan YH (2019) A comparative study of ontology matching systems via inferential statistics. IEEE Trans Knowl Data Eng 31(4):615\u2013628","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5885_CR29","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.ins.2023.01.091","volume":"635","author":"A Trabelsi","year":"2023","unstructured":"Trabelsi A, Elouedi Z, Lefevre E (2023) An ensemble classifier through rough set reducts for handling data with evidential attributes. Inf Sci 635:414\u2013429","journal-title":"Inf Sci"}],"updated-by":[{"DOI":"10.1007\/s11227-024-06139-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000}}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05885-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05885-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05885-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T06:49:08Z","timestamp":1717483748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05885-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":29,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["5885"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05885-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2905503\/v1","asserted-by":"object"}]},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"assertion":[{"value":"26 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11227-024-06139-0","URL":"https:\/\/doi.org\/10.1007\/s11227-024-06139-0","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}