2018
DOI: 10.1016/j.dam.2017.12.032
|View full text |Cite
|
Sign up to set email alerts
|

On closure operators related to maximal tricliques in tripartite hypergraphs

Abstract: Triadic Formal Concept Analysis (3FCA) was introduced by Lehman andWille almost two decades ago. And many researchers work in Data Mining and Formal Concept Analysis using the notions of closed sets, Galois and closure operators, closure systems, but up-to-date even though that different researchers actively work on mining triadic and n-ary relations, 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 t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 22 publications
(44 reference statements)
0
2
0
Order By: Relevance
“…It is possible to mine maximal closed and connected subgraphs in them and interpret them as communities [59]; these patterns coincide with bicliques and formal concepts in two-mode case. However, for higher dimensions such n-partite graphs are not equivalent to n-adic contexts and may result in information loss or phantom hyperedges if we reduce the latter to the former or vice versa [34]. In [29], for analysing such tripartite network composed by two two-mode networks with one shared part, biclusters from these two networks have been used.…”
Section: Related Workmentioning
confidence: 99%
“…It is possible to mine maximal closed and connected subgraphs in them and interpret them as communities [59]; these patterns coincide with bicliques and formal concepts in two-mode case. However, for higher dimensions such n-partite graphs are not equivalent to n-adic contexts and may result in information loss or phantom hyperedges if we reduce the latter to the former or vice versa [34]. In [29], for analysing such tripartite network composed by two two-mode networks with one shared part, biclusters from these two networks have been used.…”
Section: Related Workmentioning
confidence: 99%
“…Such hypergraphs correspond to 3-dimensional Boolean datasets, e.g. data describing objects by sets of attributes under different conditions (not to be mistaken for the notion of condition used in Section 3), and the enumeration of their minimal transversals is involved in the mining of different patterns such as triadic concepts Ignatov et al (2015); Ignatov (2018), implications Ryssel et al (2014); Sertkaya (2009) and association rules Missaoui and Kwuida (2011). This work comes from an interest in bounding the number of triadic concepts as studied in triadic concept analysis Lehmann and Wille (1995).…”
Section: Introductionmentioning
confidence: 99%