Triadic formal concept analysis and triclustering: searching for optimal patterns

DOI10.1007/S10994-015-5487-YzbMATH Open1343.68196OpenAlexW2036590598MaRDI QIDQ890322FDOQ890322

Authors: Dmitry I. Ignatov, Dmitry V. Gnatyshak, Sergei O. Kuznetsov, Boris 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

Recommendations

• Can triconcepts become triclusters?
• Biclustering meets triadic concept analysis
• Pattern discovery in triadic contexts
• Optimal factorization of three-way binary data using triadic concepts
• Algorithms for computation of concept trilattice of triadic fuzzy context

zbMATH Keywords

formal concept analysispattern miningmulti-way setsuboptimal solutionstriadic datatriclusteringtripartite graphs

Mathematics Subject Classification ID

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

Cites Work

• SPADE: An efficient algorithm for mining frequent sequences
• XRules: an effective algorithm for structural classification of XML data
• A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
• Title not available (Why is that?)
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Optimal factorization of three-way binary data using triadic concepts
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comparing performance of algorithms for generating concept lattices
• Title not available (Why is that?)
• Mathematical classification and clustering
• The Complexity of Enumeration and Reliability Problems
• Constrained latent class analysis of three-way three-mode data
• Polyadic concept analysis
• The basic theorem of triadic concept analysis
• Interesting pattern mining in multi-relational data
• Title not available (Why is that?)
• Multi-way set enumeration in weight tensors
• Title not available (Why is that?)
• Hypotheses and version spaces
• Concept Lattices
• Biclustering meets triadic concept analysis
• Impact of Boolean factorization as preprocessing methods for classification of Boolean data
• Closed and noise-tolerant patterns in \(n\)-ary relations
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Can triconcepts become triclusters?
• Inductive Logic Programming
• Using concept lattices for text retrieval and mining

Cited In (13)

• Computing triadic generators and association rules from triadic contexts
• Polyadic relational concept analysis
• Formal concept analysis: from knowledge discovery to knowledge processing
• On interestingness measures of formal concepts
• A knowledge reduction approach for linguistic concept formal context
• Can triconcepts become triclusters?
• A comprehensive survey on formal concept analysis, its research trends and applications
• Triclusters of close values for the analysis of 3D data
• Classification based on formal concept analysis and biclustering: possibilities of the approach
• On closure operators related to maximal tricliques in tripartite hypergraphs
• A Formal Learning Theory for Three-Way Clustering
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques
• Formal Concept Analysis and Extensions for Complex Data Analytics

Uses Software

• SPADE
• BicAT
• XRules

This page was built for publication: Triadic formal concept analysis and triclustering: searching for optimal patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890322)