پیوندهای مفید
آمار
| تعداد نشریات | 32 |
| تعداد شمارهها | 861 |
| تعداد مقالات | 8,364 |
| تعداد مشاهده مقاله | 53,003,993 |
| تعداد دریافت فایل اصل مقاله | 9,367,012 |
Feature selection via mixed-integer program and supervised infinite feature selection method | ||
| Journal of Mathematical Modeling | ||
| مقاله 7، دوره 13، شماره 2، مرداد 2025، صفحه 341-356 اصل مقاله (177.69 K) | ||
| نوع مقاله: Research Article | ||
| شناسه دیجیتال (DOI): 10.22124/jmm.2024.28684.2557 | ||
| نویسندگان | ||
| Mohammad Noroozi1؛ Maziar Salahi* 1؛ Sadegh Eskandari2 | ||
| 1Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran | ||
| 2Department of Computer Science, Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran | ||
| چکیده | ||
| Feature selection is an important step in data preprocessing, which helps reducing the dimensionality of data and simplifying the models. This process not only reduces the computational complexity of models, but also improves their accuracy by eliminating irrelevant features and noise. The three most widely used approaches for feature selection are filter, wrapper and embedded methods. In this paper, first we review some support vector machine based Mixed-Integer Linear Programming (MILP) models and Supervised Infinite Feature Selection (Inf-FS$_s$) method. Then, we propose three hybrid approaches based on them. The first approach involves solving the relaxed linear model of the underlying MILP model and then solving the MILP model for those features with nonzero weights, namely a smaller MILP. In the second approach, first the Inf-FS$_s$ method is applied to rank the features. Then depending on the features costs, either chooses the top features from the ranked features until budget parameter is reached or solves a knapsack problem to select cost effective features. The third approach applies the first approach to the top $20\%$ of features ranked by Inf-FS$_s$ method. To evaluate the proposed approaches' performance, experiments are conducted on four high-dimensional benchmark datasets for fixed and random features costs. Results demonstrate that using either of the proposed approaches can significantly reduce running time of MILP models with comparable accuracies with the original MILP models. | ||
| کلیدواژهها | ||
| Feature selection؛ Mixed integer linear program؛ Infinite feature selection method؛ Feature cost | ||
| مراجع | ||
|
[1] U. Alon, N. Barkai, D.A. Notterman, A.J. Levine, Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays, Proc. Natl. Acad. Sci. U.S.A 96 (1999) 6745–6750. [2] G.C. Berens, R.L. Houghton, D.C. Seitz, E.R. Ruiz, Gene expression correlates of clinical prostate cancer behavior, Cancer Cell 1 (2002) 203–209. [3] P. Bradley, O. Mangasarian, Feature selection via concave minimization and support vector ma- chines, Proceedings of the Fifteenth International Conference on Machine Learning (ICML), Mor- gan Kaufmann (1998) 82–90. [4] G. Chandrashekar, F. Sahin, A survey on feature selection methods, Comput. Electr. Eng., 40 (2014) 16–28. [5] R.O. Duda, P.E. Hart, D.G. Stork, Pattern Classification, Second Edition, Wiley, 2000. [6] M. Grant, S. Boyd, CVX: MATLAB software for disciplined convex programming, Version 2.1 , March 2017. [7] T.R. Golub, D.K. Slonim, P. Tamayo, C. Huard, M. Gaasenbeek, J.P. Mesirov, H. Coller, M. L. Loh, J. R. Downing, M. A. Caligiuri, C.D. Bloomfield, E.S. Lander, Molecular classification of cancer, Class discovery and class prediction by gene expression monitoring, Science 286 (1999) 531–537. [8] I. Guyon, A. Elisseeff, An introduction to variable and feature selection, J. Mach. Learn. Res. 3 (2003) 1157–1182. [9] I. Guyon, S. Gunn, M. Nikravesh, L.A. Zadeh, Feature Extraction, Foundations and Applications, Springer, 2006. [10] S.F. Hassani Ziabari, S. Eskandari, M. Salahi, CInf-FSS: An efficient infinite feature selection method using K-means clustering to partition large feature spaces, Pattern Anal. Applic. 26 (2023) 1631–1639. [11] M. Labb, L.I. Martnez-Merino, A.M. Rodrguez-Cha, Mixed integer linear programming for feature selection in support vector machine, Discrete Appl. Math. 319 (2018) 1–7. [12] I.G. Lee, Q. Zhang, S.W. Yoon, D. Won, Mixed integer linear programming support vector machine for cost-effective feature selection, Knowl-Based Syst. 193 (2020) 1–6. [13] S. Maldonado, J. Prez, R. Weber, M. Labb, Feature selection for support vector machines via mixed integer linear programming, Inf. Sci. 279 (2014) 163–175. [14] S. Maldonado, R. Weber, J. Basak, Kernel-penalized SVM for feature selection, Inf. Sci 181 (2011) 115–128. [15] G. Roffo, S. Melzi, U. Castellani, A. Vinciarelli, M. Cristani, Infinite feature selection: A graph- based feature filtering approach, IEEE Trans. Pattern Anal. Mach. Intell. 43 (2021) 4396–4410. [16] W. Zhou, L. Zhang, L. Jiao, Linear programming support vector machines, Pattern Recognit. 35 (2002) 2927–2936. | ||
|
آمار تعداد مشاهده مقاله: 353 تعداد دریافت فایل اصل مقاله: 335 |
||