{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T04:22:41Z","timestamp":1773116561205,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:00:00Z","timestamp":1772755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T00:00:00Z","timestamp":1773014400000},"content-version":"vor","delay-in-days":3,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"BNBU","award":["UICR0400046-21CTL"],"award-info":[{"award-number":["UICR0400046-21CTL"]}]},{"name":"BNBU","award":["2022B1212010006"],"award-info":[{"award-number":["2022B1212010006"]}]},{"name":"BNBU","award":["UIC R0400001-22"],"award-info":[{"award-number":["UIC R0400001-22"]}]},{"name":"BNBU","award":["R201912 and R202010"],"award-info":[{"award-number":["R201912 and R202010"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s44443-026-00540-w","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:06:05Z","timestamp":1772820365000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From distance to gravitation: A new perspective for improving classification, clustering, and sampling"],"prefix":"10.1007","volume":"38","author":[{"given":"Junkai","family":"Lin","sequence":"first","affiliation":[]},{"given":"Jiarui","family":"Cao","sequence":"additional","affiliation":[]},{"given":"A. M.","family":"Elsawah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,6]]},"reference":[{"issue":"3","key":"540_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1090\/S0002-9947-1950-0051437-7","volume":"68","author":"N Aronszajn","year":"1950","unstructured":"Aronszajn N (1950) Theory of reproducing kernels. Trans Am Math Soc 68(3):337\u2013404. https:\/\/doi.org\/10.1090\/S0002-9947-1950-0051437-7","journal-title":"Trans Am Math Soc"},{"key":"540_CR2","volume-title":"k-means++: The advantages of careful seeding","author":"D Arthur","year":"2006","unstructured":"Arthur D, Vassilvitskii S (2006) k-means++: The advantages of careful seeding. Technical report, Stanford"},{"issue":"Nov","key":"540_CR3","first-page":"463","volume":"3","author":"PL Bartlett","year":"2002","unstructured":"Bartlett PL, Mendelson S (2002) Rademacher and gaussian complexities: Risk bounds and structural results. J Mach Learn Res 3(Nov):463\u2013482","journal-title":"J Mach Learn Res"},{"key":"540_CR4","first-page":"2399","volume":"7","author":"M Belkin","year":"2006","unstructured":"Belkin M, Niyogi P, Sindhwani V (2006) Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. J Mach Learn Res 7:2399\u20132434","journal-title":"J Mach Learn Res"},{"key":"540_CR5","volume-title":"Matrix Analysis","author":"R Bhatia","year":"2013","unstructured":"Bhatia R (2013) Matrix Analysis, vol 169. Springer, Berlin, Heidelberg"},{"key":"540_CR6","doi-asserted-by":"crossref","unstructured":"Chapelle O, Sch\u00f6lkopf B, Zien A (eds) (2006) Semi-Supervised Learning. MIT Press, Cambridge, MA","DOI":"10.7551\/mitpress\/9780262033589.001.0001"},{"issue":"2","key":"540_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.3847\/1538-3881\/ab2634","volume":"158","author":"B Cherinka","year":"2019","unstructured":"Cherinka B, Andrews BH, S\u00e1nchez-Gallego J, Brownstein J, Argudo-Fern\u00e1ndez M, Blanton M, Bundy K, Jones A, Masters K, Law DR et al (2019) Marvin: A tool kit for streamlined access and visualization of the sdss-iv manga data set. Astron J 158(2):74","journal-title":"Astron J"},{"key":"540_CR8","unstructured":"Claesen M, De Smet F, Suykens JA, De Moor B (2014) Fast prediction with svm models containing rbf kernels. arXiv:1403.0736"},{"issue":"3","key":"540_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273\u2013297. https:\/\/doi.org\/10.1007\/BF00994018","journal-title":"Mach Learn"},{"key":"540_CR10","first-page":"224","volume":"2","author":"DL Davies","year":"2009","unstructured":"Davies DL, Bouldin DW (2009) A cluster separation measure. IEEE Trans Pattern Anal Mach Intell 2:224\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"540_CR11","doi-asserted-by":"publisher","first-page":"105785","DOI":"10.1016\/j.cageo.2024.105785","volume":"195","author":"M Daviran","year":"2025","unstructured":"Daviran M, Maghsoudi A, Ghezelbash R (2025) Optimized ai-mpm: Application of pso for tuning the hyperparameters of svm and rf algorithms. Comput Geosci 195:105785. https:\/\/doi.org\/10.1016\/j.cageo.2024.105785","journal-title":"Comput Geosci"},{"issue":"2","key":"540_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1046\/j.1365-8711.2001.04375.x","volume":"324","author":"W Dehnen","year":"2001","unstructured":"Dehnen W (2001) Towards optimal softening in three-dimensional n-body codes: I. minimizing the force error. Mon Not R Astron Soc 324(2):273\u2013291. https:\/\/doi.org\/10.1046\/j.1365-8711.2001.04375.x","journal-title":"Mon Not R Astron Soc"},{"key":"540_CR13","first-page":"224","volume":"1","author":"D Dl","year":"1979","unstructured":"Dl D (1979) A cluster separation measure. IEEE Trans Pattern Anal Mach Intell 1:224\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"11","key":"540_CR14","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1080\/03610918.2019.1628988","volume":"50","author":"AM Elsawah","year":"2021","unstructured":"Elsawah AM, Fang KT, Deng YH (2021) Some interesting behaviors of good lattice point sets. Commun Stat-Simul Comput 50(11):3650\u20133668. https:\/\/doi.org\/10.1080\/03610918.2019.1628988","journal-title":"Commun Stat-Simul Comput"},{"key":"540_CR15","doi-asserted-by":"publisher","unstructured":"Elsawah AM, Laala B, Vishwakarma GK (2026) Input-output space-filling representative points for clustering, modeling, and estimation. J Comput Appl Math 116928. https:\/\/doi.org\/10.1016\/j.cam.2025.116928","DOI":"10.1016\/j.cam.2025.116928"},{"key":"540_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s40314-023-02519-z","volume":"43","author":"AM Elsawah","year":"2024","unstructured":"Elsawah AM, Wang YA, Chen Z, Tank F (2024) A sequential designing-modeling technique when the input factors are not equally important. Comput Appl Math 43:9. https:\/\/doi.org\/10.1007\/s40314-023-02519-z","journal-title":"Comput Appl Math"},{"key":"540_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2023.115526","volume":"438","author":"AM Elsawah","year":"2024","unstructured":"Elsawah AM, Wang YA, Tank F (2024) Minimum energy representative points. J Comput Appl Math 438:115526. https:\/\/doi.org\/10.1016\/j.cam.2023.115526","journal-title":"J Comput Appl Math"},{"key":"540_CR18","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s11424-018-7173-1","volume":"32","author":"AM Elsawah","year":"2019","unstructured":"Elsawah AM (2019) Designing uniform computer sequential experiments with mixture levels using lee discrepancy. J Syst Sci Complexity 32:681\u2013708. https:\/\/doi.org\/10.1007\/s11424-018-7173-1","journal-title":"J Syst Sci Complexity"},{"key":"540_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2025.116902","volume":"473","author":"AM Elsawah","year":"2026","unstructured":"Elsawah AM (2026) Constructing orthogonal maximin distance uniform projection designs for computer experiments. J Comput Appl Math 473:116902. https:\/\/doi.org\/10.1016\/j.cam.2025.116902","journal-title":"J Comput Appl Math"},{"key":"540_CR20","unstructured":"Fedesoriano (2021a) Fedesoriano (2021a) Stellar Classification Dataset SDSS17. https:\/\/www.kaggle.com\/datasets\/fedesoriano\/stellar-classification-dataset-sdss17 Accessed 19 Jun 2025"},{"key":"540_CR21","unstructured":"Fedesoriano (2021b) California Housing Prices Data with Extra Features. https:\/\/www.kaggle.com\/datasets\/fedesoriano\/california-housing-prices-data-extra-features Accessed 19 Jun 2025"},{"key":"540_CR22","doi-asserted-by":"crossref","unstructured":"Hernquist L, Katz N (1989) Treesph-a unification of sph with the hierarchical tree method. Astrophysical journal supplement series (ISSN 0067\u20130049), vol 70, pp 419\u2013446. Research supported by the San Diego Supercomputer Center, Pittsburgh Supercomputer Center, and New Jersey High Technology Grant. 70, 419\u2013446 (1989)","DOI":"10.1086\/191344"},{"key":"540_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham NJ (2002) Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia, PA","edition":"2"},{"key":"540_CR24","unstructured":"Hsu C-W, Chang C-C, Lin C-J, et al (2003) A practical guide to support vector classification"},{"key":"540_CR25","unstructured":"Joachims T (1999) Transductive inference for text classification using support vector machines. In: Proceedings of the 16th international conference on machine learning (ICML), pp 200\u2013209"},{"issue":"1","key":"540_CR26","first-page":"42","volume":"1","author":"NK Kaur","year":"2014","unstructured":"Kaur NK, Kaur U, Singh D (2014) K-medoid clustering algorithm-a review. Int J Comput Appl Technol 1(1):42\u201345","journal-title":"Int J Comput Appl Technol"},{"key":"540_CR27","doi-asserted-by":"publisher","unstructured":"Ke X, Fang KT, Elsawah AM, Lin Y (2023) New non-isomorphic detection methods for orthogonal designs. Communications\u00a0in Statistics-Simulation and Computation 52(1):27\u201342. https:\/\/doi.org\/10.1080\/03610918.2020.1844895","DOI":"10.1080\/03610918.2020.1844895"},{"issue":"2","key":"540_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in pcm. IEEE Trans Inf Theory 28(2):129\u2013137. https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans Inf Theory"},{"key":"540_CR29","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th berkeley symposium on mathematical statistics and probability, pp 281\u2013297"},{"issue":"1","key":"540_CR30","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1080\/10618600.2017.1302881","volume":"27","author":"S Mak","year":"2018","unstructured":"Mak S, Joseph VR (2018) Minimax and minimax projection designs using clustering. J Comput Graph Stat 27(1):166\u2013178. https:\/\/doi.org\/10.1080\/10618600.2017.1302881","journal-title":"J Comput Graph Stat"},{"issue":"2","key":"540_CR31","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/00401706.1979.10489755","volume":"21","author":"MD McKay","year":"1979","unstructured":"McKay MD, Beckman RJ, Conover WJ (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21(2):239\u2013245. https:\/\/doi.org\/10.1080\/00401706.1979.10489755","journal-title":"Technometrics"},{"issue":"441\u2013458","key":"540_CR32","first-page":"415","volume":"209","author":"J Mercer","year":"1909","unstructured":"Mercer J (1909) Xvi. functions of positive and negative type, and their connection the theory of integral equations. Philosophical transactions of the royal society of London. Series A Contain Papers Math Phys Charact 209(441\u2013458):415\u2013446","journal-title":"Series A Contain Papers Math Phys Charact"},{"issue":"2","key":"540_CR33","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.measurement.2012.10.024","volume":"46","author":"G Moschioni","year":"2013","unstructured":"Moschioni G, Saggin B, Tarabini M, Hald J, Morkholt J (2013) Use of design of experiments and monte carlo method for instruments optimal design. Measurement 46(2):976\u2013984","journal-title":"Measurement"},{"key":"540_CR34","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.fuel.2018.04.142","volume":"228","author":"A Navid","year":"2018","unstructured":"Navid A, Khalilarya S, Abbasi M (2018) Diesel engine optimization with multi-objective performance characteristics by non-evolutionary nelder-mead algorithm: Sobol sequence and latin hypercube sampling methods comparison in doe process. Fuel 228:349\u2013367","journal-title":"Fuel"},{"issue":"2","key":"540_CR35","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1207\/S15328007SEM0802_7","volume":"8","author":"P Paxton","year":"2001","unstructured":"Paxton P, Curran PJ, Bollen KA, Kirby J, Chen F (2001) Monte carlo experiments: Design and implementation. Struct Equ Model 8(2):287\u2013312","journal-title":"Struct Equ Model"},{"key":"540_CR36","volume-title":"Learning with Kernels","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf B, Smola AJ (2002) Learning with Kernels. MIT Press, Cambridge, MA"},{"key":"540_CR37","volume-title":"Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf B, Smola AJ (2002) Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, Cambridge, MA, Adaptive Computation and Machine Learning"},{"issue":"4","key":"540_CR38","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1080\/09599916.2021.1974413","volume":"38","author":"P Simlai","year":"2021","unstructured":"Simlai P (2021) Predicting owner-occupied housing values using machine learning: An empirical investigation of california census tracts data. J Prop Res 38(4):305\u2013336. https:\/\/doi.org\/10.1080\/09599916.2021.1974413","journal-title":"J Prop Res"},{"issue":"5","key":"540_CR39","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1080\/17538947.2012.713190","volume":"5","author":"JR Townshend","year":"2012","unstructured":"Townshend JR, Masek JG, Huang C, Vermote EF, Gao F, Channan S, Sexton JO, Feng M, Narasimhan R, Kim D et al (2012) Global characterization and monitoring of forest cover using landsat data: opportunities and challenges. Int J Digit Earth 5(5):373\u2013397","journal-title":"Int J Digit Earth"},{"key":"540_CR40","unstructured":"UCI Machine Learning Repository (2021) Forest Cover Type Dataset. https:\/\/www.kaggle.com\/datasets\/uciml\/forest-cover-type-dataset Accessed 19 Jun 2025"},{"key":"540_CR41","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. Adv Neural Inf Process Syst 30"},{"issue":"4","key":"540_CR42","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/MCSE.2023.3342149","volume":"25","author":"J Wang","year":"2023","unstructured":"Wang J (2023) An intuitive tutorial to gaussian process regression. Comput Sci Eng 25(4):4\u201311","journal-title":"Comput Sci Eng"},{"key":"540_CR43","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00362-022-01310-2","volume":"64","author":"LC Weng","year":"2023","unstructured":"Weng LC, Fang KT, Elsawah AM (2023) Degree of isomorphism: a novel criterion for identifying and classifying orthogonal designs. Stat Pap 64:93\u2013116. https:\/\/doi.org\/10.1007\/s00362-022-01310-2","journal-title":"Stat Pap"},{"key":"540_CR44","doi-asserted-by":"crossref","unstructured":"Xiao D, Guo L, Liu W, Hou M (2020) Efficient rcs prediction of the conducting target based on physics-inspired machine learning and experimental design. IEEE Trans Antennas Propag 69(4):2274\u20132289","DOI":"10.1109\/TAP.2020.3027594"},{"issue":"3","key":"540_CR45","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10796-020-09986-3","volume":"23","author":"Z Yang","year":"2021","unstructured":"Yang Z (2021) Vector gravitation clustering networks. Inf Syst Front 23(3):695\u2013707. https:\/\/doi.org\/10.1007\/s10796-020-09986-3","journal-title":"Inf Syst Front"},{"issue":"1","key":"540_CR46","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1093\/mnras\/stz1370","volume":"487","author":"T Zhang","year":"2019","unstructured":"Zhang T, Liao S, Li M, Gao L (2019) The optimal gravitational softening length for cosmological n-body simulations. Mon Not R Astron Soc 487(1):1227\u20131232","journal-title":"Mon Not R Astron Soc"},{"key":"540_CR47","unstructured":"Zhou D, Bousquet O, Lal T, Weston J, Sch\u00f6lkopf B (2003) Learning with local and global consistency. Adv Neural Inf Process Syst 16"},{"key":"540_CR48","unstructured":"Zhu X, Ghahramani Z, Lafferty J.D (2003) Semi-supervised learning using gaussian fields and harmonic functions. In: Proceedings of the 20th international conference on machine learning (ICML-03), pp 912\u2013919"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-026-00540-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00540-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00540-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T15:51:37Z","timestamp":1773071497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-026-00540-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,6]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["540"],"URL":"https:\/\/doi.org\/10.1007\/s44443-026-00540-w","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,6]]},"assertion":[{"value":"8 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"87"}}