Allan Melvin Andrew
Thumbnail Image
Preferred name
Allan Melvin Andrew
Official Name
Allan Melvin, Andrew
Alternative Name
Andrew, Allan Melvin
Andrew, Allan M.
Melvin, A. A.
Main Affiliation
Scopus Author ID
36469871200
Researcher ID
GDH-3820-2022

Research Output

Filters

1 1
2
1 1
Reset filters

Settings
Now showing 1 - 2 of 2
Thumbnail Image
Publication

A novel unsupervised spectral clustering for pure-tone audiograms towards hearing aid filter bank design and initial configurations

2022-01-01 , Elkhouly A. , Allan Melvin Andrew , Hasliza A Rahim @ Samsuddin , Abdulaziz N. , Abdulmalek M. , Mohd Najib Mohd Yasin , Muzammil Jusoh , Thennarasan Sabapathy , Siddique S.

The current practice of adjusting hearing aids (HA) is tiring and time-consuming for both patients and audiologists. Of hearing-impaired people, 40–50% are not satisfied with their HAs. In addition, good designs of HAs are often avoided since the process of fitting them is exhausting. To improve the fitting process, a machine learning (ML) unsupervised approach is proposed to cluster the pure-tone audiograms (PTA). This work applies the spectral clustering (SP) approach to group audiograms according to their similarity in shape. Different SP approaches are tested for best results and these approaches were evaluated by Silhouette, Calinski-Harabasz, and Davies-Bouldin criteria values. Kutools for Excel add-in is used to generate audiograms’ population, annotated using the results from SP, and different criteria values are used to evaluate population clusters. Finally, these clusters are mapped to a standard set of audiograms used in HA characterization. The results indicated that grouping the data in 8 groups or 10 results in ones with high evaluation criteria. The evaluation for population audiograms clusters shows good performance, as it resulted in a Silhouette coefficient >0.5. This work introduces a new concept to classify audiograms using an ML algorithm according to the audiograms’ similarity in shape.

View
Thumbnail Image
Publication

A hybrid modified method of the sine cosine algorithm using latin hypercube sampling with the cuckoo search algorithm for optimization problems

2020-11-01 , Siti Julia Rosli , Hasliza A Rahim @ Samsuddin , Khairul Najmy Abdul Rani , Yahaya N.Z. , R Badlishah Ahmad , Ruzelita Ngadiran , Abdulmalek M. , Muzammil Jusoh , Mohd Najib Mohd Yasin , Thennarasan Sabapathy , Allan Melvin Andrew

The metaheuristic algorithm is a popular research area for solving various optimization problems. In this study, we proposed two approaches based on the Sine Cosine Algorithm (SCA), namely, modification and hybridization. First, we attempted to solve the constraints of the original SCA by developing a modified SCA (MSCA) version with an improved identification capability of a random population using the Latin Hypercube Sampling (LHS) technique. MSCA serves to guide SCA in obtaining a better local optimum in the exploitation phase with fast convergence based on an optimum value of the solution. Second, hybridization of the MSCA (HMSCA) and the Cuckoo Search Algorithm (CSA) led to the development of the Hybrid Modified Sine Cosine Algorithm Cuckoo Search Algorithm (HMSCACSA) optimizer, which could search better optimal host nest locations in the global domain. Moreover, the HMSCACSA optimizer was validated over six classical test functions, the IEEE CEC 2017, and the IEEE CEC 2014 benchmark functions. The effectiveness of HMSCACSA was also compared with other hybrid metaheuristics such as the Particle Swarm Optimization–Grey Wolf Optimization (PSOGWO), Particle Swarm Optimization–Artificial Bee Colony (PSOABC), and Particle Swarm Optimization–Gravitational Search Algorithm (PSOGSA). In summary, the proposed HMSCACSA converged 63.89% faster and achieved a shorter Central Processing Unit (CPU) duration by a maximum of up to 43.6% compared to the other hybrid counterparts.

View