Attribute selection using contranominal scales

DOI10.1007/978-3-030-86982-3_10MaRDI QIDQ2670898zbMATH OpenOpenAlexFDO

Authors Dominik Dürrschnabel, Maren Koyda, Gerd Stumme

Publication date 1 June 2022

Full work available at URL https://arxiv.org/abs/2106.10978

zbMATH Keywords

attribute selectionconcept latticescontranominal scalesfeature selectionformal concept analysis

Mathematics Subject Classification ID

Knowledge representation (68T30)

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 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 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.

Recommendations

• Attribute Selection in Correspondence Analysis of Incidence Matrices
• Feature selection using expected attainable discrimination
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets and Current Trends in Computing

Cites work

• Algorithm 457: finding all cliques of an undirected graph
• Boolean substructures in formal concept analysis
• Computing iceberg concept lattices with Titanic
• Discovering implicational knowledge in Wikidata
• Exact algorithms for maximum induced matching
• scientific article; zbMATH DE number 3654186 (Why is no real title available?)
• scientific article; zbMATH DE number 33716 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 6157238 (Why is no real title available?)
• On maximum induced matchings in bipartite graphs
• Reducibility among combinatorial problems
• Relevant attributes in formal contexts

Cited in

(9)

• Selective attribute rules
• On the size of \(\exists \)-generalized concept lattices
• Selecting important concepts using weights
• A Parameterized Algorithm for Exploring Concept Lattices
• Lindig’s Algorithm for Concept Lattices over Graded Attributes
• Scalable Visual Analytics in FCA
• Factorizing lattices by interval relations
• Conceptual views on tree ensemble classifiers
• Selection and optimization of cut-points for numeric attribute values

Describes a project that uses

Uses Software

• KONECT
• Algorithm 457
• UCI

This page was built for publication: Attribute selection using contranominal scales

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