Taguchi's T-method with nearest integer-based binary bat algorithm for prediction
Taguchi�s T-method is a new prediction technique under the Mahalanobis-Taguchi system to predict unknown output or future states based on available historical information. Conventionally, in optimizing the T-method prediction accuracy, Taguchi�s orthogonal array is utilized to determine a subset of...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Published: |
Institute of Advanced Engineering and Science
2023
|
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.uniten.dspace-26812 |
---|---|
record_format |
dspace |
spelling |
my.uniten.dspace-268122023-05-29T17:36:54Z Taguchi's T-method with nearest integer-based binary bat algorithm for prediction Marlan Z.M. Jamaludin K.R. Ramlie F. Harudin N. 57223885180 26434395500 55982859700 56319654100 Taguchi�s T-method is a new prediction technique under the Mahalanobis-Taguchi system to predict unknown output or future states based on available historical information. Conventionally, in optimizing the T-method prediction accuracy, Taguchi�s orthogonal array is utilized to determine a subset of significant features to be used in formulating the optimal prediction model. This, however, resulted in a sub-optimal prediction accuracy due to its fixed and limited feature combination offered for evaluation and lack of higher-order feature interaction. In this paper, a swarm-based binary bat optimization algorithm with a nearest integer discretization approach is integrated with the Taguchi�s T-method. A comparative study is conducted by comparing the performance of the proposed method against the conventional approach using mean absolute error as the performance measure on four benchmark case studies. The results from experimental studies show a significant improvement in the T-method prediction accuracy. A reduction in the total number of features results in a less complex model. Based on the general observation, the nearest integer-based binary bat algorithm successfully optimized the selection of significant features due to recursive and repetitive searchability, in addition to its adaptive element in response to the current best solution in guiding the search process towards optimality. � 2022, Institute of Advanced Engineering and Science. All rights reserved. Final 2023-05-29T09:36:54Z 2023-05-29T09:36:54Z 2022 Article 10.11591/eei.v11i4.3859 2-s2.0-85133471399 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85133471399&doi=10.11591%2feei.v11i4.3859&partnerID=40&md5=0a45c560d6b4f581e6de275be50753f2 https://irepository.uniten.edu.my/handle/123456789/26812 11 4 2215 2224 All Open Access, Gold, Green Institute of Advanced Engineering and Science Scopus |
institution |
Universiti Tenaga Nasional |
building |
UNITEN Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Tenaga Nasional |
content_source |
UNITEN Institutional Repository |
url_provider |
http://dspace.uniten.edu.my/ |
description |
Taguchi�s T-method is a new prediction technique under the Mahalanobis-Taguchi system to predict unknown output or future states based on available historical information. Conventionally, in optimizing the T-method prediction accuracy, Taguchi�s orthogonal array is utilized to determine a subset of significant features to be used in formulating the optimal prediction model. This, however, resulted in a sub-optimal prediction accuracy due to its fixed and limited feature combination offered for evaluation and lack of higher-order feature interaction. In this paper, a swarm-based binary bat optimization algorithm with a nearest integer discretization approach is integrated with the Taguchi�s T-method. A comparative study is conducted by comparing the performance of the proposed method against the conventional approach using mean absolute error as the performance measure on four benchmark case studies. The results from experimental studies show a significant improvement in the T-method prediction accuracy. A reduction in the total number of features results in a less complex model. Based on the general observation, the nearest integer-based binary bat algorithm successfully optimized the selection of significant features due to recursive and repetitive searchability, in addition to its adaptive element in response to the current best solution in guiding the search process towards optimality. � 2022, Institute of Advanced Engineering and Science. All rights reserved. |
author2 |
57223885180 |
author_facet |
57223885180 Marlan Z.M. Jamaludin K.R. Ramlie F. Harudin N. |
format |
Article |
author |
Marlan Z.M. Jamaludin K.R. Ramlie F. Harudin N. |
spellingShingle |
Marlan Z.M. Jamaludin K.R. Ramlie F. Harudin N. Taguchi's T-method with nearest integer-based binary bat algorithm for prediction |
author_sort |
Marlan Z.M. |
title |
Taguchi's T-method with nearest integer-based binary bat algorithm for prediction |
title_short |
Taguchi's T-method with nearest integer-based binary bat algorithm for prediction |
title_full |
Taguchi's T-method with nearest integer-based binary bat algorithm for prediction |
title_fullStr |
Taguchi's T-method with nearest integer-based binary bat algorithm for prediction |
title_full_unstemmed |
Taguchi's T-method with nearest integer-based binary bat algorithm for prediction |
title_sort |
taguchi's t-method with nearest integer-based binary bat algorithm for prediction |
publisher |
Institute of Advanced Engineering and Science |
publishDate |
2023 |
_version_ |
1806423379820937216 |
score |
13.222552 |