Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)

14Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In data mining, visual representation can help in enhancing the ability of analyzing and understanding the techniques, patterns and their integration. Recently, there are varieties of visualizers have been proposed in marketplace and knowledge discovery communities. However, the detail visualization processes for constructing any incremental tree data structure from its original dataset are rarely presented. Essentially, graphic illustrations of the complex processes are easier to be understood as compared to the complex computer pseudocode. Therefore, this paper explains the visualization process of constructing our incremental Disorder Support Trie Itemset (DOSTrieIT) data structure from the flat-file dataset. DOSTrieIT can be used later as a compressed source of information for building Frequent Pattern Tree (FP-Tree). To ensure understandability, an appropriate dataset and its processes are graphically presented and details explained. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Abdullah, Z., Herawan, T., & Deris, M. M. (2011). Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7066 LNCS, pp. 183–195). https://doi.org/10.1007/978-3-642-25191-7_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free