Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data

DOI10.1016/j.ins.2014.04.044zbMath1355.68235OpenAlexW1995150322MaRDI QIDQ507623

Renato Vimieiro, Pablo Moscato

Publication date: 7 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.04.044

zbMATH Keywords

formal concept analysismicroarray datafrequent itemset miningclosed itemsetdisjunctive itemsetrare itemset

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (2)

Sampling frequent and minimal Boolean patterns: theory and application in classification ⋮ On Neural Network Architecture Based on Concept Lattices

Uses Software

• UCI-ml
• C4.5
• BLOSOM
• TitanicOR
• RP-Tree
• COBBLER
• Carpenter
• FARMER

Cites Work

• Top-down mining of frequent closed patterns from very high dimensional data
• Computing iceberg concept lattices with Titanic

This page was built for publication: Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data