RP-Tree

swMATHMaRDI QIDQ30713FDO

Official website http://link.springer.com/chapter/10.1007%2F978-3-642-23544-3_21

Cited in

(6)

• A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets
• BLOSOM
• TitanicOR
• Carpenter
• COBBLER
• Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data

This page was built for software: RP-Tree