Lattice-based biclustering using partition pattern structures

zbMATH Open1366.68301MaRDI QIDQ5282974FDOQ5282974

Authors: Victor Codocedo, Amedeo Napoli 

Publication date: 18 July 2017

Full work available at URL: http://ebooks.iospress.nl/volumearticle/36942

Recommendations

• Biclustering numerical data in formal concept analysis
• Biclustering meets triadic concept analysis
• Enumerating all maximal biclusters in numerical datasets
• Biclustering in data mining
• Boolean Representation for Exact Biclustering

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Knowledge representation (68T30)

Cited In (10)

• Reflexive regular equivalence for bipartite data
• Two FCA-Based Methods for Mining Gene Expression Data
• Advances in Intelligent Data Analysis VI
• Formal concept analysis: from knowledge discovery to knowledge processing
• Bicluster Analysis of Currency Exchange Rates
• Biclustering numerical data in formal concept analysis
• Using Formal Concept Analysis for the Extraction of Groups of Co-expressed Genes
• Enumerating all maximal biclusters in numerical datasets
• Biclustering meets triadic concept analysis
• Experiments on \(F\)-restricted bi-pattern mining

This page was built for publication: Lattice-based biclustering using partition pattern structures

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