Relevant Attributes in Formal Contexts
Preprint
Abstract
Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task. There are various approaches to deal with this, e.g., random sampling, parallelization, or attribute extraction. A so far not investigated method in the realm of formal concept analysis is attribute selection, as done in machine learning. Building up on this we introduce a method for attribute selection in formal contexts. To this end, we propose the notion of relevant attributes which enables us to define a relative relevance function, reflecting both the order structure of the concept lattice as well as distribution of objects on it. Finally, we overcome computational challenges for computing the relative relevance through an approximation approach based on information entropy.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Towards a granular computing approach based on Formal Concept Analysis for discovering periodicities in dataKnowledge-Based Systems, 2018
- Knowledge discovery in data using formal concept analysis and random projectionsInternational Journal of Applied Mathematics and Computer Science, 2011
- On the complexity of enumerating pseudo-intentsDiscrete Applied Mathematics, 2011
- The social bookmark and publication management system bibsonomyThe VLDB Journal, 2010
- Attribute-incremental construction of the canonical implication basisAnnals of Mathematics and Artificial Intelligence, 2007
- A graph distance metric based on the maximal common subgraphPattern Recognition Letters, 1998
- Selection of relevant features and examples in machine learningArtificial Intelligence, 1997
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logicFuzzy Sets and Systems, 1997
- On generating all maximal independent setsInformation Processing Letters, 1988