ARTÍCULO
TITULO

Exploring the Time-efficient Evolutionary-based Feature Selection Algorithms for Speech Data under Stressful Work Condition

Derry Pramono Adi    
Lukman Junaedi    
Frismanda    
Agustinus Bimo Gumelar    
Andreas Agung Kristanto    

Resumen

Initially, the goal of Machine Learning (ML) advancements is faster computation time and lower computation resources, while the curse of dimensionality burdens both computation time and resource. This paper describes the benefits of the Feature Selection Algorithms (FSA) for speech data under workload stress. FSA contributes to reducing both data dimension and computation time and simultaneously retains the speech information. We chose to use the robust Evolutionary Algorithm, Harmony Search, Principal Component Analysis, Genetic Algorithm, Particle Swarm Optimization, Ant Colony Optimization, and Bee Colony Optimization, which are then to be evaluated using the hierarchical machine learning models. These FSAs are explored with the conversational workload stress data of a Customer Service hotline, which has daily complaints that trigger stress in speaking. Furthermore, we employed precisely 223 acoustic-based features. Using Random Forest, our evaluation result showed computation time had improved 3.6 faster than the original 223 features employed. Evaluation using Support Vector Machine beat the record with 0.001 seconds of computation time.

 Artículos similares

       
 
Li Li and Kyung Soo Jun    
River flood routing computes changes in the shape of a flood wave over time as it travels downstream along a river. Conventional flood routing models, especially hydrodynamic models, require a high quality and quantity of input data, such as measured hyd... ver más
Revista: Water

 
Mohamed Shenify, Fokrul Alom Mazarbhuiya and A. S. Wungreiphi    
There are many applications of anomaly detection in the Internet of Things domain. IoT technology consists of a large number of interconnecting digital devices not only generating huge data continuously but also making real-time computations. Since IoT d... ver más
Revista: Applied Sciences

 
Junlin Lou, Burak Yuksek, Gokhan Inalhan and Antonios Tsourdos    
In this study, we consider the problem of motion planning for urban air mobility applications to generate a minimal snap trajectory and trajectory that cost minimal time to reach a goal location in the presence of dynamic geo-fences and uncertainties in ... ver más
Revista: Aerospace

 
Mauro Dell?Amico, Jafar Jamal and Roberto Montemanni    
The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was presente... ver más
Revista: Algorithms

 
Sorin Zoican, Roxana Zoican, Dan Galatchi and Marius Vochin    
This paper illustrates a general framework in which a neural network application can be easily integrated and proposes a traffic forecasting approach that uses neural networks based on graphs. Neural networks based on graphs have the advantage of capturi... ver más
Revista: Applied Sciences