Visual post-analysis of association rules

Journal of Visual Languages and Computing

Volumn 14, Issue 6, 2003, Pages 621-635

  Bruzzese, Dario ^a   Davino, Cristina ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Association rules; Factorial methods; Parallel coordinates; Pruning; Visualization

Indexed keywords

EID: 0344981356     PISSN: 1045926X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jvlc.2003.06.004     Document Type: Article

References (20)

1. R. Agarwal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the 1993 ACM SIGMOD Conference, May, Washington, DC, USA, 1993, pp. 207 216.
2. H. Hofmann, A. Wilhelm, Validation of association rules by interactive mosaic plots, in: J.G. Bethlehem, P.G.M. van der Heijden (Eds.), Compstat 2000 - Proceedings in Computational Statistics, Physica-Verlag, Heidelberg, 2000, pp. 499-504.
3. B. Liu, W. Hsu, Y. Ma, Pruning and summarizing the discovered associations, in: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '99), 15-18 August, San Diego, CA, USA, 1999.
4. P.C. Wong, P. Whitney, J. Thomas, Visualizing association rules for text mining, in: G. Wills, D. Keim (Eds.), Proceedings of IEEE Information Visualization '99, IEEE CS Press, Los Alamitos, CA, 1999.
5. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, A.I. Verkamo, Finding intersting rules from large sets of discovered association rules, in: Proceedings of the Third International Conference on Information and Knowledge Management CIKM '94, 1994, pp. 401-407.
6. H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hatonen, H. Mannila, Pruning and grouping of discovered association rules, Workshop Notes of the ECML '95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, Heraklion, Greece, April 1995, pp. 47-52.
7. I. Weber, On pruning strategies for discovery of generalized and quantitative association rules, in: Proceedings of KDDM Workshop, 1998.
8. B. Liu, W. Hsu, K. Wang, S. Chen, Visually aided exploration interesting association rules, in: Proceedings of the Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD '99), 26-28 April, Beijing, Springer, 1999.
9. D. Shah, L.V.S. Lakshmanan, K. Ramamritham, S. Sudarshan, Interestingness and pruning of mined patterns, Workshop Notes of the 1999 ACM SIGMOD Research Issues in Data Mining and Knowledge Discovery, 1999.
10. J.-P. Benzècri, L'Analyse des Donnèes, Dunod, Paris, 1973.
11. S. Brin, R. Motwani, C. Silverstein, Beyond market baskets: generalizing association rules to correlations, SIGMOD Record (ACM Special Interest Group on Management of Data), Vol. 26, No. (2) 1997, p. 265.
12. D. Bruzzese, C. Davino, Pruning exploring and visualizing association rules, Statistica, Applicata 12 (4) (2000) 461-472.
13. D. Bruzzese, C. Davino, Statistical pruning of discovered association rules, Computational Statistics 16 (2001) 387-398.
14. H. Hofmann, A. Wilhelm, Visual Comparison of Association Rules, Computational Statistics 16 (2001) 399-416.
15. R.J. Bayardo, R. Agarwal, Mining the most interesting rules, in: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999.
16. A. Inselberg, N-dimensional graphics, part I - lines and hyperplanes, IBM LASC Technical Report G320-2711, IBM LA Scientific Center, 1981, 140pp.
17. A. Inselberg, Visual data mining with parallel coordinates, Computational Statistics 13 (1) (1998) 47-64.
18. L. Lebart, A. Morineau, K.M. Warwick, Multivariate Descriptive Statistical Analysis, Wiley, New York, 1984.
19. I. Joliffe, Principal Component Analysis, Springer, Berlin, 1986.
20. M. Greenacre, Correspondence Analysis in Practice, Academic Press, New York, 1993.