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

DOI10.1016/J.INS.2014.04.044MaRDI QIDQ507623zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A new algorithm for mining frequent closed patterns in gene expression data sets
• Top-down mining of frequent closed patterns from very high dimensional data
• Depth-first search algorithm for mining frequent closed itemsets
• scientific article; zbMATH DE number 2112391
• Frequent pattern mining from high-dimensional data using record space search

Cites work

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

Cited in

(6)

• On neural network architecture based on concept lattices
• Sampling frequent and minimal Boolean patterns: theory and application in classification
• Frequent pattern mining from high-dimensional data using record space search
• Top-down mining of frequent closed patterns from very high dimensional data
• A new algorithm for mining frequent closed patterns in gene expression data sets
• Depth-first search algorithm for mining frequent closed itemsets

Describes a project that uses

Uses Software

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

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

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