2023
DOI: 10.1016/j.microc.2022.108382
|View full text |Cite
|
Sign up to set email alerts
|

Bat algorithm for variable selection in multivariate classification modeling using linear discriminant analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0
1

Year Published

2023
2023
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 39 publications
0
4
0
1
Order By: Relevance
“…Tujuan dari ekstraski fitur adalah mempertahankan sebagian besar informasi yang relevan dengan melakukan kompresi. Beberapa teknik dari ekstraksi fitur adalah Principal Component Analysis (PCA) [15]- [18], Linear Discriminant Analysis (LDA) [19]- [22], dan Fast Fourier Transform (FFT) [23]- [27].…”
Section: Pendahuluanunclassified
“…Tujuan dari ekstraski fitur adalah mempertahankan sebagian besar informasi yang relevan dengan melakukan kompresi. Beberapa teknik dari ekstraksi fitur adalah Principal Component Analysis (PCA) [15]- [18], Linear Discriminant Analysis (LDA) [19]- [22], dan Fast Fourier Transform (FFT) [23]- [27].…”
Section: Pendahuluanunclassified
“…The algorithm simulates the behavior of bats as they search for prey in the dark, using echolocation and adjusting their flight paths based on feedback from their environment. The BA involves moving "bats" through the solution space by iteratively altering their Souza et al [15] presents the BA-LDA algorithm, a bat-inspired technique created to replace linear discriminant analysis (LDA) in multivariate classification for variable selection. This approach was examined and contrasted with the genetic algorithm (GA-LDA) and successive projection algorithm (SPA-LDA), taking inspiration from the echolocation behavior of bats during prey search.…”
Section: Bat Algorithmmentioning
confidence: 99%
“…If the optimization problem involves discrete variables (e.g., integer variables), the BA is adapted to handle these discrete values. One approach is to introduce a discretization step to map the continuous search space of the BA to a discrete space that corresponds to a problem [14], [15]. This can involve rounding or mapping continuous parameter values to the nearest discrete values.…”
Section: Bat Algorithmmentioning
confidence: 99%
“…This work used three discrete optimization methods for the master stage: a parallel version of the Montecarlo method (PMC) and two parallel-discrete versions of traditional continuous optimization methods, i.e., the genetic and crow search algorithms. The selection of these methods was based on the excellent results reported in the literature with regard to the solution of similar electrical engineering problems [18,29,32,33]. This subsection outlines the iterative process of each of these algorithms.…”
Section: Master Stagementioning
confidence: 99%