Sign inGet started
Paper · arXiv

A Kernel Fisher Discriminant Analysis-Based Tree Ensemble Classifier: KFDA Forest

In general, an ensemble classifier is more accurate than a single classifier. In this study, we propose an ensemble classifier called the kernel Fisher discriminant analysis forest (KFDA Forest), which is a tree-based ensemble method that applies KFDA. To promote diversity, bootstrap is used, and variable sets are randomly divided into K subsets. KFDA is performed on each subset to increase classification accuracy. KFDA maximizes the distance between classes while minimizing the distance within classes. KFDA can also be applied to classification problems in a nonlinear data structure using the kernel trick because it can transform the input space into a kernel feature space, commonly name...

AuthorsDonghwan Kim, Seung Hwan Park, Jun-Geol Baek
Primary categorycs.LG
Published27 June 2026
Last updated at source27 June 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/e5db4716-ff15-4bef-b1c3-991f26e11ba7" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.