Advertisement

An Efficient Interestingness based Algorithm for Mining Association Rules in Medical Databases

  • Siri Krishan Wasan
  • Vasudha Bhatnagar
  • Harleen Kaur

Abstract

Mining association rules is animportant area in data mining. Massively increasing volume of data in reallife databases has motivated researchers to design novel and efficientalgorithm for association rules mining. In this paper, we propose anassociation rule mining algorithm that integrates interestingness criteriaduring the process of building the model. One of the main features of thisapproach is to capture the user background knowledge, which is monotonicallyaugmented. We tested our algorithm and experiment with some public medicaldatasets and found the obtained results quite promising.

Keywords

— Association rules algorithm data mining knowledge discovery in databases (KDD) interestingness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Han, J. and M. Kamber, 2001. Data Mining: Concepts and Techniques. San Francisco, Morgan Kauffmann Publishers.Google Scholar
  2. [2]
    Dunham M. H.: Data Mining: Introductory and Advanced Topics. 1st Edition Pearson Education (Singapore) Pte. Ltd. 2003Google Scholar
  3. [3]
    Hand, D., Mannila, H. and Smyth, P. (2001), Principles of Data Mining, Prentice-Hall of India Private Limited, India.Google Scholar
  4. [4]
    Bronchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Exante: AnticipatedData Reduction in Constrained Pattern Mining. In Proceedings of the 7thPAKDD03. 2003.Google Scholar
  5. [5]
    Bronchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAMiner: Optimized Level-wise Frequent pattern Mining with Monotone Constraints. In Proceedings of the 3rd International Conference on Data Mining (ICDM03). (2003).Google Scholar
  6. [6]
    Bronchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Adaptive Constraint Pushing in Frequent Pattern Mining. In Proceedings of the 17th European Conference on PAKDD03. 2003Google Scholar
  7. [7]
    C Freitas, A. A.: On Rule Interestingness Measures. Knowledge-Based Systems.12:309-315. 1999CrossRefGoogle Scholar
  8. [8]
    Liu, B., Hsu, W., Chen, S., Ma, Y.: Analyzing the Subjective Interestingness of Association Rules. IEEE Intelligent Systems. (2000).Google Scholar
  9. [9]
    Silberschatz, A., Tuzhilin, A.: On Subjective Measures of Interestingness in Knowledge Discovery. In Proceedings of the 1st International Conferenceon Knowledge Discovery and Data Mining, 1995Google Scholar
  10. [10]
    B. Liu, W. Hsu, S. Chen, and Y. Ma.: Analyzing the Subjective Interestingness of Association Rules. IEEE Intelligent Systems, 2000.Google Scholar
  11. [11]
    M.Zaki and C. Hsiao. Charm: An efficient algorithm for closed itemset mining. In Proceeding of the 2nd SIAM International Conference on Data Mining, Arlington, USA, 2002.Google Scholar
  12. [12]
    S. Zhang, C. Zhang, Estimating itemsets of interest by sampling, in: Proceedings of the 10th IEEE International Conference on Fuzzy Systems, Melbourne, Australia, December, 2001.Google Scholar
  13. [13]
    R. Agrawal, T. Imielinski, A. Swami, Mining association rules between setsof items in large databases, in: Proceedings of the ACM SIGMOD Conference on Management of Data, 1993, pp. 207–216.Google Scholar
  14. [14]
    J. Park, M. Chen, P. Yu, Using a hash-based method with transaction trimming for mining association rules, IEEE Transactions on Knowledge and Data Engineering 9 (5) 813–824, 1997.CrossRefGoogle Scholar
  15. [15]
    Klemetinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A. I.: Finding Interesting Rules from Large Sets of Discovered Association Rules. In Proceedings of the 3rd International Conference on Information and Knowledge Management. Gaithersburg, Maryland. (1994).Google Scholar
  16. [16]
    C. Aggarawal, P. Yu, A new framework for itemset generation, in: Proceedingsof the ACM PODS, pp. 18–24, 1998.Google Scholar
  17. [17]
    J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, In: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2000, pp. 1–12.Google Scholar
  18. [18]
    Kaur H et al,. A Unified Approach for Discovery of Interesting Association Rules in Medical Databases. ‘Advances in Data Mining’, LNAI -4065, Springer-Verlag, Berlin Heidelberg. 2006, pp. 53-63.Google Scholar
  19. [19]
    Wasan S K., and Kaur H, A Hybrid Approach in Medical Decision Making, in : Special short paper proceedings, Industrial Conference on Data Mining, Germany. ICDM -2006, Springer-Verlag, Berlin Heidelberg. [accepted].Google Scholar
  20. [20]
    Shichao Zhang et al. Fuzzy logic based method to acquire user threshold of minimum support for mining association rule. Information Sciences, (1-16).2003.Google Scholar
  21. [21]
    Kovalerchuk, B., Triantaphyllou, E., Despande, A. and Vtyaev, E. 1996. Interactive Learning of Monotone Boolean Function. Information Sciences, 94(1-4):87-118.CrossRefGoogle Scholar
  22. [22]
    R. Hoffman, N. Shadbolt, Eliciting knowledge from experts: a methodological analysis, Organizational and Human Decision Process 62 (2), 129–158, 1995.CrossRefGoogle Scholar
  23. [23]
    S. D. Bay. The UCI KDD archive. [http://kdd.ics.uci.edu] University of California, Department of Information and Computer Science, Irvine,C.A;2001.Google Scholar
  24. [24]
    Blake and C. J. Merz. UCI repository of machine learning databases. [Machine-readable data repository]. .University of California, Department of Information and Computer Science, Irvine,C.A; 2001.Google Scholar

Copyright information

© Springer 2007

Authors and Affiliations

  • Siri Krishan Wasan
    • 1
  • Vasudha Bhatnagar
    • 2
  • Harleen Kaur
    • 1
  1. 1.Deptt. of MathematicsJamia Millia IslamiaNew Delhi-110 025
  2. 2.Deptt. of Computer ScienceUniversity of DelhiNew Delhi-110 007India

Personalised recommendations