Skip to main content

Visual Data Mining for Business Intelligence Applications

  • Conference paper
  • First Online:
Web-Age Information Management (WAIM 2000)

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

Included in the following conference series:

Abstract

Business intelligence applications require the analysis and mining of large volumes of transaction data to support business managers in making informed decisions. A key dimension of data mining for human decision making is information visualization: the presentation of information in such a way that humans can perceive interesting patterns. Often, such visual data mining is a powerful prelude to using other, algorithmic, data mining techniques. Additionally, visualization is often important to presenting the results of data mining tasks, such as clustering or association rules. There are several challenges to providing useful visualization for business intelligence applications. First, these applications typically involve the navigation of large volumes of data. Quite often, users can get lost, confused, and overwhelmed with displays that contain too much information. Second, the data is usually of high dimensionality, and visualizing it often involves a series of inter-related displays. Third, different visual metaphors may be useful for different types of data and for different applications. This paper discusses VisMine, a content-driven visual mining infrastructure that we are developing at HP Laboratories. VisMine uses several innovative techniques: (1) hidden visual structure and relationships for uncluttering displays; (2) simultaneous, synchronized visual presentations for high-dimensional data; and (3) an open architecture that allows the plugging in of existing graphic toolkits for expanding its use in a wide variety of visual applications. We have applied this infrastructure to visual data mining for various business intelligence applications in telecommunication, e-commerce, and Web information access.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Qiming Chen, Umeshwar Dayal, Meichun Hsu, “OLAP-Based Scalable Profiling of Cus tomer Behavior”, Proc. 1st Intl. Conf. on Data Warehousing and Knowledge Discovery (DAWAK), 1999.

    Google Scholar 

  2. Qiming Chen, Meichun Hsu, Umeshwar Dayal, “A Data Warehouse/OLAP Framework for Scalable Telecommunication Tandem Traffic Analysis”, Proc. ICDE Conf., 2000.

    Google Scholar 

  3. Qiming Chen, Umeshwar Dayal, Meichun Hsu, “A Distributed OLAP Infrastructure for E-Commerce”, Proc. 4th Intl. Conf. on Cooperative Information Systems, 1999.

    Google Scholar 

  4. Charlie Gunn, “Discrete Groups and Visualization of Three-dimensional Manifolds” ACM 1993. Various Hyperbolic Space” IEEE Computer Graphics. Vol. 18, Number 4. 1998.

    Google Scholar 

  5. Tamara Munzner, “Exploring Large Graphs in 3D Hyperbolic Space” IEEE Computer Graphics. Vol. 18, Number 4. 1998.

    Google Scholar 

  6. John Lamping and Ramana Rao, “Laying out and Visualizing Large Trees Using a Hyper-bolic Space” ACM/UIST 1994.

    Google Scholar 

  7. Stephen G. Eick, “Aspects of Network Visualization”, IEEE Computer Graphics and Applications, March 1996.

    Google Scholar 

  8. Joe C. Pinheiro, Don X Sun, “Methods for Linking and Mining Massive Heterogeneous Databases, KDD 1998.

    Google Scholar 

  9. Stephen G. Erick and Graham J. Wills, “Navigating large networks with hierarchies” IEEE Visualization, 1999.

    Google Scholar 

  10. Ming C. Hao, Umesh Dayal, Meichun Hsu, “A Java-based Visual Mining Infrastructure and Applications”, IEEE InfoVis 1999.

    Google Scholar 

  11. Inxight Softwre, Hyperbolic Tree Toolkit.

    Google Scholar 

  12. Template Graphics Software, San Diego, CA.

    Google Scholar 

  13. Ming C. Hao, Meichun Hsu, Umesh Dayal, Adrian Krug, “A Technique for visualizing Large Web-based Hierarchical Hyperbolic Space with Multi-Paths”, PADD, April 1999.

    Google Scholar 

  14. Thomas C. Sprenger, Markus H. Gross, D. Bielser, “Ivory-An Object-Oriented Frame-work for Physics-Based Information Visualization in Java”, IEEE InfoVis, 1998.

    Google Scholar 

  15. Daniel A. Keim, Annemarie Herrmann, “The Gridfit Algorithms: An Efficient and Effective Approach to Visualizing Large Amounts of Spatial Data”, IEEE Visualization, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hao, M., Dayal, U., Hsu, M. (2000). Visual Data Mining for Business Intelligence Applications. In: Lu, H., Zhou, A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45151-X_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-45151-X_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67627-0

  • Online ISBN: 978-3-540-45151-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics