• Title of article

    YAMI: Incremental Mining of Interesting Association Patterns

  • Author/Authors

    Yafi, Eiad Jamia Hamdard University - Department of Computer Science, India , Al-Hegami, Ahmed Sana a University - Faculty of Computers and Information Technology, Yemen , Alam, Afshar Jamia Hamdard University - Department of Computer Science,, India , Biswas, Ranjit Jadavpur University - Department of Computer Engineering, India

  • From page
    504
  • To page
    510
  • Abstract
    Association rules are an important problem in data mining. Massively increasing volume of data in real life databases has motivated researchers to design novel and incremental algorithms for association rules mining. In this paper, we propose an incremental association rules mining algorithm that integrates shocking interestingness criterion during the process of building the model. A new interesting measure called shocking measure is introduced. One of the main features of the proposed approach is to capture the user background knowledge, which is monotonically augmented. The incremental model that reflects the changing data and the user beliefs is attractive in order to make the over all KDD process more effective and efficient. We implemented the proposed approach and experiment it with some public datasets and found the results quite promising
  • Keywords
    Knowledge Discovery in Databases (KDD) , data mining , incremental association rules , domain knowledge , interestingness , and Shocking Rules (SHR)
  • Journal title
    The International Arab Journal of Information Technology (IAJIT)
  • Journal title
    The International Arab Journal of Information Technology (IAJIT)
  • Record number

    2543908