An efficient method for constructing an I-tree

MaRDI QIDQ2998618zbMATH OpenFDO

Authors Mala Dutta, Anjana Kakoti Mahanta

Publication date 18 May 2011

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• New frequent pattern tree structure
• The interval B-tree
• Inverse Frequent Itemset Mining Based on FP-Tree
• Finding All Minimal Infrequent Multi-dimensional Intervals
• Interval finding and its application to data mining

Cited in

(1)

• Constructing a binary tree efficiently from its traversals

This page was built for publication: An efficient method for constructing an I-tree

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