Unsupervised Feature Selection for Efficient Exploration of High Dimensional Data. Chakrabarti, A., Das, A., Cochez, M., & Quix, C. In Bellatreche, L., Dumas, M., Karras, P., & Matulevičius, R., editors, Advances in Databases and Information Systems, pages 183–197, Cham, 2021. Springer International Publishing.
Unsupervised Feature Selection for Efficient Exploration of High Dimensional Data [pdf]Paper  abstract   bibtex   
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.

Downloads: 0