Biclustering meets triadic concept analysis
From MaRDI portal
Publication:2248533
Recommendations
Cites work
- Biclustering numerical data in formal concept analysis
- Comparing performance of algorithms for generating concept lattices
- Comparison of data structures for computing formal concepts
- Concept Lattices
- Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 2205355 (Why is no real title available?)
- Mathematical classification and clustering
- Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery
- Polyadic concept analysis
- Similarity measures in formal concept analysis
- The ParTriCluster algorithm for gene expression analysis
- Two FCA-Based Methods for Mining Gene Expression Data
- Why can concept lattices support knowledge discovery in databases?
Cited in
(12)- Classification based on formal concept analysis and biclustering: possibilities of the approach
- Computing triadic generators and association rules from triadic contexts
- Triclusters of close values for the analysis of 3D data
- Bireducts with tolerance relations
- Enumerating all maximal biclusters in numerical datasets
- A knowledge reduction approach for linguistic concept formal context
- Biclustering numerical data in formal concept analysis
- Two FCA-Based Methods for Mining Gene Expression Data
- Lattice-based biclustering using partition pattern structures
- Can triconcepts become triclusters?
- Formal concept analysis: from knowledge discovery to knowledge processing
- Triadic formal concept analysis and triclustering: searching for optimal patterns
This page was built for publication: Biclustering meets triadic concept analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248533)