Affiliation:
1. University of Manitoba, Winnipeg, Canada
Abstract
In numerous real-life applications, large databases can be easily generated. Implicitly embedded in these databases is previously unknown and potentially useful knowledge such as frequently occurring sets of items, merchandise, or events. Different algorithms have been proposed for managing and retrieving useful information from these databases. Various algorithms have also been proposed for mining these databases to find frequent sets, which are usually presented in a lengthy textual list. As “a picture is worth a thousand words”, the use of visual representations can enhance user understanding of the inherent relationships among the mined frequent sets. Many of the existing visualizers were not designed to visualize these mined frequent sets. In this journal article, an interactive visual analytic system is proposed for providing visual analytic solutions to the frequent set mining problem. The system enables the management, visualization, and advanced analysis of the original transaction databases as well as the frequent sets mined from these databases.
Reference60 articles.
1. A Survey of Uncertain Data Algorithms and Applications
2. Agrawal, R., Imieliński, T., & Swami, A. N. (1993). Mining association rules between sets of items in large databases. In P. Buneman & S. Jajodia (Eds.), Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (pp. 207-216). New York, NY: ACM.
3. Agrawal, R., & Srikank, R. (1994). Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, & C. Zaniolo (Eds.), Proceedings of the 20th International Conference on Very Large Data Bases (pp. 487-499). San Francisco, CA: Morgan Kaufmann.
4. Spotfire
5. Akoglu, L., Chau, D. H., Kang, U., Koutra, D., & Faloutsos, C. (2012). OPAvion: Mining and visualization in large graphs. In K. S. Candan, Y. Chen, R. T. Snodgrass, L. Gravano, & A. Fuxman (Eds.), Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data (pp.717-720). New York, NY: ACM.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Big Data Analysis and Mining;Advances in Computer and Electrical Engineering;2019
2. Big Data Analysis and Mining;Encyclopedia of Information Science and Technology, Fourth Edition;2018
3. Association Rule Mining in Collaborative Filtering;Collaborative Filtering Using Data Mining and Analysis;2017
4. A Business Intelligence Solution for Frequent Pattern Mining on Social Networks;2014 IEEE International Conference on Data Mining Workshop;2014-12
5. Effectively and Efficiently Mining Frequent Patterns from Dense Graph Streams on Disk;Procedia Computer Science;2014