Triadic formal concept analysis and triclustering: searching for optimal patterns

DOI10.1007/S10994-015-5487-YMaRDI QIDQ890322zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1222703 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 756187 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 2243401 (Why is no real title available?)
• A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
• Biclustering meets triadic concept analysis
• Can triconcepts become triclusters?
• Closed and noise-tolerant patterns in \(n\)-ary relations
• Comparing performance of algorithms for generating concept lattices
• Concept Lattices
• Constrained latent class analysis of three-way three-mode data
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Hypotheses and version spaces
• Impact of Boolean factorization as preprocessing methods for classification of Boolean data
• Inducing decision trees via concept lattices1
• Inductive Logic Programming
• Interesting pattern mining in multi-relational data
• Mathematical classification and clustering
• Multi-way set enumeration in weight tensors
• ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS
• Optimal factorization of three-way binary data using triadic concepts
• Polyadic concept analysis
• SPADE: An efficient algorithm for mining frequent sequences
• The Complexity of Enumeration and Reliability Problems
• The basic theorem of triadic concept analysis
• Using FCA for Encoding Closure Operators into Neural Networks
• Using concept lattices for text retrieval and mining
• XRules: an effective algorithm for structural classification of XML data

Cited in

(14)

• 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
• Classification based on formal concept analysis and biclustering: possibilities of the approach
• Triclusters of close values for the analysis of 3D data
• 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
• On the complexity of implementing logical supervised classification procedures
• Formal Concept Analysis and Extensions for Complex Data Analytics

Describes a project that uses

Uses Software

• XRules
• BicAT
• SPADE

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)