Unsupervised feature selection for efficient exploration of high dimensional data

DOI10.1007/978-3-030-82472-3_14MaRDI QIDQ2140450zbMATH OpenOpenAlexFDO

Authors Arnab Chakrabarti, Abhijeet Das, Michael Cochez, Christoph Quix

Publication date 20 May 2022

Full work available at URL https://doi.org/10.1007/978-3-030-82472-3_14

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)

Recommendations

• Unsupervised feature selection based on kernel Fisher discriminant analysis and regression learning
• Unsupervised feature selection using clustering ensembles and population based incremental learning algorithm
• Hierarchical fuzzy filter method for unsupervised feature selection
• Ensemble feature selection for high dimensional data: a new method and a comparative study
• Scalable and flexible unsupervised feature selection

Cites work

• An Analysis of Some Graph Theoretical Cluster Techniques
• Data reduction and exact algorithms for clique cover
• Finding a Maximum Independent Set
• Image Segmentation by Dominant Sets
• The Representation of a Graph by Set Intersections
• Theoretical and empirical analysis of ReliefF and RReliefF

Cited in

(4)

• Integrated analysis and hypothesis testing for complex spatio-temporal data
• scientific article; zbMATH DE number 6378115 (Why is no real title available?)
• scientific article; zbMATH DE number 6719239 (Why is no real title available?)
• Computational Science - ICCS 2004

Describes a project that uses

Uses Software

• ReliefF
• ranger

This page was built for publication: Unsupervised feature selection for efficient exploration of high dimensional data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140450)