| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
Towards a closure operator for enumeration of maximal tricliques in tripartite hypergraphs | Dmitry I. Ignatov
; | Date: |
23 Feb 2016 | Abstract: | Triadic Formal Concept Analysis (3FCA) was introduced by Lehman and Wille
almost two decades ago, but up-to-date even though that different researchers
actively work on this FCA branch, a proper closure operator for enumeration of
triconcepts, i.e. maximal triadic cliques of tripartite hypergaphs, was not
introduced. In this paper we show that the previously introduced operators for
obtaining triconcepts and maximal connected and complete sets (MCCS) are not
always consistent and provide the reader with a definition of valid closure
operator and associated set system. | Source: | arXiv, 1602.7267 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |