Using congruence relations to extract knowledge from concept lattices
| Autor: | Rokia Missaoui, Karell Bertet, Jean-François Viaud, Christophe Demko |
|---|---|
| Přispěvatelé: | Laboratoire Informatique, Image et Interaction - EA 2118 (L3I), Université de La Rochelle (ULR), Université du Québec en Outaouais (UQO) |
| Rok vydání: | 2018 |
| Předmět: |
Pure mathematics
Applied Mathematics Computation 0102 computer and information sciences 02 engineering and technology Congruence relation 01 natural sciences Congruence lattice problem [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] Exponential function Algebra 010201 computation theory & mathematics Lattice (order) 0202 electrical engineering electronic engineering information engineering Formal concept analysis Discrete Mathematics and Combinatorics 020201 artificial intelligence & image processing Lattice Miner ComputingMilieux_MISCELLANEOUS Mathematics |
| Zdroj: | Discrete Applied Mathematics Discrete Applied Mathematics, Elsevier, 2018, 249, pp.135-150. ⟨10.1016/j.dam.2016.11.021⟩ |
| ISSN: | 0166-218X |
| Popis: | It is well-known inside the Formal Concept Analysis (FCA) community that a concept lattice could have an exponential size with respect to the input data. Hence, the size of concept lattices is a critical issue in large real-life data sets. In this paper, we propose to investigate congruence relations as a tool to get meaningful parts of the whole lattice or its implication basis. This paper presents two main theoretical contributions, namely two context (or lattice) decompositions based on congruence relations and new results about implication computation after decomposition. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect