IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i13p2085-d1428036.html
   My bibliography  Save this article

Homogeneous Ensemble Feature Selection for Mass Spectrometry Data Prediction in Cancer Studies

Author

Listed:
  • Yulan Liang

    (Department of Family and Community Health, University of Maryland Baltimore, Baltimore, MD 21201, USA)

  • Amin Gharipour

    (School of Information and Communication Technology, Griffith University, Gold Coast Campus, Brisbane, QLD 4222, Australia)

  • Erik Kelemen

    (Department of Computer Science, University of Maryland College Park, College Park, MD 20742, USA)

  • Arpad Kelemen

    (Department of Organizational Systems and Adult Health, University of Maryland Baltimore, Baltimore, MD 21201, USA)

Abstract

The identification of important proteins is critical for the medical diagnosis and prognosis of common diseases. Diverse sets of computational tools have been developed for omics data reduction and protein selection. However, standard statistical models with single-feature selection involve the multi-testing burden of low power with limited available samples. Furthermore, high correlations among proteins with high redundancy and moderate effects often lead to unstable selections and cause reproducibility issues. Ensemble feature selection in machine learning (ML) may identify a stable set of disease biomarkers that could improve the prediction performance of subsequent classification models and thereby simplify their interpretability. In this study, we developed a three-stage homogeneous ensemble feature selection (HEFS) approach for both identifying proteins and improving prediction accuracy. This approach was implemented and applied to ovarian cancer proteogenomics datasets comprising (1) binary putative homologous recombination deficiency (HRD)- positive or -negative samples; (2) multiple mRNA classes (differentiated, proliferative, immunoreactive, mesenchymal, and unknown samples). We conducted and compared various ML methods with HEFS including random forest (RF), support vector machine (SVM), and neural network (NN) for predicting both binary and multiple-class outcomes. The results indicated that the prediction accuracies varied for both binary and multiple-class classifications using various ML approaches with the proposed HEFS method. RF and NN provided better prediction accuracies than simple Naive Bayes or logistic models. For binary outcomes, with a sample size of 122 and nine selected prediction proteins using our proposed three-stage HEFS approach, the best ensemble ML (Treebag) achieved 83% accuracy, 85% sensitivity, and 81% specificity. For multiple (five)-class outcomes, the proposed HEFS-selected proteins combined with Principal Component Analysis (PCA) in NN resulted in prediction accuracies for multiple-class classifications ranging from 75% to 96% for each of the five classes. Despite the different prediction accuracies of the various models, HEFS identified consistent sets of proteins linked to the binary and multiple-class outcomes.

Suggested Citation

  • Yulan Liang & Amin Gharipour & Erik Kelemen & Arpad Kelemen, 2024. "Homogeneous Ensemble Feature Selection for Mass Spectrometry Data Prediction in Cancer Studies," Mathematics, MDPI, vol. 12(13), pages 1-15, July.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:2085-:d:1428036
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/13/2085/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/13/2085/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fan J. & Li R., 2001. "Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 1348-1360, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tutz, Gerhard & Pößnecker, Wolfgang & Uhlmann, Lorenz, 2015. "Variable selection in general multinomial logit models," Computational Statistics & Data Analysis, Elsevier, vol. 82(C), pages 207-222.
    2. Guan, Wei & Gray, Alexander, 2013. "Sparse high-dimensional fractional-norm support vector machine via DC programming," Computational Statistics & Data Analysis, Elsevier, vol. 67(C), pages 136-148.
    3. Margherita Giuzio, 2017. "Genetic algorithm versus classical methods in sparse index tracking," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 40(1), pages 243-256, November.
    4. Chang, Jinyuan & Chen, Song Xi & Chen, Xiaohong, 2015. "High dimensional generalized empirical likelihood for moment restrictions with dependent data," Journal of Econometrics, Elsevier, vol. 185(1), pages 283-304.
    5. Xu, Yang & Zhao, Shishun & Hu, Tao & Sun, Jianguo, 2021. "Variable selection for generalized odds rate mixture cure models with interval-censored failure time data," Computational Statistics & Data Analysis, Elsevier, vol. 156(C).
    6. Alexandre Belloni & Victor Chernozhukov & Denis Chetverikov & Christian Hansen & Kengo Kato, 2018. "High-dimensional econometrics and regularized GMM," CeMMAP working papers CWP35/18, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    7. Emmanouil Androulakis & Christos Koukouvinos & Kalliopi Mylona & Filia Vonta, 2010. "A real survival analysis application via variable selection methods for Cox's proportional hazards model," Journal of Applied Statistics, Taylor & Francis Journals, vol. 37(8), pages 1399-1406.
    8. Meng An & Haixiang Zhang, 2023. "High-Dimensional Mediation Analysis for Time-to-Event Outcomes with Additive Hazards Model," Mathematics, MDPI, vol. 11(24), pages 1-11, December.
    9. Singh, Rakhi & Stufken, John, 2024. "Factor selection in screening experiments by aggregation over random models," Computational Statistics & Data Analysis, Elsevier, vol. 194(C).
    10. Hao Wang & Hao Zeng & Jiashan Wang, 2022. "An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis," Computational Optimization and Applications, Springer, vol. 83(3), pages 967-997, December.
    11. Koki Momoki & Takuma Yoshida, 2024. "Hypothesis testing for varying coefficient models in tail index regression," Statistical Papers, Springer, vol. 65(6), pages 3821-3852, August.
    12. Lili Pan & Ziyan Luo & Naihua Xiu, 2017. "Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 104-118, October.
    13. Okhrin, Ostap & Ristig, Alexander & Sheen, Jeffrey R. & Trück, Stefan, 2015. "Conditional systemic risk with penalized copula," SFB 649 Discussion Papers 2015-038, Humboldt University Berlin, Collaborative Research Center 649: Economic Risk.
    14. Michael Hintermüller & Tao Wu, 2014. "A superlinearly convergent R-regularized Newton scheme for variational models with concave sparsity-promoting priors," Computational Optimization and Applications, Springer, vol. 57(1), pages 1-25, January.
    15. Anastasiou, Andreas & Cribben, Ivor & Fryzlewicz, Piotr, 2022. "Cross-covariance isolate detect: a new change-point method for estimating dynamic functional connectivity," LSE Research Online Documents on Economics 112148, London School of Economics and Political Science, LSE Library.
    16. Ni, Xiao & Zhang, Hao Helen & Zhang, Daowen, 2009. "Automatic model selection for partially linear models," Journal of Multivariate Analysis, Elsevier, vol. 100(9), pages 2100-2111, October.
    17. Jun Yan & Jian Huang, 2012. "Model Selection for Cox Models with Time-Varying Coefficients," Biometrics, The International Biometric Society, vol. 68(2), pages 419-428, June.
    18. Gerhard Tutz & Moritz Berger, 2018. "Tree-structured modelling of categorical predictors in generalized additive regression," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 737-758, September.
    19. Min Tao & Jiang-Ning Li, 2023. "Error Bound and Isocost Imply Linear Convergence of DCA-Based Algorithms to D-Stationarity," Journal of Optimization Theory and Applications, Springer, vol. 197(1), pages 205-232, April.
    20. Jun Lu & Shao Yi, 2022. "Reducing Overestimating and Underestimating Volatility via the Augmented Blending-ARCH Model," Applied Economics and Finance, Redfame publishing, vol. 9(2), pages 48-59, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:2085-:d:1428036. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.