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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Frawley, W., Piatetsky-Shapiro, G., Matheus, C.: Knowledge Discovery in Databases: An Overview. AI Magazine, 213–228 (Fall 1992)
Hand, D., Mannila, H., Smyth, P.: Principles of Data Mining. MIT Press, Cambridge (2001)
Han, J., Pei, H., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: The Proceedings of the 2000 ACM SIGMOD, pp. 1–12 (2000)
Han, J., Pei, J.: Mining Frequent Pattern without Candidate Itemset Generation: A Frequent Pattern Tree Approach. Data Mining and Knowledge Discovery (8), 53–87 (2004)
Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: The Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pp. 283–286. AAAI Press (1997)
Zheng, Z., Kohavi, R., Mason, L.: Real World Performance of Association Rule Algorithms. In: The Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 401–406. ACM Press (2001)
Agrawal, R., Imielinski, T., Swami, A.: Database Mining: A Performance Perspective. IEEE Transactions on Knowledge and Data Engineering 5(6), 914–925 (1993)
Cheung, W., Zaïane, O.R.: Incremental Mining of Frequent Patterns without Candidate Generation of Support Constraint. In: Proceeding the 7th International Database Engineering and Applications Symposium, IDEAS (2003)
Hong, T.-P., Lin, J.-W., We, Y.-L.: Incrementally Fast Updated Frequent Pattern Trees. International Journal of Expert Systems with Applications 34(4), 2424–2435 (2008)
Tanbeer, S.K., Ahmed, C.F., Jeong, B.S., Lee, Y.K.: Efficient Single-Pass Frequent Pattern Mining Using a Prefix-Tree. Information Science 279, 559–583 (2009)
Totad, S.G., Geeta, R.B., Reddy, P.P.: Batch Processing for Incremental FP-Tree Construction. International Journal of Computer Applications 5(5), 28–32 (2010)
Ankerst, M.: Visual Data Mining with pixel-oriented visualization techniques. In: Proceeding of ACM Special Interest Group on Knowledge Discovery and Data Mining (SIGKDD) Workshop on Visual Data Mining San Francisco (2001)
Yang, X., Asur, S., Parthasarathy, S., Mehta, S.: A visual-analytic toolkit for dynamic interaction graphs. In: The Proceedings of Knowledge Discovery of Database 2008, pp. 1016–1024 (2008)
Munzner, T., Kong, Q., Ng, R.T., Lee, J., Klawe, J., Radulovic, D., Leung, C.K.-S.: Visual mining of power sets with large alphabets, Technical report UBC CS TR-2005-25, Department of Computer Science, The University of British Columbia, Vancouver, BC, Canada (2005)
Leung, C.K.-S., Irani, P.P., Carmichael, C.L.: FIsViz: a Frequent Itemset Visualizer. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 644–652. Springer, Heidelberg (2008)
Leung, C.K.-S., Carmichael, C.L.: FpViz: A visualizer for frequent pattern mining. In: The Proceedings of VAKD 2009, pp. 30–39 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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: Badioze Zaman, H., et al. Visual Informatics: Sustaining Research and Innovations. IVIC 2011. Lecture Notes in Computer Science, vol 7066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25191-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-25191-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25190-0
Online ISBN: 978-3-642-25191-7
eBook Packages: Computer ScienceComputer Science (R0)