A study on gender detection using multiple classifiers on voice data

IF 6.8 2区 工程技术 Q1 ENGINEERING, MULTIDISCIPLINARY
Gülnur Yildizdan , Emine Baş
{"title":"A study on gender detection using multiple classifiers on voice data","authors":"Gülnur Yildizdan ,&nbsp;Emine Baş","doi":"10.1016/j.aej.2025.08.002","DOIUrl":null,"url":null,"abstract":"<div><div>Researchers have frequently used metaheuristic algorithms for various problems due to their success. In data mining studies, feature selection (FS) is an essential preprocessing step for large-scale problems. Researchers have recently implemented FS using metaheuristic algorithms. In this study, the FS problem was solved using five different continuous metaheuristic algorithms (Osprey Optimization Algorithm, Spider Wasps Optimizer, Walrus Optimizer, Kepler Optimization Algorithm, and Crested Porcupine Optimizer) proposed in recent years. For the FS problem, the search spaces of continuous metaheuristic algorithms need to be converted to binary values. For this process, sixteen different types of transfer functions (S-shaped, V-shaped, Taper-shaped, and U-shaped) were analyzed. Comparison metrics such as fitness, accuracy, precision, recall, F1 score, number of selected features, and running time were used. The classification process was performed on the voice dataset consisting of 3168 samples and 22 features of male and female voices. K-Nearest Neighbor, Decision Tree, Random Forest, and Multi-Layer Perceptron were selected as classifiers. According to the mean fitness and accuracy results, the most successful classifier was determined to be K-Nearest Neighbor, and the most successful metaheuristic algorithm was determined to be the Kepler Optimization Algorithm.</div></div>","PeriodicalId":7484,"journal":{"name":"alexandria engineering journal","volume":"129 ","pages":"Pages 1061-1108"},"PeriodicalIF":6.8000,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"alexandria engineering journal","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1110016825008725","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Researchers have frequently used metaheuristic algorithms for various problems due to their success. In data mining studies, feature selection (FS) is an essential preprocessing step for large-scale problems. Researchers have recently implemented FS using metaheuristic algorithms. In this study, the FS problem was solved using five different continuous metaheuristic algorithms (Osprey Optimization Algorithm, Spider Wasps Optimizer, Walrus Optimizer, Kepler Optimization Algorithm, and Crested Porcupine Optimizer) proposed in recent years. For the FS problem, the search spaces of continuous metaheuristic algorithms need to be converted to binary values. For this process, sixteen different types of transfer functions (S-shaped, V-shaped, Taper-shaped, and U-shaped) were analyzed. Comparison metrics such as fitness, accuracy, precision, recall, F1 score, number of selected features, and running time were used. The classification process was performed on the voice dataset consisting of 3168 samples and 22 features of male and female voices. K-Nearest Neighbor, Decision Tree, Random Forest, and Multi-Layer Perceptron were selected as classifiers. According to the mean fitness and accuracy results, the most successful classifier was determined to be K-Nearest Neighbor, and the most successful metaheuristic algorithm was determined to be the Kepler Optimization Algorithm.
基于多分类器的语音数据性别检测研究
由于元启发式算法的成功,研究人员经常使用元启发式算法来解决各种问题。在数据挖掘研究中,特征选择(FS)是处理大规模问题必不可少的预处理步骤。研究人员最近使用元启发式算法实现了FS。本研究采用近年来提出的五种不同的连续元启发式算法(Osprey Optimization Algorithm、Spider Wasps Optimizer、Walrus Optimizer、Kepler Optimization Algorithm和Crested Porcupine Optimizer)来解决FS问题。对于FS问题,连续元启发式算法的搜索空间需要转换为二进制值。针对这一过程,分析了16种不同类型的传递函数(s型、v型、锥形和u型)。使用了诸如适应度、准确性、精度、召回率、F1分数、选择的特征数量和运行时间等比较指标。在包含3168个样本和22个男声和女声特征的语音数据集上进行分类过程。选择k近邻、决策树、随机森林和多层感知器作为分类器。根据平均适应度和准确率结果,确定最成功的分类器为K-Nearest Neighbor,最成功的元启发式算法为Kepler Optimization algorithm。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
alexandria engineering journal
alexandria engineering journal Engineering-General Engineering
CiteScore
11.20
自引率
4.40%
发文量
1015
审稿时长
43 days
期刊介绍: Alexandria Engineering Journal is an international journal devoted to publishing high quality papers in the field of engineering and applied science. Alexandria Engineering Journal is cited in the Engineering Information Services (EIS) and the Chemical Abstracts (CA). The papers published in Alexandria Engineering Journal are grouped into five sections, according to the following classification: • Mechanical, Production, Marine and Textile Engineering • Electrical Engineering, Computer Science and Nuclear Engineering • Civil and Architecture Engineering • Chemical Engineering and Applied Sciences • Environmental Engineering
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信