A Diverse Meta Learning Ensemble Technique to Handle Imbalanced Microarray Dataset

2015 ◽  
pp. 1-13 ◽  
Author(s):  
Sujata Dash
Keyword(s):  
Microarray Dataset ◽  
Ensemble Technique ◽  
Meta Learning

IMPROVING SUPERVISED LEARNING BY SAMPLE DECOMPOSITION

2005 ◽  
Vol 05 (01) ◽  
pp. 37-53 ◽  
Author(s):  
LIOR ROKACH ◽  
ODED MAIMON ◽  
OMRI ARAD
Keyword(s):  
Clustering Algorithm ◽  
Training Set ◽  
Ensemble Of Classifiers ◽  
Ensemble Technique ◽  
Tuning Parameters ◽  
C4.5 Algorithm ◽  
Meta Learning ◽  
Sample Decomposition ◽  
Instance Space ◽  
Entire Dataset

This paper introduces a new ensemble technique, cluster-based concurrent decomposition (CBCD) that induces an ensemble of classifiers by decomposing the training set into mutually exclusive sub-samples of equal-size. The CBCD algorithm first clusters the instance space by using the K-means clustering algorithm. Afterwards it produces disjoint sub-samples using the clusters in such a way that each sub-sample is comprised of tuples from all clusters and hence represents the entire dataset. An induction algorithm is applied in turn to each subset, followed by a voting mechanism that combines the classifier's predictions. The CBCD algorithm has two tuning parameters: the number of clusters and the number of subsets to create. Using a suitable meta-learning it is possible to tune these parameters properly. In the experimental study we conducted, the CBCD algorithm, using an embedded C4.5 algorithm, outperformed the bagging algorithm of the same computational complexity.

scholarly journals Meta Learning-Based Hybrid Ensemble Approach for Short-Term Wind Speed Forecasting

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 172859-172868
Author(s):  
Zhengwei Ma ◽  
Sensen Guo ◽  
Gang Xu ◽  
Saddam Aziz
Keyword(s):  
Wind Speed ◽  
Short Term ◽  
Wind Speed Forecasting ◽  
Ensemble Approach ◽  
Meta Learning

scholarly journals SAR Target Recognition via Meta-Learning and Amortized Variational Inference

Sensors ◽  
2020 ◽  
Vol 20 (20) ◽  
pp. 5966
Author(s):  
Ke Wang ◽  
Gong Zhang
Keyword(s):  
Target Recognition ◽  
Probability Distributions ◽  
Automatic Target Recognition ◽  
Variational Inference ◽  
Training Data ◽  
Superior Performance ◽  
Small Data ◽  
Meta Learning ◽  
Radar Automatic Target Recognition ◽  
Global Parameters

The challenge of small data has emerged in synthetic aperture radar automatic target recognition (SAR-ATR) problems. Most SAR-ATR methods are data-driven and require a lot of training data that are expensive to collect. To address this challenge, we propose a recognition model that incorporates meta-learning and amortized variational inference (AVI). Specifically, the model consists of global parameters and task-specific parameters. The global parameters, trained by meta-learning, construct a common feature extractor shared between all recognition tasks. The task-specific parameters, modeled by probability distributions, can adapt to new tasks with a small amount of training data. To reduce the computation and storage cost, the task-specific parameters are inferred by AVI implemented with set-to-set functions. Extensive experiments were conducted on a real SAR dataset to evaluate the effectiveness of the model. The results of the proposed approach compared with those of the latest SAR-ATR methods show the superior performance of our model, especially on recognition tasks with limited data.

Sign in / Sign up

Export Citation Format

Share Document