Closed and noise-tolerant patterns in \(n\)-ary relations

DOI10.1007/s10618-012-0284-8zbMath1267.68176OpenAlexW2166265207MaRDI QIDQ2377278

Loïc Cerf, Kim-Ngan T. Nguyen, Jérémy Besson, Jean-François Boulicaut

Publication date: 28 June 2013

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-012-0284-8

zbMATH Keywords

fault-tolerancemulti-way setBoolean tensorcross-graph quasi-clique

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reliability, testing and fault tolerance of networks and computer systems (68M15) Algorithms in computer science (68W99)

Related Items

Triadic formal concept analysis and triclustering: searching for optimal patterns, A parameter-less algorithm for tensor co-clustering, Clustering Boolean tensors, On closure operators related to maximal tricliques in tripartite hypergraphs

Uses Software

• Carpenter

Cites Work

• Multi-way set enumeration in weight tensors
• Reverse search for enumeration
• Mining Constrained Cross-Graph Cliques in Dynamic Networks
• Computing iceberg concept lattices with Titanic
• An Efficient Algorithm for Enumerating Pseudo Cliques
• Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery
• Constraint-Based Mining and Inductive Databases
• Unnamed Item
• Unnamed Item
• Unnamed Item