Skip to main content

Visualizing Frequent Itemsets, Association Rules, and Sequential Patterns in Parallel Coordinates

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2667))

Included in the following conference series:

Abstract

Frequent itemsets, association rules and sequential patterns are defined on elements of power sets of items and reflect the many-to-many relationships among items. Although many tools have been developed to visualize association rules, none of them can simultaneously manage a large number of rules with multiple antecedents and multiple consequences. This problem is shown as a straightforward application of parallel coordinates. We show that, by properly arranging items on coordinates and by filtering out subsets of large frequent itemsets, item groups can be naturally displayed and that inherent properties such as partial orders in itemsets and in association rules are implied by this visualization paradigm. The usefulness of this approach is demonstrated through examples.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imielinski, T., Swami, A: Mining Association Rules between Sets of Items in Large Databases. In Proc 1993 ACM-SIGMOD Conf. on Management of Data. (1993) 207–216.

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In Proc. 20th Int. Conf. Very Large Databases, Santiago, Chile. (1994)

    Google Scholar 

  3. Agrawal, R., Srikant, R: Mining Sequential Patterns. In Proc. 11th Int. Conf. Data Engineering (1995) 3–14

    Google Scholar 

  4. Bayardo, R. J.: Efficiently Mining Long Patterns from Databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data. (1998) 85–93

    Google Scholar 

  5. Bayardo, R. J., R. Agrawal: Mining the Most Interesting Rules. In Proc. 5th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining. (1999) 145–154

    Google Scholar 

  6. Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization. In Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data. Montreal, Canada (1996) 13–23

    Google Scholar 

  7. Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H: Data Mining, Hypergraph Trans-versals, and Machine Learning. Proc. ACM PODS’97 (1997)

    Google Scholar 

  8. Hetzler, B., Harris, W. M., Havre, S., Whitney, P.: Visualizing the Full Spectrum of Document Relationships. In Proc. 5th Int. Society Knowledge Organization (ISKO) Conf. (1998)

    Google Scholar 

  9. IBM Intelligent Miner for Data: http://www-4.ibm.com/software/data/iminer/fordata/

  10. Inselberg, A., Reif, M., Chomut, T.: Convexity Algorithms in Parallel Coordinates. J. ACM, 34(1987) 765–801

    Article  MathSciNet  Google Scholar 

  11. Inselburg, A., Dimsdale, B.: Parallel Coordinates: A Tool for Visualizing Multi-Dimensional Geometry. In Proc. 1st IEEE Conf. Visualization. San Francisco, CA. (1990) 361–375

    Google Scholar 

  12. Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen H., Verkamo I.: Finding Interesting Rules from Large Sets of Discovered Association Rules. In Proc. 3rd Int. Conf. Information and Knowledge Management (CIKM’94) (1994) 401–407

    Google Scholar 

  13. Liu, B., Hsu, W., Ma, Y.: Pruning and Summarizing the Discovered Associations. In Proc. 5th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD-99). San Diego, CA (1999) 145–154

    Google Scholar 

  14. Manilla, H., Meek, C.: Global Partial Orders from Sequential Data. In Proc. 6th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD-2000), Boston, MA. (2000) 161–168

    Google Scholar 

  15. Mannila, H., Toivonen, H.: Multiple Uses of Frequent Sets and Condensed Representations. In Proc. 2nd Int. Conf. Knowledge Discovery and Data Mining. Portland, Oregon (1996)

    Google Scholar 

  16. SAS Enterprise Miner: http://www.sas.com/products/miner/

  17. SGI MineSet: http://mineset.sgi.com

  18. Wong, P.C., Whitney, P, Thomas, J.: Visualizing Association Rules for Text Mining. In Proc. IEEE Information Visualization’ 99, Los Alamitos, CA (1999)

    Google Scholar 

  19. Yoda, K., Fukuda, T., Morimoto, Y., Morishita, T., Tokuyama, T: Computing Optimized Rectilinear Regions for Association Rules. In Proc. 3rd Conf. Knowledge Discovery and Data Mining (KDD’97). Los Angels, CA (1997) 96–103

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, L. (2003). Visualizing Frequent Itemsets, Association Rules, and Sequential Patterns in Parallel Coordinates. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44839-X_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-44839-X_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40155-1

  • Online ISBN: 978-3-540-44839-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics