1
|
Yue L, Hu P, Zhu J. Gender-Driven English Speech Emotion Recognition with Genetic Algorithm. Biomimetics (Basel) 2024; 9:360. [PMID: 38921240 PMCID: PMC11201838 DOI: 10.3390/biomimetics9060360] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/25/2024] [Revised: 06/10/2024] [Accepted: 06/13/2024] [Indexed: 06/27/2024] Open
Abstract
Speech emotion recognition based on gender holds great importance for achieving more accurate, personalized, and empathetic interactions in technology, healthcare, psychology, and social sciences. In this paper, we present a novel gender-emotion model. First, gender and emotion features were extracted from voice signals to lay the foundation for our recognition model. Second, a genetic algorithm (GA) processed high-dimensional features, and the Fisher score was used for evaluation. Third, features were ranked by their importance, and the GA was improved through novel crossover and mutation methods based on feature importance, to improve the recognition accuracy. Finally, the proposed algorithm was compared with state-of-the-art algorithms on four common English datasets using support vector machines (SVM), and it demonstrated superior performance in accuracy, precision, recall, F1-score, the number of selected features, and running time. The proposed algorithm faced challenges in distinguishing between neutral, sad, and fearful emotions, due to subtle vocal differences, overlapping pitch and tone variability, and similar prosodic features. Notably, the primary features for gender-based differentiation mainly involved mel frequency cepstral coefficients (MFCC) and log MFCC.
Collapse
Affiliation(s)
- Liya Yue
- Fanli Business School, Nanyang Institute of Technology, Nanyang 473004, China
| | - Pei Hu
- School of Computer and Software, Nanyang Institute of Technology, Nanyang 473004, China
| | - Jiulong Zhu
- Fanli Business School, Nanyang Institute of Technology, Nanyang 473004, China
| |
Collapse
|
2
|
Sarwar J, Khan SA, Azmat M, Khan F. A comparative analysis of feature selection models for spatial analysis of floods using hybrid metaheuristic and machine learning models. ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH INTERNATIONAL 2024; 31:33495-33514. [PMID: 38684613 DOI: 10.1007/s11356-024-33389-5] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 12/15/2023] [Accepted: 04/16/2024] [Indexed: 05/02/2024]
Abstract
The research aims to propose a feature selection model for hydraulic analysis as such a model has not been proposed previously. For this purpose, hybrids of three metaheuristic algorithms, particle swarm optimization (PSO), ant colony optimization (ACO), and genetic algorithm (GA) with two machine learning models which are support vector machine (SVM) and K-nearest neighbor (KNN) are employed. The dataset considered was hydraulic having an association with flood and possessed topographic, geo-environmental, and human-induced variables. The dataset considered had multicollinearity heteroscedasticity and autocorrelation problems. The metaheuristic algorithms were evaluated by varying the number of population size. Among them, PSO performed better by providing an appropriate number of features with a lower number of iterations. We have analyzed the performance of SVM with different kernels; linear, radial basis function (RBF), sigmoid, and polynomial, as the original SVM is designed only for linear datasets but the hydraulic dataset possesses non-linear characteristics as well. The performance of different kernels in terms of their accuracies is evaluated and recorded. This study showed that RBF performed the best and sigmoid showed the least accuracy for GA, PSO, and ACO algorithms. The performance of KNN is evaluated in terms of accuracies by varying the K-values. It was found that KNN shows low accuracy with a small K-value which then attained a maximum level by increasing K-values, and it finally started decreasing, explicitly, by further enhancing K-values. While comparing the performance of hybrids of GA, PSO, and ACO with SVM and KNN, it was analyzed that KNN performed better with these meta-heuristics with PSO-KNN which performed the best among the baseline models. Thus, the study proposes that PSO-KNN can be utilized as a feature selection technique to obtain optimal data subsets for hydraulic modeling and analysis.
Collapse
Affiliation(s)
- Javeria Sarwar
- Pakistan Institute of Development Economics, Islamabad, Pakistan
- Allama Iqbal Open University, Islamabad, Pakistan
| | - Saud Ahmed Khan
- Pakistan Institute of Development Economics, Islamabad, Pakistan
| | - Muhammad Azmat
- Institute of Geographical Information Systems (IGIS), School of Civil & Environmental Engineering (SCEE), National University of Sciences and Technology, Islamabad, Pakistan
| | - Faridoon Khan
- Department of Creative Technology, Faculty of Computing and AI, Air University, Islamabad, Pakistan.
| |
Collapse
|
3
|
Moslemi A, Bidar M, Ahmadian A. Subspace learning using structure learning and non-convex regularization: Hybrid technique with mushroom reproduction optimization in gene selection. Comput Biol Med 2023; 164:107309. [PMID: 37536092 DOI: 10.1016/j.compbiomed.2023.107309] [Citation(s) in RCA: 2] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/24/2023] [Revised: 07/26/2023] [Accepted: 07/28/2023] [Indexed: 08/05/2023]
Abstract
Gene selection as a problem with high dimensions has drawn considerable attention in machine learning and computational biology over the past decade. In the field of gene selection in cancer datasets, different types of feature selection techniques in terms of strategy (filter, wrapper and embedded) and label information (supervised, unsupervised, and semi-supervised) have been developed. However, using hybrid feature selection can still improve the performance. In this paper, we propose a hybrid feature selection based on filter and wrapper strategies. In the filter-phase, we develop an unsupervised features selection based on non-convex regularized non-negative matrix factorization and structure learning, which we deem NCNMFSL. In the wrapper-phase, for the first time, mushroom reproduction optimization (MRO) is leveraged to obtain the most informative features subset. In this hybrid feature selection method, irrelevant features are filtered-out through NCNMFSL, and most discriminative features are selected by MRO. To show the effectiveness and proficiency of the proposed method, numerical experiments are conducted on Breast, Heart, Colon, Leukemia, Prostate, Tox-171 and GLI-85 benchmark datasets. SVM and decision tree classifiers are leveraged to analyze proposed technique and top accuracy are 0.97, 0.84, 0.98, 0.95, 0.98, 0.87 and 0.85 for Breast, Heart, Colon, Leukemia, Prostate, Tox-171 and GLI-85, respectively. The computational results show the effectiveness of the proposed method in comparison with state-of-art feature selection techniques.
Collapse
Affiliation(s)
- Amir Moslemi
- Department of Physics, Ryerson University, Toronto, ON, Canada.
| | - Mahdi Bidar
- Department of Computer Science, University of Regina, Regina, Canada
| | - Arash Ahmadian
- Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada
| |
Collapse
|
4
|
Darwish SM, Farhan DA, Elzoghabi AA. Building an Effective Classifier for Phishing Web Pages Detection: A Quantum-Inspired Biomimetic Paradigm Suitable for Big Data Analytics of Cyber Attacks. Biomimetics (Basel) 2023; 8:biomimetics8020197. [PMID: 37218783 DOI: 10.3390/biomimetics8020197] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/11/2023] [Revised: 05/01/2023] [Accepted: 05/05/2023] [Indexed: 05/24/2023] Open
Abstract
To combat malicious domains, which serve as a key platform for a wide range of attacks, domain name service (DNS) data provide rich traces of Internet activities and are a powerful resource. This paper presents new research that proposes a model for finding malicious domains by passively analyzing DNS data. The proposed model builds a real-time, accurate, middleweight, and fast classifier by combining a genetic algorithm for selecting DNS data features with a two-step quantum ant colony optimization (QABC) algorithm for classification. The modified two-step QABC classifier uses K-means instead of random initialization to place food sources. In order to overcome ABCs poor exploitation abilities and its convergence speed, this paper utilizes the metaheuristic QABC algorithm for global optimization problems inspired by quantum physics concepts. The use of the Hadoop framework and a hybrid machine learning approach (K-mean and QABC) to deal with the large size of uniform resource locator (URL) data is one of the main contributions of this paper. The major point is that blacklists, heavyweight classifiers (those that use more features), and lightweight classifiers (those that use fewer features and consume the features from the browser) may all be improved with the use of the suggested machine learning method. The results showed that the suggested model could work with more than 96.6% accuracy for more than 10 million query-answer pairs.
Collapse
Affiliation(s)
- Saad M Darwish
- Department of Information Technology, Institute of Graduate Studies and Research, Alexandria University, 163 Horreya Avenue, El Shatby 21526, Alexandria P.O. Box 832, Egypt
| | - Dheyauldeen A Farhan
- Department of Computer Science, Al-Maarif University College, Ramadi 31001, Iraq
| | - Adel A Elzoghabi
- Department of Information Technology, Institute of Graduate Studies and Research, Alexandria University, 163 Horreya Avenue, El Shatby 21526, Alexandria P.O. Box 832, Egypt
| |
Collapse
|
5
|
Ay Ş, Ekinci E, Garip Z. A comparative analysis of meta-heuristic optimization algorithms for feature selection on ML-based classification of heart-related diseases. THE JOURNAL OF SUPERCOMPUTING 2023; 79:11797-11826. [PMID: 37304052 PMCID: PMC9983547 DOI: 10.1007/s11227-023-05132-3] [Citation(s) in RCA: 2] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Accepted: 02/21/2023] [Indexed: 06/13/2023]
Abstract
This study aims to use a machine learning (ML)-based enhanced diagnosis and survival model to predict heart disease and survival in heart failure by combining the cuckoo search (CS), flower pollination algorithm (FPA), whale optimization algorithm (WOA), and Harris hawks optimization (HHO) algorithms, which are meta-heuristic feature selection algorithms. To achieve this, experiments are conducted on the Cleveland heart disease dataset and the heart failure dataset collected from the Faisalabad Institute of Cardiology published at UCI. CS, FPA, WOA, and HHO algorithms for feature selection are applied for different population sizes and are realized based on the best fitness values. For the original dataset of heart disease, the maximum prediction F-score of 88% is obtained using K-nearest neighbour (KNN) when compared to logistic regression (LR), support vector machine (SVM), Gaussian Naive Bayes (GNB), and random forest (RF). With the proposed approach, the heart disease prediction F-score of 99.72% is obtained using KNN for population sizes 60 with FPA by selecting eight features. For the original dataset of heart failure, the maximum prediction F-score of 70% is obtained using LR and RF compared to SVM, GNB, and KNN. With the proposed approach, the heart failure prediction F-score of 97.45% is obtained using KNN for population sizes 10 with HHO by selecting five features. Experimental findings show that the applied meta-heuristic algorithms with ML algorithms significantly improve prediction performances compared to performances obtained from the original datasets. The motivation of this paper is to select the most critical and informative feature subset through meta-heuristic algorithms to improve classification accuracy.
Collapse
Affiliation(s)
- Şevket Ay
- Computer Engineering Department, Faculty of Technology, Sakarya University of Applied Sciences, Sakarya, 54187 Turkey
| | - Ekin Ekinci
- Computer Engineering Department, Faculty of Technology, Sakarya University of Applied Sciences, Sakarya, 54187 Turkey
| | - Zeynep Garip
- Computer Engineering Department, Faculty of Technology, Sakarya University of Applied Sciences, Sakarya, 54187 Turkey
| |
Collapse
|
6
|
Traditional machine learning algorithms for breast cancer image classification with optimized deep features. Biomed Signal Process Control 2023. [DOI: 10.1016/j.bspc.2022.104534] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/24/2022]
|
7
|
Wu Y, Zhu D, Wang X. Tree enhanced deep adaptive network for cancer prediction with high dimension low sample size microarray data. Appl Soft Comput 2023. [DOI: 10.1016/j.asoc.2023.110078] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/05/2023]
|
8
|
Sun J, Wang P, Yu H, Yang X. A constraint score guided meta-heuristic searching to attribute reduction. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2022. [DOI: 10.3233/jifs-222832] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/24/2022]
Abstract
Essentially, the problem solving of attribute reduction can be regarded as a process of reduct searching which will be terminated if a pre-defined restriction is achieved. Presently, among a variety of searching strategies, meta-heuristic searching has been widely accepted. Nevertheless, it should be emphasized that the iterative procedures in most meta-heuristic algorithms rely heavily on the random generation of initial population, such a type of generation is naturally associated with the limitations of inferior stability and performance. Therefore, a constraint score guidance is proposed before carrying out meta-heuristic searching and then a novel framework to seek out reduct is developed. Firstly, for each attribute and each label in data, the index called local constraint score is calculated. Secondly, the qualified attributes are identified by those constraint scores, which consist of the foundation of initial population. Finally, the meta-heuristic searching can be further employed to achieve the required restriction in attribute reduction. Note that most existing meta-heuristic searchings and popular measures (evaluate the significance of attributes) can be embedded into our framework. Comprehensive experiments over 20 public datasets clearly validated the effectiveness of our framework: it is beneficial to reduct with superior stabilities, and the derived reduct may further contribute to the improvement of classification performance.
Collapse
Affiliation(s)
- Jiaqi Sun
- School of Computer, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China
| | - Pingxin Wang
- School of Science, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China
| | - Hualong Yu
- School of Computer, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China
| | - Xibei Yang
- School of Computer, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu, China
| |
Collapse
|
9
|
Adaptive local landscape feature vector for problem classification and algorithm selection. Appl Soft Comput 2022. [DOI: 10.1016/j.asoc.2022.109751] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/27/2022]
|
10
|
Praveen S, Tyagi N, Singh B, Karetla GR, Thalor MA, Joshi K, Tsegaye M. PSO-Based Evolutionary Approach to Optimize Head and Neck Biomedical Image to Detect Mesothelioma Cancer. BIOMED RESEARCH INTERNATIONAL 2022; 2022:3618197. [PMID: 36033562 PMCID: PMC9410819 DOI: 10.1155/2022/3618197] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 05/20/2022] [Revised: 06/30/2022] [Accepted: 07/21/2022] [Indexed: 11/17/2022]
Abstract
Mesothelioma is a form of cancer that is aggressive and fatal. It is a thin layer of tissue that covers the majority of the patient's internal organs. The treatments are available; however, a cure is not attainable for the majority of patients. So, a lot of research is being done on detection of mesothelioma cancer using various different approaches; but this paper focuses on optimization techniques for optimizing the biomedical images to detect the cancer. With the restricted number of samples in the medical field, a Relief-PSO head and mesothelioma neck cancer pathological image feature selection approach is proposed. The approach reduces multilevel dimensionality. To begin, the relief technique picks different feature weights depending on the relationship between features and categories. Second, the hybrid binary particle swarm optimization (HBPSO) is suggested to automatically determine the optimum feature subset for candidate feature subsets. The technique outperforms seven other feature selection algorithms in terms of morphological feature screening, dimensionality reduction, and classification performance.
Collapse
Affiliation(s)
| | - Neha Tyagi
- Department of IT, G.L Bajaj Institute of Technology & Management, Greater Noida, India
| | - Bhagwant Singh
- Informatics Cluster, School of Computer Science, University of Petroleum and Energy Studies (UPES) Dehradun, Uttrakhand, 248007, India
| | - Girija Rani Karetla
- School of Computer, Data and Mathematical Sciences, Western Sydney University, Sydney, Australia
| | | | | | | |
Collapse
|
11
|
Xue Y, Cai X, Neri F. A multi-objective evolutionary algorithm with interval based initialization and self-adaptive crossover operator for large-scale feature selection in classification. Appl Soft Comput 2022. [DOI: 10.1016/j.asoc.2022.109420] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/05/2023]
|