Unsupervised Feature Selection Based on the Morisita Estimator of Intrinsic Dimension
Jean Golay, Mikhail Kanevski

TL;DR
This paper introduces a novel filter feature selection algorithm based on the Morisita estimator of Intrinsic Dimension, effectively reducing data dimensionality while preserving relevant information, especially in highly non-linear datasets.
Contribution
It presents an advanced fractal dimension reduction technique utilizing the Morisita estimator for intrinsic dimension, improving feature selection in complex data.
Findings
Successfully tested on simulated and real datasets
Significant dimensionality reduction without information loss
Outperforms benchmark feature selection methods
Abstract
This paper deals with a new filter algorithm for selecting the smallest subset of features carrying all the information content of a data set (i.e. for removing redundant features). It is an advanced version of the fractal dimension reduction technique, and it relies on the recently introduced Morisita estimator of Intrinsic Dimension (ID). Here, the ID is used to quantify dependencies between subsets of features, which allows the effective processing of highly non-linear data. The proposed algorithm is successfully tested on simulated and real world case studies. Different levels of sample size and noise are examined along with the variability of the results. In addition, a comprehensive procedure based on random forests shows that the data dimensionality is significantly reduced by the algorithm without loss of relevant information. And finally, comparisons with benchmark feature…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Evolutionary Algorithms and Applications · Face and Expression Recognition
