Top-down mining of frequent closed patterns from very high dimensional data

DOI10.1016/j.ins.2008.11.033zbMath1162.68561OpenAlexW1979180881MaRDI QIDQ1007893

Dong Xin, Jun He, Hongyan Liu, Zheng Shao, Jiawei Han, Xiao-yu Wang

Publication date: 24 March 2009

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

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

zbMATH Keywords

data miningassociation ruleshigh dimensional datafrequent patterns

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Opportunistic mining of top-\(n\) high utility patterns ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data

Uses Software

• COBBLER
• Carpenter
• CLOSET
• FARMER
• CMAR

Cites Work

• On the strength of hyperclique patterns for text categorization
• Unnamed Item

This page was built for publication: Top-down mining of frequent closed patterns from very high dimensional data