Feature Selection Using Non Linear Feature Relation Index

Authors:
Namita Jain;C. A. Murthy
Affiliations:
Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India;Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India
Venue:
PReMI '09 Proceedings of the 3rd International Conference on Pattern Recognition and Machine Intelligence
Year:
2009

Citing 5
Cited 0

Unsupervised Feature Selection Using Feature Similarity

IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature Selection for Clustering

PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
Pattern Recognition Algorithms for Data Mining: Scalability, Knowledge Discovery, and Soft Granular Computing

Pattern Recognition Algorithms for Data Mining: Scalability, Knowledge Discovery, and Soft Granular Computing
Toward Integrating Feature Selection Algorithms for Classification and Clustering

IEEE Transactions on Knowledge and Data Engineering
Computational Methods of Feature Selection (Chapman & Hall/Crc Data Mining and Knowledge Discovery Series)

Computational Methods of Feature Selection (Chapman & Hall/Crc Data Mining and Knowledge Discovery Series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a dependence measure for a pair of features. This measure aims at identifying redundant features where the relationship between the features is characterized by higher degree polynomials. An algorithm is also proposed to make effective use of this dependence measure for the feature selection. Neither the calculation of dependence measure, nor the algorithm need the class values of the observations. So they can be used for clustering as well as classification.