@InProceedings{chakrabarti2021feature-selection,
author="Chakrabarti, Arnab
and Das, Abhijeet
and Cochez, Michael
and Quix, Christoph",
editor="Bellatreche, Ladjel
and Dumas, Marlon
and Karras, Panagiotis
and Matulevi{\v{c}}ius, Raimundas",
title="Unsupervised Feature Selection for Efficient Exploration of High Dimensional Data",
booktitle="Advances in Databases and Information Systems",
year="2021",
publisher="Springer International Publishing",
address="Cham",
pages="183--197",
url={https://www.cochez.nl/papers/feature_selection_for_exploration.pdf},
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.",
isbn="978-3-030-82472-3"
}

{"_id":"F9KtzbyeyWqK5dqow","bibbaseid":"chakrabarti-das-cochez-quix-unsupervisedfeatureselectionforefficientexplorationofhighdimensionaldata-2021","author_short":["Chakrabarti, A.","Das, A.","Cochez, M.","Quix, C."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Chakrabarti"],"firstnames":["Arnab"],"suffixes":[]},{"propositions":[],"lastnames":["Das"],"firstnames":["Abhijeet"],"suffixes":[]},{"propositions":[],"lastnames":["Cochez"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Quix"],"firstnames":["Christoph"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Bellatreche"],"firstnames":["Ladjel"],"suffixes":[]},{"propositions":[],"lastnames":["Dumas"],"firstnames":["Marlon"],"suffixes":[]},{"propositions":[],"lastnames":["Karras"],"firstnames":["Panagiotis"],"suffixes":[]},{"propositions":[],"lastnames":["Matulevičius"],"firstnames":["Raimundas"],"suffixes":[]}],"title":"Unsupervised Feature Selection for Efficient Exploration of High Dimensional Data","booktitle":"Advances in Databases and Information Systems","year":"2021","publisher":"Springer International Publishing","address":"Cham","pages":"183–197","url":"https://www.cochez.nl/papers/feature_selection_for_exploration.pdf","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.","isbn":"978-3-030-82472-3","bibtex":"@InProceedings{chakrabarti2021feature-selection,\nauthor=\"Chakrabarti, Arnab\nand Das, Abhijeet\nand Cochez, Michael\nand Quix, Christoph\",\neditor=\"Bellatreche, Ladjel\nand Dumas, Marlon\nand Karras, Panagiotis\nand Matulevi{\\v{c}}ius, Raimundas\",\ntitle=\"Unsupervised Feature Selection for Efficient Exploration of High Dimensional Data\",\nbooktitle=\"Advances in Databases and Information Systems\",\nyear=\"2021\",\npublisher=\"Springer International Publishing\",\naddress=\"Cham\",\npages=\"183--197\",\nurl={https://www.cochez.nl/papers/feature_selection_for_exploration.pdf},\nabstract=\"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.\",\nisbn=\"978-3-030-82472-3\"\n}\n\n","author_short":["Chakrabarti, A.","Das, A.","Cochez, M.","Quix, C."],"editor_short":["Bellatreche, L.","Dumas, M.","Karras, P.","Matulevičius, R."],"key":"chakrabarti2021feature-selection","id":"chakrabarti2021feature-selection","bibbaseid":"chakrabarti-das-cochez-quix-unsupervisedfeatureselectionforefficientexplorationofhighdimensionaldata-2021","role":"author","urls":{"Paper":"https://www.cochez.nl/papers/feature_selection_for_exploration.pdf"},"metadata":{"authorlinks":{}},"downloads":2},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/KRRVU/website/master/publications/krr.bib","dataSources":["H6xuGqu5uQ6rXhdJ4","dJmTXpbSWWjnxatYT","qyx6bB8ujfH9zqTzu","jRiMQcLQ4TWHSS6Mc"],"keywords":[],"search_terms":["unsupervised","feature","selection","efficient","exploration","high","dimensional","data","chakrabarti","das","cochez","quix"],"title":"Unsupervised Feature Selection for Efficient Exploration of High Dimensional Data","year":2021,"downloads":2}