Two FCA-Based Methods for Mining Gene Expression Data

DOI10.1007/978-3-642-01815-2_19zbMath1248.68408OpenAlexW1572812727WikidataQ57274417 ScholiaQ57274417MaRDI QIDQ3630247

Mehdi Kaytoue, Amedeo Napoli, Sébastien Duplessis, Sergei O. Kuznetsov

Publication date: 3 June 2009

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01815-2_19

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Genetics and epigenetics (92D10)

Related Items (12)

Metric generalization of classification algorithms based on formal concept analysis ⋮ Interface between logical analysis of data and formal concept analysis ⋮ A general theory of concept lattice with tractable implication exploration ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Scaling dimension ⋮ L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size ⋮ Gene Expression Array Exploration Using $\mathcal{K}$ -Formal Concept Analysis ⋮ Biclustering Numerical Data in Formal Concept Analysis ⋮ A greedy clustering algorithm based on interval pattern concepts and the problem of optimal box positioning ⋮ Biclustering meets triadic concept analysis ⋮ Viewing Morphisms Between Pattern Structures via Their Concept Lattices and via Their Representations ⋮ Decision concept lattice vs. decision trees and random forests

This page was built for publication: Two FCA-Based Methods for Mining Gene Expression Data