Trie: An alternative data structure for data mining algorithms

DOI10.1016/0895-7177(03)90058-6MaRDI QIDQ596954zbMATH OpenOpenAlexFDO

Authors F. Bodon, Lajos Rónyai

Publication date 6 August 2004

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0895-7177(03)90058-6

zbMATH Keywords

Data miningFrequent itemsetHash-treeTrie

Mathematics Subject Classification ID

Data structures (68P05) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 2099992
• Frequent subtree mining -- an overview
• New trie data structures which support very fast search operations
• Algorithms for trie compaction
• scientific article; zbMATH DE number 1954170

Cited in

(2)

• Upper bound on the size of FP-tree
• scientific article; zbMATH DE number 2099992 (Why is no real title available?)

This page was built for publication: Trie: An alternative data structure for data mining algorithms

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