IVFS: Simple and Efficient Feature Selection for High Dimensional Topology Preservation
Feature selection is an important tool to deal with high dimensional data. In unsupervised case, many popular algorithms aim at maintaining the structure of the original data. In this paper, we propose a simple and effective feature selection algorithm to enhance sample similarity preservation through a new perspective, topology preservation, which is represented by persistent diagrams from the context of computational topology. This method is designed upon a unified feature selection framework called IVFS, which is inspired by random subset method. The scheme is flexible and can handle cases where the problem is analytically intractable. The proposed algorithm is able to well preserve the pairwise distances, as well as topological patterns, of the full data. We demonstrate that our algorithm can provide satisfactory performance under a sharp sub-sampling rate, which supports efficient implementation of our proposed method to large scale datasets. Extensive experiments validate the effectiveness of the proposed feature selection scheme.
Code (1)
Tasks
feature selectionVocal Bursts Intensity PredictionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Reproduction of IVFS algorithm for high-dimensional topology preservation feature selection
Feature selection is a crucial technique for handling high-dimensional data. In unsupervised scenarios, many popular algorithms focus on preserving the original data structure. In this paper, we reproduce the IVFS algori…
feature selectionA Possibility Distribution Based Multi-Criteria Decision Algorithm for Resilient Supplier Selection Problems
Thus far, limited research has been performed on resilient supplier selection - a problem that requires simultaneous consideration of a set of numerical and linguistic evaluation criteria, which are substantially differe…
Decision MakingHiFiVFS: High Fidelity Video Face Swapping
Face swapping aims to generate results that combine the identity from the source with attributes from the target. Existing methods primarily focus on image-based face swapping. When processing videos, each frame is handl…
AttributeFace SwappingSFE: A Simple, Fast and Efficient Feature Selection Algorithm for High-Dimensional Data
In this paper, a new feature selection algorithm, called SFE (Simple, Fast, and Efficient), is proposed for high-dimensional datasets. The SFE algorithm performs its search process using a search agent and two operators:…
feature selectionChallenges of Feature Selection for Big Data Analytics
We are surrounded by huge amounts of large-scale high dimensional data. It is desirable to reduce the dimensionality of data for many learning tasks due to the curse of dimensionality. Feature selection has shown its eff…
feature selection