%0 Conference Paper %1 10.1007/978-3-030-86982-3_10 %A Dürrschnabel, Dominik %A Koyda, Maren %A Stumme, Gerd %B Graph-Based Representation and Reasoning %C Cham %D 2021 %E Braun, Tanya %E Gehrke, Marcel %E Hanika, Tom %E Hernandez, Nathalie %I Springer International Publishing %K %P 127--141 %T Attribute Selection Using Contranominal Scales %X Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce \$\$\backslashdelta \$\$$\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that \$\$\backslashdelta \$\$$\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures. %@ 978-3-030-86982-3

@inproceedings{10.1007/978-3-030-86982-3_10, abstract = {Formal Concept Analysis (FCA) allows to analyze binary data by deriving concepts and ordering them in lattices. One of the main goals of FCA is to enable humans to comprehend the information that is encapsulated in the data; however, the large size of concept lattices is a limiting factor for the feasibility of understanding the underlying structural properties. The size of such a lattice depends on the number of subcontexts in the corresponding formal context that are isomorphic to a contranominal scale of high dimension. In this work, we propose the algorithm ContraFinder that enables the computation of all contranominal scales of a given formal context. Leveraging this algorithm, we introduce {\$}{\$}{\backslash}delta {\$}{\$}$\delta$-adjusting, a novel approach in order to decrease the number of contranominal scales in a formal context by the selection of an appropriate attribute subset. We demonstrate that {\$}{\$}{\backslash}delta {\$}{\$}$\delta$-adjusting a context reduces the size of the hereby emerging sub-semilattice and that the implication set is restricted to meaningful implications. This is evaluated with respect to its associated knowledge by means of a classification task. Hence, our proposed technique strongly improves understandability while preserving important conceptual structures.}, added-at = {2023-12-13T10:50:39.000+0100}, address = {Cham}, author = {D{\"u}rrschnabel, Dominik and Koyda, Maren and Stumme, Gerd}, biburl = {https://www.bibsonomy.org/bibtex/2b1725dbe8fe5c797ed261be4e078d79f/admin}, booktitle = {Graph-Based Representation and Reasoning}, editor = {Braun, Tanya and Gehrke, Marcel and Hanika, Tom and Hernandez, Nathalie}, interhash = {db5ede55fd1575cabb43ba5869616831}, intrahash = {b1725dbe8fe5c797ed261be4e078d79f}, isbn = {978-3-030-86982-3}, keywords = {}, pages = {127--141}, publisher = {Springer International Publishing}, timestamp = {2023-12-13T10:50:39.000+0100}, title = {Attribute Selection Using Contranominal Scales}, year = 2021 }