Unsupervised Feature Selection for Efficient Exploration of High Dimensional Data

Arnab Chakrabarti, Abhijeet Das, Michael Cochez, Christoph Quix

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The exponential growth in the ability to generate, capture, and store high dimensional data has driven sophisticated machine learning applications. However, high dimensionality often poses a challenge for analysts to effectively identify and extract relevant features from datasets. Though many feature selection methods have shown good results in supervised learning, the major challenge lies in the area of unsupervised feature selection. For example, in the domain of data visualization, high-dimensional data is difficult to visualize and interpret due to the limitations of the screen, resulting in visual clutter. Visualizations are more interpretable when visualized in a low dimensional feature space. To mitigate these challenges, we present an approach to perform unsupervised feature clustering and selection using our novel graph clustering algorithm based on Clique-Cover Theory. We implemented our approach in an interactive data exploration tool which facilitates the exploration of relationships between features and generates interpretable visualizations.
Original languageUndefined/Unknown
Title of host publicationAdvances in Databases and Information Systems
EditorsLadjel Bellatreche, Marlon Dumas, Panagiotis Karras, Raimundas Matulevičius
Place of PublicationCham
PublisherSpringer International Publishing
Pages183-197
Number of pages15
ISBN (Print)978-3-030-82472-3
StatePublished - Aug 1 2021
Externally publishedYes
  • DL: ICAI Discovery Lab

    van Harmelen, F., De Rijke, M., Siebert, M., Hoekstra, R., Tsatsaronis, G., Groth, P., Cochez, M., Pernisch, R., Alivanistos, D., Mansoury, M., van Hoof, H., Pal, V., Pijnenburg, T., Mitra, P., Bey, T. & de Waard, A.

    10/1/1903/31/25

    Project: Research

Cite this