This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Pruning and Visualizing Generalized Association Rules in Parallel Coordinates
January 2005 (vol. 17 no. 1)
pp. 60-70
Li Yang, IEEE
One fundamental problem for visualizing frequent itemsets and association rules is how to present a long border of frequent itemsets in an itemset lattice. Another problem comes from the lack of an effective visual metaphor to represent many-to-many relationships. This paper proposes an approach for visualizing frequent itemsets and many-to-many association rules by a novel use of parallel coordinates. An association rule is visualized by connecting items in the rule, one item on each parallel coordinate, with continuous polynomial curves. In the presence of item taxonomy, each coordinate can be used to visualize an item taxonomy tree which can be expanded or shrunk by user interaction. This user interaction introduces a border, which separates displayable itemsets from nondisplayable ones, in the generalized itemset lattice. Only those itemsets that are both frequent and displayable are considered to be displayed. This approach of visualizing frequent itemsets and association rules has the following features: 1) It is capable of visualizing many-to-many rules and itemsets with many items. 2) It is capable of visualizing a large number of itemsets or rules by displaying only those ones whose items are selected by the user. 3) The closure properties of frequent itemsets and association rules are inherently supported such that the implied ones are not displayed. Usefulness of this approach is demonstrated through examples.

[1] C.C. Aggarwal and P.S. Yu, “A New Approach to Online Generation of Association Rules,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 4, pp. 527-540, July/Aug. 2001.
[2] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules between Sets of Items in Large Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '93), pp. 207-216, May 1993.
[3] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 20th Int'l Conf. Very Large Data Bases (VLDB '94), pp. 207-216, Sept. 1994.
[4] K.M. Ahmed, N.M. El-Makky, and Y. Taha, “A Note on Beyond Market Baskets: Generalizing Association Rules to Correlations,” ACM SIGKDD Explorations Newsletter, vol. 1, no. 2, pp. 46-48, Jan. 2000.
[5] R.J. Bayardo, “Efficiently Mining Long Patterns from Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '98), pp. 85-93, June 1998.
[6] R.J. Bayardo and R. Agrawal, “Mining the Most Interesting Rules,” Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 145-154, Aug. 1999.
[7] S. Brin, R. Motwani, and C. Silverstein, “Beyond Market Baskets: Generalizing Association Rules to Correlations,” Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '97), pp. 265-276, May 1997.
[8] G. Farin, Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide. New York: Academic Press, 1988.
[9] T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama, “Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization,” Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '96), pp. 13-23, June 1996.
[10] D. Gunopulos, R. Khardon, H. Mannila, and H. Toivonen, “Data Mining, Hypergraph Transversals, and Machine Learning,” Proc. 16th ACM Symp. Principles of Database Systems (PODS '97), pp. 209-216, May 1997.
[11] B. Hetzler, W.M. Harris, S. Havre, and P. Whitney, “Visualizing the Full Spectrum of Document Relationships,” Structures and Relations in Knowledge Organization, Proc. Fifth Int'l Soc. for Knowledge Organization (ISKO) Conf., pp. 168-175, 1998.
[12] H. Hofmann, A. Siebes, and A. Wilhelm, “Visualizing Association Rules with Interactive Mosaic Plots,” Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '00), pp. 227-235, Aug. 2000.
[13] A. Inselberg, “The Plane with Parallel Coordinates,” The Visual Computer, vol. 1, no. 2, pp. 69-91, 1985.
[14] A. Inselberg, “Parallel Coordinates: A Tool for Visualizing Multi-Dimensional Geometry,” Proc. First IEEE Conf. Visualization, pp. 361-375, Oct. 1990.
[15] A. Inselberg, “Visualizing High Dimensional Datasets and Multivariate Relations (Tutorial),” Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '00), Aug. 2000.
[16] A. Inselberg and B. Dimsdale, “Multi-Dimensional Lines,” SIAM J. Applied Math., vol. 54, no. 2, pp. 559-596, 1994.
[17] A. Inselberg, M. Reif, and T. Chomut, “Convexity Algorithms in Parallel Coordinates,” J. ACM, vol. 34, no. 4, pp. 765-801, Oct. 1987.
[18] S. Jaroszewicz and D.A. Simovici, “Pruning Redundant Association Rules Using Maximum Entropy Principle,” Proc. Sixth Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD '02), pp. 135-147, May 2002.
[19] M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and I. Verkamo, “Finding Interesting Rules from Large Sets of Discovered Association Rules,” Proc. Third ACM Int'l Conf. Information and Knowledge Management (CIKM '94), pp. 401-407, Nov. 1994.
[20] B. Liu, W. Hsu, S. Chen, and Y. Ma, “Analyzing the Subjective Interestingness of Association Rules,” IEEE Intelligent Systems, vol. 15, no. 5, pp. 47-55, Sept./Oct. 2000.
[21] B. Liu, W. Hsu, and Y. Ma, “Pruning and Summarizing the Discovered Associations,” Proc. Fifth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 145-154, Aug. 1999.
[22] B. Liu, W. Hsu, K. Wang, and S. Chen, “Visually Aided Exploration of Interesting Association Rules,” Proc. Third Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD), pp. 380-389, Apr. 1999.
[23] H. Mannila and C. Meek, “Global Partial Orders from Sequential Data,” Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '00), pp. 161-168, Aug. 2000.
[24] H. Mannila and H. Toivonen, “Multiple Uses of Frequent Sets and Condensed Representations,” Proc. Second Int'l Conf. Knowledge Discovery and Data Mining (KDD '96), pp. 189-194, Aug. 1996.
[25] A. Martin and M.O. Ward, “High Dimensional Brushing for Interactive Exploration of Multivariate Data,” Proc. IEEE Conf. Visualization, pp. 271-278, Oct. 1995.
[26] B. Padmanabhan and A. Tuzhilin, “Small Is Beautiful: Discovering the Minimal Set of Unexpected Patterns,” Proc. Sixth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '00), pp. 54-63, Aug. 2000.
[27] C. Silverstein, S. Brin, and R. Motwani, “Beyond Market Baskets: Generalizing Association Rules to Dependence Rules,” Data Mining and Knowledge Discovery, vol. 2, no. 1, pp. 39-68, Jan. 1998.
[28] R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” Proc. 21st Int'l Conf. Very Large Data Bases (VLDB '95), pp. 407-419, Sept. 1995.
[29] H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hatonen, and H. Mannila, “Pruning and Grouping of Discovered Association Rules,” Proc. ECML-95 Workshop Statistics, Machine Learning, and Knowledge Discovery in Databases, pp. 47-52, Apr. 1995.
[30] A. Tuzhilin and G. Adomavicius, “Handling Very Large Numbers of Association Rules in the Analysis of Microarray Data,” Proc. Eighth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '02), pp. 396-404, July 2002.
[31] A. Tuzhilin and B. Liu, “Querying Multiple Sets of Discovered Rules,” Proc. Eighth ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '02), pp. 52-60, July 2002.
[32] P.C. Wong, P. Whitney, and J. Thomas, “Visualizing Association Rules for Text Mining,” Proc. IEEE Symp. Information Visualization (InfoVis '99), pp. 120-123, Oct. 1999.
[33] K. Yoda, T. Fukuda, Y. Morimoto, T. Morishita, and T. Tokuyama, “Computing Optimized Rectilinear Regions for Association Rules,” Proc. Third Int'l Conf. Knowledge Discovery and Data Mining (KDD '97), pp. 96-103, Aug. 1997.

Index Terms:
Association rules, data visualization, data mining, interactive data exploration, mining methods and algorithms.
Citation:
Li Yang, "Pruning and Visualizing Generalized Association Rules in Parallel Coordinates," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 1, pp. 60-70, Jan. 2005, doi:10.1109/TKDE.2005.14
Usage of this product signifies your acceptance of the Terms of Use.