Two FCA-Based Methods for Mining Gene Expression Data
From MaRDI portal
Recommendations
- Using Formal Concept Analysis for the Extraction of Groups of Co-expressed Genes
- scientific article; zbMATH DE number 5041452
- Gene expression array exploration using \(\mathcal{K}\)-formal concept analysis
- Lattice-based biclustering using partition pattern structures
- Biclustering meets triadic concept analysis
Cited in
(15)- Decision concept lattice vs. decision trees and random forests
- Interface between logical analysis of data and formal concept analysis
- A general theory of concept lattice with tractable implication exploration
- L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size
- Biclustering meets triadic concept analysis
- Metric generalization of classification algorithms based on formal concept analysis
- Gene expression array exploration using \(\mathcal{K}\)-formal concept analysis
- Biclustering numerical data in formal concept analysis
- Viewing morphisms between pattern structures via their concept lattices and via their representations
- Using Formal Concept Analysis for the Extraction of Groups of Co-expressed Genes
- Constraint-Based Mining and Inductive Databases
- Pruning techniques in lincbo for the computation of the duquenne-guigues basis
- Scaling dimension
- A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning
- Data mining methods for gene selection on the basis of gene expression arrays
This page was built for publication: Two FCA-Based Methods for Mining Gene Expression Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630247)
