On closure operators related to maximal tricliques in tripartite hypergraphs

DOI10.1016/j.dam.2017.12.032zbMath1397.05120arXiv1602.07267OpenAlexW2963545203MaRDI QIDQ1800387

Dmitry I. Ignatov

Publication date: 23 October 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.07267

zbMATH Keywords

closure operatorthree-way datatripartite graphsmaximal switching generatorstriadic formal concept analysistriadic hypergraphtriset

Mathematics Subject Classification ID

Hypergraphs (05C65) Knowledge representation (68T30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relational concept analysis: mining concept lattices from multi-relational data
• On the termination of some biclique operators on multipartite graphs
• Interesting pattern mining in multi-relational data
• Listing closed sets of strongly accessible set systems with applications to data mining
• Triadic formal concept analysis and triclustering: searching for optimal patterns
• Polyadic concept analysis
• Complexity of learning in concept lattices from positive and negative examples
• The basic theorem of triadic concept analysis
• Optimal factorization of three-way binary data using triadic concepts
• Closed and noise-tolerant patterns in \(n\)-ary relations
• Ordinal Factor Analysis
• Tri-ordinal Factor Analysis
• Mathematical tools for data mining. Set theory, partial orders, combinatorics

This page was built for publication: On closure operators related to maximal tricliques in tripartite hypergraphs