Analysis of feature weighting methods based on feature ranking methods for classification

Authors:
Norbert Jankowski;Krzysztof Usowicz
Affiliations:
Department of Informatics, Nicolaus Copernicus University, Toruń, Poland;Department of Informatics, Nicolaus Copernicus University, Toruń, Poland
Venue:
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Year:
2011

Citing 9
Cited 0

A Nearest Hyperrectangle Learning Method

Machine Learning
Trading MIPS and memory for knowledge engineering

Communications of the ACM
C4.5: programs for machine learning

C4.5: programs for machine learning
A Review and Empirical Evaluation of Feature Weighting Methods for aClass of Lazy Learning Algorithms

Artificial Intelligence Review - Special issue on lazy learning
An introduction to variable and feature selection

The Journal of Machine Learning Research
Feature Selection with Decision Tree Criterion

HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
A parameterless feature ranking algorithm based on MI

Neurocomputing
A hybrid genetic algorithm for classification

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
The feature selection problem: traditional methods and a new algorithm

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and analyze new fast feature weighting algorithms based on different types of feature ranking. Feature weighting may be much faster than feature selection because there is no need to find cut-threshold in the raking. Presented weighting schemes may be combined with several distance based classifiers like SVM, kNN or RBF network (and not only). Results shows that such method can be successfully used with classifiers.