Mutual Information-Based Unsupervised Feature Transformation for Heterogeneous Feature Subset Selection
Conventional mutual information (MI) based feature selection (FS) methods are unable to handle heterogeneous feature subset selection properly because of data format differences or estimation methods of MI between feature subset and class label. A way to solve this problem is feature transformation (FT). In this study, a novel unsupervised feature transformation (UFT) which can transform non-numerical features into numerical features is developed and tested. The UFT process is MI-based and independent of class label. MI-based FS algorithms, such as Parzen window feature selector (PWFS), minimum redundancy maximum relevance feature selection (mRMR), and normalized MI feature selection (NMIFS), can all adopt UFT for pre-processing of non-numerical features. Unlike traditional FT methods, the proposed UFT is unbiased while PWFS is utilized to its full advantage. Simulations and analyses of large-scale datasets showed that feature subset selected by the integrated method, UFT-PWFS, outperformed other FT-FS integrated methods in classification accuracy.
Code (0)
등록된 구현이 없습니다.
Tasks
feature selectionSimilar Papers 제목 키워드 기반
TopoTER: Unsupervised Learning of Topology Transformation Equivariant Representations
We present the Topology Transformation Equivariant Representation (TopoTER) learning, a general paradigm of unsupervised learning of node representations of graph data for the wide applicability to Graph Convolutional Ne…
Graph ClassificationEstimating Mutual Information between Time Series and Temporal Event Sequences Across Diverse Analysis Tasks
Pairwise dependence measures such as correlation and causality are fundamental to temporal data mining, yet there is still no principled and robust way to quantify dependence between heterogeneous data types, especially …
Time Series ForecastingSelf-Supervised Graph Representation Learning via Topology Transformations
We present the Topology Transformation Equivariant Representation learning, a general paradigm of self-supervised learning for node representations of graph data to enable the wide applicability of Graph Convolutional Ne…
Graph ClassificationGraph Representation LearningLink PredictionNode Classification+2AVT: Unsupervised Learning of Transformation Equivariant Representations by Autoencoding Variational Transformations
The learning of Transformation-Equivariant Representations (TERs), which is introduced by Hinton et al. \cite{hinton2011transforming}, has been considered as a principle to reveal visual structures under various transfor…
DecoderGraph Representation Learning via Graphical Mutual Information Maximization
The richness in the content of various information networks such as social networks and communication networks provides the unprecedented potential for learning high-quality expressive representations without external su…
Graph Representation LearningLink PredictionMutual Information EstimationNode Classification+1