Efficient approximation for counting of formal concepts generated from formal context
The number of formal concepts generated from the input context is an important parameter in the cost functions of concept formation algorithms. The calculation of concept count for any arbitrary context is a hard, NP-complete problem and only rough approximation methods can be found in the literatur...
Uloženo v:
| Vydáno v: | Mathematical notes (Miskolci Egyetem (Hungary)) Ročník 19; číslo 2; s. 983 - 996 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Miskolc
University of Miskolc
2018
|
| Témata: | |
| ISSN: | 1787-2405, 1787-2413 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The number of formal concepts generated from the input context is an important parameter in the cost functions of concept formation algorithms. The calculation of concept count for any arbitrary context is a hard, NP-complete problem and only rough approximation methods can be found in the literature to solve this problem. This paper introduces an efficient numerical approximation algorithm for contexts where attribute probabilities are independent from the objects instances. The preconditions required by the approximation method are usually met in the FCA applications, thus the proposed method provides an efficient tool for practical complexity analysis, too. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1787-2405 1787-2413 |
| DOI: | 10.18514/MMN.2018.2529 |