Relearning ensemble selection based on new generated features

• URL: http://arxiv.org/abs/2106.06761v1
• Date: Sat, 12 Jun 2021 12:45:32 GMT
• Title: Relearning ensemble selection based on new generated features
• Authors: Robert Burduk
• Abstract summary: The proposed technique was compared with state-of-the-art ensemble methods using three benchmark datasets and one synthetic dataset. Four classification performance measures are used to evaluate the proposed method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ensemble methods are meta-algorithms that combine several base machine learning techniques to increase the effectiveness of the classification. Many existing committees of classifiers use the classifier selection process to determine the optimal set of base classifiers. In this article, we propose the classifiers selection framework with relearning base classifiers. Additionally, we use in the proposed framework the new generated feature, which can be obtained after the relearning process. The proposed technique was compared with state-of-the-art ensemble methods using three benchmark datasets and one synthetic dataset. Four classification performance measures are used to evaluate the proposed method.

Related papers

• An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting [53.36437745983783]
  We first construct a max-margin optimization-based model to model potentially non-monotonic preferences. We devise information amount measurement methods and question selection strategies to pinpoint the most informative alternative in each iteration. Two incremental preference elicitation-based algorithms are developed to learn potentially non-monotonic preferences.
  arXiv  Detail & Related papers  (2024-09-04T14:36:20Z)
• Convolutional autoencoder-based multimodal one-class classification [80.52334952912808]
  One-class classification refers to approaches of learning using data from a single class only. We propose a deep learning one-class classification method suitable for multimodal data.
  arXiv  Detail & Related papers  (2023-09-25T12:31:18Z)
• Anomaly Detection using Ensemble Classification and Evidence Theory [62.997667081978825]
  We present a novel approach for novel detection using ensemble classification and evidence theory. A pool selection strategy is presented to build a solid ensemble classifier. We use uncertainty for the anomaly detection approach.
  arXiv  Detail & Related papers  (2022-12-23T00:50:41Z)
• An Evolutionary Approach for Creating of Diverse Classifier Ensembles [11.540822622379176]
  We propose a framework for classifier selection and fusion based on a four-step protocol called CIF-E. We implement and evaluate 24 varied ensemble approaches following the proposed CIF-E protocol. Experiments show that the proposed evolutionary approach can outperform the state-of-the-art literature approaches in many well-known UCI datasets.
  arXiv  Detail & Related papers  (2022-08-23T14:23:27Z)
• Clustering-Based Subset Selection in Evolutionary Multiobjective Optimization [11.110675371854988]
  Subset selection is an important component in evolutionary multiobjective optimization (EMO) algorithms. Clustering-based methods have not been evaluated in the context of subset selection from solution sets obtained by EMO algorithms.
  arXiv  Detail & Related papers  (2021-08-19T02:56:41Z)
• Multiple Classifiers Based Maximum Classifier Discrepancy for Unsupervised Domain Adaptation [25.114533037440896]
  We propose to extend the structure of two classifiers to multiple classifiers to further boost its performance. We demonstrate that, on average, adopting the structure of three classifiers normally yields the best performance as a trade-off between the accuracy and efficiency.
  arXiv  Detail & Related papers  (2021-08-02T03:00:13Z)
• Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classification [94.55805516167369]
  We propose a new approach for binary classification from m U-sets for $mge2$. Our key idea is to consider an auxiliary classification task called surrogate set classification (SSC)
  arXiv  Detail & Related papers  (2021-02-01T07:36:38Z)
• Ensemble Learning Based Classification Algorithm Recommendation [8.94752302607367]
  This paper proposes an ensemble learning-based algorithm recommendation method. To evaluate the proposed recommendation method, extensive experiments with 13 well-known candidate classification algorithms and five different kinds of meta-features are conducted on 1090 benchmark classification problems.
  arXiv  Detail & Related papers  (2021-01-15T07:14:51Z)
• Ensemble of Binary Classifiers Combined Using Recurrent Correlation Associative Memories [1.3706331473063877]
  The majority vote is an example of a methodology used to combine classifiers in an ensemble method. We introduce ensemble methods based on recurrent correlation associative memories for binary classification problems.
  arXiv  Detail & Related papers  (2020-09-18T01:16:53Z)
• Learning to Select Base Classes for Few-shot Classification [96.92372639495551]
  We use the Similarity Ratio as an indicator for the generalization performance of a few-shot model. We then formulate the base class selection problem as a submodular optimization problem over Similarity Ratio.
  arXiv  Detail & Related papers  (2020-04-01T09:55:18Z)
• Selecting Relevant Features from a Multi-domain Representation for Few-shot Classification [91.67977602992657]
  We propose a new strategy based on feature selection, which is both simpler and more effective than previous feature adaptation approaches. We show that a simple non-parametric classifier built on top of such features produces high accuracy and generalizes to domains never seen during training.
  arXiv  Detail & Related papers  (2020-03-20T15:44:17Z)

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.