Exploiting the Bin-Class Histograms for Feature Selection on Discrete Data

2015 ◽  
pp. 345-353
Author(s):  
Artur J. Ferreira ◽  
Mário A. T. Figueiredo
Keyword(s):  
Feature Selection ◽  
Discrete Data

scholarly journals SimulaD: A Novel Feature Selection Heuristics for Discrete Data

2021 ◽  
Author(s):  
Mohammad Reza Besharati ◽  
Mohammad Izadi
Keyword(s):  
Feature Selection ◽  
Optimization Problem ◽  
Window Size ◽  
Discrete Data ◽  
Simulated Distillation ◽  
Parameters Tuning

By applying a running average (with a window-size= d), we could transform Discrete data to broad-range, Continuous values. When we have more than 2 columns and one of them is containing data about the tags of classification (Class Column), we could compare and sort the features (Non-class Columns) based on the R2 coefficient of the regression for running averages. The parameters tuning could help us to select the best features (the non-class columns which have the best correlation with the Class Column). “Window size” and “Ordering” could be tuned to achieve the goal. this optimization problem is hard and we need an Algorithm (or Heuristics) for simplifying this tuning. We demonstrate a novel heuristics, Called Simulated Distillation (SimulaD), which could help us to gain a somehow good results with this optimization problem.

scholarly journals SimulaD: A Novel Feature Selection Heuristics for Discrete Data

2021 ◽  
Author(s):  
Mohammad Reza Besharati ◽  
Mohammad Izadi
Keyword(s):  
Feature Selection ◽  
Optimization Problem ◽  
Window Size ◽  
Discrete Data ◽  
Simulated Distillation ◽  
Parameters Tuning

By applying a running average (with a window-size= d), we could transform Discrete data to broad-range, Continuous values. When we have more than 2 columns and one of them is containing data about the tags of classification (Class Column), we could compare and sort the features (Non-class Columns) based on the R2 coefficient of the regression for running averages. The parameters tuning could help us to select the best features (the non-class columns which have the best correlation with the Class Column). “Window size” and “Ordering” could be tuned to achieve the goal. this optimization problem is hard and we need an Algorithm (or Heuristics) for simplifying this tuning. We demonstrate a novel heuristics, Called Simulated Distillation (SimulaD), which could help us to gain a somehow good results with this optimization problem.

scholarly journals SimulaD: A Novel Feature Selection Heuristics for Discrete Data

2021 ◽  
Author(s):  
Mohammad Reza Besharati ◽  
Mohammad Izadi
Keyword(s):  
Feature Selection ◽  
Optimization Problem ◽  
Window Size ◽  
Discrete Data ◽  
Simulated Distillation ◽  
Parameters Tuning

By applying a running average (with a window-size= d), we could transform Discrete data to broad-range, Continuous values. When we have more than 2 columns and one of them is containing data about the tags of classification (Class Column), we could compare and sort the features (Non-class Columns) based on the R2 coefficient of the regression for running averages. The parameters tuning could help us to select the best features (the non-class columns which have the best correlation with the Class Column). “Window size” and “Ordering” could be tuned to achieve the goal. this optimization problem is hard and we need an Algorithm (or Heuristics) for simplifying this tuning. We demonstrate a novel heuristics, Called Simulated Distillation (SimulaD), which could help us to gain a somehow good results with this optimization problem.

Integrated Fractional white Noise as an Alternative to Multifractional Brownian Motion

2007 ◽  
Vol 44 (02) ◽  
pp. 393-408 ◽  
Author(s):  
Allan Sly
Keyword(s):  
Stochastic Process ◽  
Brownian Motion ◽  
White Noise ◽  
Gaussian Process ◽  
Discrete Data ◽  
Hölder Exponent ◽  
Scaling Properties ◽  
Multifractional Brownian Motion ◽  
Local Properties

Multifractional Brownian motion is a Gaussian process which has changing scaling properties generated by varying the local Hölder exponent. We show that multifractional Brownian motion is very sensitive to changes in the selected Hölder exponent and has extreme changes in magnitude. We suggest an alternative stochastic process, called integrated fractional white noise, which retains the important local properties but avoids the undesirable oscillations in magnitude. We also show how the Hölder exponent can be estimated locally from discrete data in this model.

Feature Selection Strategies and Perceptual Expertise in Configuration Search Tasks

2011 ◽  
Author(s):  
Lindsey M. Kitchell ◽  
Francisco J. Parada ◽  
Brandi L. Emerick ◽  
Tom A. Busey
Keyword(s):  
Feature Selection ◽  
Perceptual Expertise ◽  
Search Tasks ◽  
Selection Strategies

BLIND FEATURE SELECTION AND EXTRACTION IN A 3D IMAGE CUBE

2012 ◽  
Vol 19 (2) ◽  
pp. 97-111 ◽  
Author(s):  
Muhammad Ahmad ◽  
Syungyoung Lee ◽  
Ihsan Ul Haq ◽  
Qaisar Mushtaq
Keyword(s):  
Feature Selection ◽  
3D Image ◽  
Image Cube

An Enhancement of Feature Selection Algorithm for EDM: A Review

2018 ◽  
Vol 8 (5) ◽  
pp. 29
Author(s):  
Manpreet Kaur ◽  
Chamkaur Singh
Keyword(s):  
Feature Selection ◽  
Educational Data Mining ◽  
Problem Formulation ◽  
Research Area ◽  
Education Quality ◽  
Educational Institutions ◽  
Selection Algorithm ◽  
Positive Role ◽  
Data Set ◽  
Selection Algorithms

Educational Data Mining (EDM) is an emerging research area help the educational institutions to improve the performance of their students. Feature Selection (FS) algorithms remove irrelevant data from the educational dataset and hence increases the performance of classifiers used in EDM techniques. This paper present an analysis of the performance of feature selection algorithms on student data set. .In this papers the different problems that are defined in problem formulation. All these problems are resolved in future. Furthermore the paper is an attempt of playing a positive role in the improvement of education quality, as well as guides new researchers in making academic intervention.

Feature selection of the armature winding broken coils in synchronous motor using genetic algorithm and mahalanobis distance

2012 ◽  
Vol 57 (3) ◽  
pp. 829-835 ◽  
Author(s):  
Z. Głowacz ◽  
J. Kozik
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Mahalanobis Distance ◽  
Distance Measure ◽  
Synchronous Motor ◽  
Medical Diagnostics ◽  
Motor Current ◽  
Feature Spaces ◽  
Multidimensional Feature Spaces ◽  
Selection Of

The paper describes a procedure for automatic selection of symptoms accompanying the break in the synchronous motor armature winding coils. This procedure, called the feature selection, leads to choosing from a full set of features describing the problem, such a subset that would allow the best distinguishing between healthy and damaged states. As the features the spectra components amplitudes of the motor current signals were used. The full spectra of current signals are considered as the multidimensional feature spaces and their subspaces are tested. Particular subspaces are chosen with the aid of genetic algorithm and their goodness is tested using Mahalanobis distance measure. The algorithm searches for such a subspaces for which this distance is the greatest. The algorithm is very efficient and, as it was confirmed by research, leads to good results. The proposed technique is successfully applied in many other fields of science and technology, including medical diagnostics.

Sign in / Sign up

Export Citation Format

Share Document