{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T15:29:57Z","timestamp":1777735797461,"version":"3.51.4"},"reference-count":36,"publisher":"SAGE Publications","issue":"5-6","license":[{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2024,10,24]]},"abstract":"<jats:p>\n                    Instance-Based Learning, such as the k Nearest Neighbor (kNN), offers a straightforward and effective solution for text classification. However, as a lazy learner, kNN\u2019s performance heavily relies on the quality and quantity of training instances, often leading to time and space inefficiencies. This challenge has spurred the development of instance-reduction techniques aimed at retaining essential instances and discarding redundant ones. While such trimming optimizes computational demands, it might adversely affect classification accuracy. This study introduces the novel Selective Learning Vector Quantization (SLVQ) algorithm, specifically designed to enhance the performance of datasets reduced through such techniques. Unlike traditional LVQ algorithms that employ random vector weights (codebook vectors), SLVQ utilizes instances selected by the reduction algorithm as the initial weight vectors. Importantly, as these instances often contain nominal values, SLVQ modifies the\n                    <jats:italic>distances<\/jats:italic>\n                    between these nominal values, rather than modifying the values themselves, aiming to improve their representation of the training set. This approach is crucial because nominal attributes are common in real-world datasets and require effective distance measures, such as the Value Difference Measure (VDM), to handle them properly. Therefore, SLVQ adjusts the VDM distances between nominal values, instead of altering the attribute values of the codebook vectors. Hence, the innovation of the SLVQ approach lies in its integration of instance reduction techniques for selecting initial codebook vectors and its effective handling of nominal attributes. Our experiments, conducted on 17 text classification datasets with four different instance reduction algorithms, confirm SLVQ\u2019s effectiveness. It significantly enhances the kNN\u2019s classification accuracy of reduced datasets. In our empirical study, the SLVQ method improved the performance of these datasets, achieving average classification accuracies of 82.55%, 84.07%, 78.54%, and 83.18%, compared to the average accuracies of 76.25%, 79.62%, 66.54%, and 78.19% achieved by non-fine-tuned datasets, respectively.\n                  <\/jats:p>","DOI":"10.3233\/jifs-235290","type":"journal-article","created":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T13:59:09Z","timestamp":1714139949000},"page":"11353-11366","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["A selective LVQ algorithm for improving instance reduction techniques and its application for text classification"],"prefix":"10.1177","volume":"46","author":[{"given":"Rafa","family":"Hayel","sequence":"first","affiliation":[{"name":"Department of Computer Science, College of Computerand Information Sciences, King Saud University, Riyadh, SaudiArabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalil","family":"El Hindi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, College of Computerand Information Sciences, King Saud University, Riyadh, SaudiArabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manar","family":"Hosny","sequence":"additional","affiliation":[{"name":"Department of Computer Science, College of Computerand Information Sciences, King Saud University, Riyadh, SaudiArabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rawan","family":"Alharbi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, College of Computerand Information Sciences, King Saud University, Riyadh, SaudiArabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2024,4,24]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","unstructured":"AngiulliF. Fast condensed nearest neighbor rule. In: Proceedings of the 22nd international conference on Machine learning [Internet]. Bonn Germany: ACM Press; 2005 [cited 2022 Jun 25]. p. 25\u201332. Available from: http:\/\/portal.acm.org\/citation.cfm?doid=1102351.1102355.","DOI":"10.1145\/1102351.1102355"},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.knosys.2016.05.056","article-title":"Instance selection oflinear complexity for big data","volume":"107","author":"Arnaiz-Gonz\u00e1lez \u00c1.","year":"2016","unstructured":"Arnaiz-Gonz\u00e1lez\u00c1., D\u00edez-PastorJ.F., Rodr\u00edguezJ.J. and Garc\u00eda-OsorioC., Instance selection oflinear complexity for big data, Knowledge-Based Systems 107 (2016), 83\u201395.","journal-title":"Knowledge-Based Systems"},{"issue":"11","key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"3933","DOI":"10.3390\/app10113933","article-title":"Comparison of instance selection and construction methods with various classifiers","volume":"10","author":"Blachnik M.","year":"2020","unstructured":"BlachnikM., KordosM., Comparison of instance selection and construction methods with various classifiers, Applied Sciences 10(11) (2020), 3933","journal-title":"Applied Sciences"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"issue":"13","key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3582000","article-title":"A comparative survey of instance selection methodsapplied to non-neural and transformer-based text classification","volume":"55","author":"Cunha W.","year":"2023","unstructured":"CunhaW., ViegasF., Fran\u00c7aC., RosaT., RochaL., Gon\u00e7alves,M.A., A comparative survey of instance selection methodsapplied to non-neural and transformer-based text classification, ACM Comput Surv. 55(13s) (2023), 1\u201352.","journal-title":"ACM Comput Surv."},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017197"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-130565"},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2020\/4717984","article-title":"Improved distance functions for instance-based text classification. MacLennan BJ, editor","volume":"22","author":"El Hindi K.","year":"2020","unstructured":"El HindiK., Abu ShawarB., AljulaidanR., AlsalamnH., Improved distance functions for instance-based text classification. MacLennan BJ, editor, Computational Intelligence and Neuroscience 22 (2020), 1\u201310.","journal-title":"Computational Intelligence and Neuroscience"},{"key":"e_1_3_2_10_2","unstructured":"FayyadU. IraniK. Multi-interval discretization of continuous-valued attributes for classification learning Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93) (1993) 1022\u20137."},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.142"},{"issue":"3","key":"e_1_3_2_12_2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1972.1054809","article-title":"The reduced nearest neighbor rule","volume":"18","author":"Gates G.","year":"1972","unstructured":"GatesG., The reduced nearest neighbor rule, IEEE Trans Inform Theory 18(3) (1972), 431\u20133.","journal-title":"IEEE Trans Inform Theory"},{"key":"e_1_3_2_13_2","first-page":"451","article-title":"Metric learning by collapsing classes","volume":"18","author":"Globerson A.","year":"2005","unstructured":"GlobersonA., RoweisS.T., Metric learning by collapsing classes, Advances in Neural Information Processing Systems 18 (2005), 451\u20138.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"HanE.H.S. KarypisG. Centroid-based document classification: Analysis and experimental results. In: European conference on principles of data mining and knowledge discovery. Springer; 2000. p. 424\u201331.","DOI":"10.1007\/3-540-45372-5_46"},{"issue":"3","key":"e_1_3_2_15_2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","article-title":"The condensed nearest neighbor rule","volume":"14","author":"Hart P.","year":"1968","unstructured":"HartP., The condensed nearest neighbor rule, IEEE Trans Inform Theory 14(3) (1968), 515\u20136.","journal-title":"IEEE Trans Inform Theory"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.01.021"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(88)90020-2"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2012.09.018"},{"key":"e_1_3_2_19_2","doi-asserted-by":"crossref","unstructured":"KohonenT. Improved versions of learning vector quantization. In: 1990 IJCNN International Joint Conference on Neural Networks [Internet]. San Diego CA USA: IEEE; 1990 [cited 2022 Jul 27]. p. 545\u201350 vol.1. Available from: http:\/\/ieeexplore.ieee.org\/document\/5726582\/.","DOI":"10.1109\/IJCNN.1990.137622"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.3390\/info10040150"},{"issue":"4","key":"e_1_3_2_21_2","first-page":"1523","article-title":"Three new instanceselection methods based on local sets: A comparative study withseveral approaches from a bi-objective perspective","volume":"48","author":"Leyva E.","year":"2015","unstructured":"LeyvaE., Gonz\u00e1lezA., P\u00e9rezR., Three new instanceselection methods based on local sets: A comparative study withseveral approaches from a bi-objective perspective, PatternRecognition 48(4) (2015), 1523\u201337.","journal-title":"PatternRecognition"},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"113297","DOI":"10.1016\/j.eswa.2020.113297","article-title":"A new approach for instance selection: Algorithms, evaluation, and comparisons","volume":"149","author":"Malhat M.","year":"2020","unstructured":"MalhatM., MenshawyM.E., MousaH., SisiA.E., A new approach for instance selection: Algorithms, evaluation, and comparisons, Expert Systems with Applications 149 (2020), 113297.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00521-013-1535-3","article-title":"A review of learning vectorquantization classifiers,","volume":"25","author":"Nova D.","year":"2014","unstructured":"NovaD., Est\u00e9vezP.A., A review of learning vectorquantization classifiers,, Neural Comput & Applic. 25((3\u20134)) (2014), 511\u201324.","journal-title":"Neural Comput & Applic."},{"issue":"2","key":"e_1_3_2_24_2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10044-008-0142-x","article-title":"A new fast prototype selection method basedon clustering","volume":"13","author":"Olvera-L\u00f3pez J.A.","year":"2010","unstructured":"Olvera-L\u00f3pezJ.A., Carrasco-OchoaJ.A., Mart\u00ednez-TrinidadJ.F., A new fast prototype selection method basedon clustering, Pattern Anal Applic. 13(2) (2010), 131\u201341.","journal-title":"Pattern Anal Applic."},{"issue":"2","key":"e_1_3_2_25_2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10044-008-0142-x","article-title":"A new fast prototype selection method basedon clustering","volume":"13","author":"Olvera-L\u00f3pez J.A.","year":"2010","unstructured":"Olvera-L\u00f3pezJ.A., Carrasco-OchoaJ.A., Mart\u00ednez-TrinidadJ.F., A new fast prototype selection method basedon clustering, Pattern Anal Applic. 13(2) (2010), 131\u201341.","journal-title":"Pattern Anal Applic."},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","unstructured":"OrlinskiM. JankowskiN.O. (m log m) instance selection algorithms\u2014RR-DROPs. In: 2020 International Joint Conference on Neural Networks (IJCNN) [Internet]. Glasgow United Kingdom: IEEE; 2020 [cited 2022 Jun 24]. p. 1\u20138. Available from: https:\/\/ieeexplore.ieee.org\/document\/9207158\/.","DOI":"10.1109\/IJCNN48605.2020.9207158"},{"issue":"4","key":"e_1_3_2_27_2","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/S0031-3203(02)00119-X","article-title":"Finding representative patterns with ordered projections","volume":"36","author":"Riquelme J.C.","year":"2003","unstructured":"RiquelmeJ.C., Aguilar-RuizJ.S., ToroM., Finding representative patterns with ordered projections, Pattern Recognition 36(4) (2003), 1009\u201318.","journal-title":"Pattern Recognition"},{"issue":"6","key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1975.1055464","article-title":"An algorithm for a selective nearest neighbor decision rule","volume":"21","author":"Ritter G.","year":"1975","unstructured":"RitterG., WoodruffH., LowryS., IsenhourT., An algorithm for a selective nearest neighbor decision rule, IEEE Trans Inform Theory 21(6) (1975), 665\u20139.","journal-title":"IEEE Trans Inform Theory"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/7902.7906"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.2307\/2331554"},{"issue":"6","key":"e_1_3_2_31_2","first-page":"769","article-title":"Two modifications of CNN","volume":"6","author":"Tomek I.","year":"1976","unstructured":"TomekI., Two modifications of CNN, IEEE Trans Syst, Man, Cybern. 6(6) (1976), 769\u201372.","journal-title":"IEEE Trans Syst, Man, Cybern."},{"issue":"1","key":"e_1_3_2_32_2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TSMCC.2010.2103939","article-title":"A tomyaxon and experimental study on prototype generation for nearest neighbor classification","volume":"42","author":"Triguero I.","year":"2012","unstructured":"TrigueroI., DerracJ., GarciaS., HerreraF., A tomyaxon and experimental study on prototype generation for nearest neighbor classification, IEEE Trans Syst, Man, Cybern C. 42(1) (2012), 86\u2013100.","journal-title":"IEEE Trans Syst, Man, Cybern C."},{"issue":"3","key":"e_1_3_2_33_2","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","article-title":"Asymptotic properties of nearest neighbor rules using edited data","volume":"2","author":"Wilson D.L.","year":"1972","unstructured":"WilsonD.L., Asymptotic properties of nearest neighbor rules using edited data, IEEE Trans Syst, Man, Cybern.SMC-2(3) (1972), 408\u201321.","journal-title":"IEEE Trans Syst, Man, Cybern"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.346","article-title":"Improved Heterogeneous Distance Functions","volume":"6","author":"Wilson D.R.","year":"1997","unstructured":"WilsonD.R., MartinezT.R., Improved Heterogeneous Distance Functions, Jair 6 (1997), 1\u201334.","journal-title":"Jair"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007626913721"},{"key":"e_1_3_2_36_2","unstructured":"WittenI.H. FrankE. HallM.A. PalC.J. Data mining practical machine learning tools and techniques. 4th ed. San Francisco CA USA: Morgan Kaufmann Publishers Inc.; 2016."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-235290","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-235290","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-235290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:25Z","timestamp":1777455805000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-235290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,24]]},"references-count":36,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2024,10,24]]}},"alternative-id":["10.3233\/JIFS-235290"],"URL":"https:\/\/doi.org\/10.3233\/jifs-235290","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1924987\/v1","asserted-by":"object"}]},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,24]]}}}