Mining Association Rules from Relational Data – Average Distance Based Method

  • Vladimír Bartík
  • Jaroslav Zendulka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2888)


The paper describes a new method for association rule discovery in relational databases, which contain both quantitative and categorical attributes. Most of the methods developed in the past are based on initial equi-depth discretization of quantitative attributes. These approaches bring the loss of information. Distance-based methods are another kind of methods. They try to respect the semantics of data. The basic idea of the new method is to separate processing of categorical and quantitative attributes. The first step finds frequent itemsets containing only values of categorical attributes and then quantitative attributes are processed one by one. Discretization of values during quantitative attributes processing is distance-based. A new measure called average distance is introduced for these purposes. The paper describes the method and results of several experiments on real world data.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Item In Large Databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, DC (1993)Google Scholar
  2. 2.
    Kotásek, P., Zendulka, J.: Comparison of Three Mining Algorithms For Association Rules. In: Proceeding of MOSIS 2000, Information System Modeling. ISM 2000, Rožnov pod Radhoštěm, Czech Republic, pp. 85–90 (2000)Google Scholar
  3. 3.
    Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate. In: Proc. 2000 ACMSIGMOD Int. Conf. on Management of Data (SIGMOD 2000), Dallas, TX (May 2000)Google Scholar
  4. 4.
    Lee, G., Lee, K.L., Chen, L.P.: Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases. In: Knowledge and Information Systems, pp. 338–355. Springer, London (2001)Google Scholar
  5. 5.
    Srikant, R., Agrawal, R.: Mining Quantitative Association Rule. In: Large Relational Tables. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (1996)Google Scholar
  6. 6.
    Fukuda, T., et al.: Mining Optimized Association Rules For Numeric Attributes. In: Proceedings of ACM PODS 1996, Montreal, Canada, pp. 182–191 (1996)Google Scholar
  7. 7.
    Zhang, W.: Mining Fuzzy Quantitative Association Rules. In: Proceedings of 11th IEEE International Conference on Tools with Artificial Intelligence, Chicago, Illinois, pp. 99–102. IEEE Computer Society, Los Alamitos (1999)CrossRefGoogle Scholar
  8. 8.
    Miller, R.J., Yang, Y.: Association Rules Over Interval Data. In: Proceedings of 1997 ACM SIGMOD, Tucson, Arizona, USA, pp. 452–461 (1997)Google Scholar
  9. 9.
    Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An Efficient Data Clustering Method For Very Large Databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Montreal, Canada (1996)Google Scholar
  10. 10.
    Li, J., Shen, H., Topor, R.: An Adaptive Method of Numerical Attribute Merging for Quantitative Association Rule Mining. In: Hui, L.C.K., Lee, D.-L. (eds.) ICSC 1999. LNCS, vol. 1749, pp. 41–50. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  11. 11.
    Hua, Z.: On-Line Analytical Mining of Association Rules, PhD. thesis, Simon Fraser University (1998)Google Scholar
  12. 12.
    Bartik, V.: Association Rule Discover In Databases. In: Proceedings of 5th International Conference ISM, Roznov pod Radhostem, Czech Republic, pp. 21–27 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vladimír Bartík
    • 1
  • Jaroslav Zendulka
    • 1
  1. 1.Faculty of Information TechnologyBrno University of TechnologyBrnoCzech Republic

Personalised recommendations