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

• URL: http://arxiv.org/abs/2606.29053v1
• Date: Sat, 27 Jun 2026 19:24:34 GMT
• Title: A Kernel Fisher Discriminant Analysis-Based Tree Ensemble Classifier: KFDA Forest
• Abstract summary: kernel Fisher discriminant analysis forest (KFDA) is a tree-based ensemble method that applies KFDA.<n>KFDA can be applied to classification problems in a nonlinear data structure using the kernel trick.
• Score: 18.35631752167819
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: 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 named a rotation, rather than performing a dimensionality reduction. Because new feature axes and KFDA projections are parallel, decision trees are used as a base classifier. To compare the proposed method with existing ensemble methods, we apply these to real datasets from the UCI and KEEL repositories.

Related papers

• Continual Learning Using a Kernel-Based Method Over Foundation Models [13.315292874389735]
  Class-incremental learning (CIL) learns a sequence of tasks incrementally.<n>CIL has two key challenges: catastrophic forgetting (CF) and inter-task class separation (ICS)<n>This paper proposes Kernel Linear Discriminant Analysis (KLDA) that can effectively avoid CF and ICS problems.
  arXiv  Detail & Related papers  (2024-12-20T05:09:18Z)
• Self-Supervised Graph Embedding Clustering [70.36328717683297]
  K-means one-step dimensionality reduction clustering method has made some progress in addressing the curse of dimensionality in clustering tasks. We propose a unified framework that integrates manifold learning with K-means, resulting in the self-supervised graph embedding framework.
  arXiv  Detail & Related papers  (2024-09-24T08:59:51Z)
• MOKD: Cross-domain Finetuning for Few-shot Classification via Maximizing Optimized Kernel Dependence [97.93517982908007]
  In cross-domain few-shot classification, NCC aims to learn representations to construct a metric space where few-shot classification can be performed. In this paper, we find that there exist high similarities between NCC-learned representations of two samples from different classes. We propose a bi-level optimization framework, emphmaximizing optimized kernel dependence (MOKD) to learn a set of class-specific representations that match the cluster structures indicated by labeled data.
  arXiv  Detail & Related papers  (2024-05-29T05:59:52Z)
• Feature Selection using Sparse Adaptive Bottleneck Centroid-Encoder [1.2487990897680423]
  We introduce a novel nonlinear model, Sparse Adaptive Bottleneckid-Encoder (SABCE), for determining the features that discriminate between two or more classes. The algorithm is applied to various real-world data sets, including high-dimensional biological, image, speech, and accelerometer sensor data.
  arXiv  Detail & Related papers  (2023-06-07T21:37:21Z)
• Do We Really Need a Learnable Classifier at the End of Deep Neural Network? [118.18554882199676]
  We study the potential of learning a neural network for classification with the classifier randomly as an ETF and fixed during training. Our experimental results show that our method is able to achieve similar performances on image classification for balanced datasets.
  arXiv  Detail & Related papers  (2022-03-17T04:34:28Z)
• Deep Neural Decision Forest for Acoustic Scene Classification [45.886356124352226]
  Acoustic scene classification (ASC) aims to classify an audio clip based on the characteristic of the recording environment. We propose a novel approach for ASC using deep neural decision forest (DNDF)
  arXiv  Detail & Related papers  (2022-03-07T14:39:42Z)
• A Topological Data Analysis Based Classifier [1.6668132748773563]
  This paper proposes an algorithm that applies Topological Data Analysis directly to multi-class classification problems. The proposed algorithm builds a filtered simplicial complex on the dataset. On average, the proposed TDABC method was better than KNN and weighted-KNN.
  arXiv  Detail & Related papers  (2021-11-09T15:54:16Z)
• Minimum Variance Embedded Auto-associative Kernel Extreme Learning Machine for One-class Classification [1.4146420810689422]
  VAAKELM is a novel extension of an auto-associative kernel extreme learning machine. It embeds minimum variance information within its architecture and reduces the intra-class variance. It follows a reconstruction-based approach to one-class classification and minimizes the reconstruction error.
  arXiv  Detail & Related papers  (2020-11-24T17:00:30Z)
• ACDC: Weight Sharing in Atom-Coefficient Decomposed Convolution [57.635467829558664]
  We introduce a structural regularization across convolutional kernels in a CNN. We show that CNNs now maintain performance with dramatic reduction in parameters and computations.
  arXiv  Detail & Related papers  (2020-09-04T20:41:47Z)
• High-Dimensional Quadratic Discriminant Analysis under Spiked Covariance Model [101.74172837046382]
  We propose a novel quadratic classification technique, the parameters of which are chosen such that the fisher-discriminant ratio is maximized. Numerical simulations show that the proposed classifier not only outperforms the classical R-QDA for both synthetic and real data but also requires lower computational complexity.
  arXiv  Detail & Related papers  (2020-06-25T12:00:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.