Triadic formal concept analysis and triclustering: searching for optimal patterns

DOI10.1007/s10994-015-5487-yzbMath1343.68196OpenAlexW2036590598MaRDI QIDQ890322

Dmitry I. Ignatov, Sergei O. Kuznetsov, Dmitry V. Gnatyshak, Boris G. Mirkin

Publication date: 10 November 2015

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-015-5487-y

zbMATH Keywords

formal concept analysispattern miningmulti-way setsuboptimal solutionstriadic datatriclusteringtripartite graphs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ A comprehensive survey on formal concept analysis, its research trends and applications ⋮ Triclusters of close values for the analysis of 3D data ⋮ A knowledge reduction approach for linguistic concept formal context ⋮ On interestingness measures of formal concepts ⋮ Mixed Integer Programming for Searching Maximum Quasi-Bicliques ⋮ On closure operators related to maximal tricliques in tripartite hypergraphs ⋮ Computing triadic generators and association rules from triadic contexts

Uses Software

• SPADE
• BicAT
• XRules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Multi-way set enumeration in weight tensors
• Interesting pattern mining in multi-relational data
• Constrained latent class analysis of three-way three-mode data
• Polyadic concept analysis
• The basic theorem of triadic concept analysis
• Biclustering meets triadic concept analysis
• Impact of Boolean factorization as preprocessing methods for classification of Boolean data
• Optimal factorization of three-way binary data using triadic concepts
• Closed and noise-tolerant patterns in \(n\)-ary relations
• XRules: an effective algorithm for structural classification of XML data
• Mathematical classification and clustering
• ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS
• Using FCA for Encoding Closure Operators into Neural Networks
• Inducing decision trees via concept lattices1
• The Complexity of Enumeration and Reliability Problems
• Comparing performance of algorithms for generating concept lattices
• Can triconcepts become triclusters?
• Inductive Logic Programming
• Conceptual Structures for Knowledge Creation and Communication
• Concept Lattices
• SPADE: An efficient algorithm for mining frequent sequences