Incremental generalization for mining in a data warehousing environment

  • Martin Ester
  • Rüdiger Wittmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1377)

Abstract

On a data warehouse, either manual analyses supported by appropriate visualization tools or (semi-) automatic data mining may be performed, e.g. clustering, classification and summarization. Attribute-oriented generalization is a common method for the task of summarization. Typically, in a data warehouse update operations are collected and applied to the data warehouse periodically. Then, all derived information has to be updated as well. Due to the very large size of the base relations, it is highly desirable to perform these updates incrementally. In this paper, we present algorithms for incremental attribute-oriented generalization with the conflicting goals of good efficiency and minimal overly generalization. The algorithms for incremental insertions and deletions are based on the materialization of a relation at an intermediate generalization level, i.e. the anchor relation. Our experiments demonstrate that incremental generalization can be performed efficiently at a low degree of overly generalization. Furthermore, an optimal cardinality for the sets of updates can be determined experimentally yielding the best efficiency.

Keywords

Data Mining Data Warehouses Generalization Database Updates 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AS 94]
    Agrawal R., Srikant R.: “Fast Algorithms for Mining Association Rules”, Proc. 20th Int. Conf. on Very Large Data Bases, Santiago, Chile, 1994, pp. 487–499.Google Scholar
  2. [CHNW 96]
    Cheung D.W., Han J., Ng V.T., Wong Y.: “Maintenance of Discovered Association Rules in Large Databases: An Incremental Technique”, Proc. 12th Int. Conf. on Data Engineering, New Orleans, USA, 1996, pp. 106–114.Google Scholar
  3. [EKX 95]
    Ester M., Kriegel H.-P., Xu X.: “A Database Interface for Clustering in Large Spatial Databases”, Proc. 1st Int. Conf. on Knowledge Discovery and Data Mining, Montreal, Canada, 1995, AAAI Press, 1995, pp. 94–99.Google Scholar
  4. [EKSX 96]
    Ester M., Kriegel H-P, Sander J. and Xu X.: “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, Oregon, 1996, pp. 226–231.Google Scholar
  5. [FSS 96]
    Fayyad U., Piatetsky-Shapiro G., and Smyth P.: “Knowledge Discovery and Data Mining: Towards a Unifying Framework”, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, Oregon, 1996, pp.82–88.Google Scholar
  6. [HCC 93]
    Han J., Cai Y., Cercone N.: “Data-driven Discovery of Quantitative Rules in Relational Databases”, IEEE Transactions on Knowledge and Data Engineering, Vol.5, No.1, 1993, pp. 29–40.CrossRefGoogle Scholar
  7. [HF 96]
    Han J., Fu Y: “Exploration of the Power of Attribute-Oriented Induction in Data Mining”, in Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996, pp. 399–421.Google Scholar
  8. [Huy 97]
    Huyn N.: “Multiple-View Self-Maintenance in Data Warehousing Environments”, Proc. 23rd Int. Conf. on Very Large Data Bases, Athens, Greece, 1997, pp. 26–35.Google Scholar
  9. [MQM 97]
    Mumick I.S., Quass D., Mumick B.S.: “Maintenance of Data Cubes and Summary Tables in a Warehouse”, Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, pp. 100–111.Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Martin Ester
    • 1
  • Rüdiger Wittmann
    • 1
  1. 1.Institute for Computer ScienceUniversity of MunichMuenchenGermany

Personalised recommendations