YAMI: Incremental Mining of Interesting Association Patterns
Journal: The International Arab Journal of Information Technology (Vol.9, No. 6)Publication Date: 2012-11-01
Authors : Eiad Yafi; Ahmed Al-Hegami; Afshar Alam; Ranjit Biswas;
Page : 504-510
Keywords : Knowledge Discovery in Databases (KDD); data mining; incremental association rules; domain knowledge; interestingness; and Shocking Rules (SHR).;
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.
Other Latest Articles
- Healthy Living Behaviors in University Students and Related Factors
- I2MANET Security Logical Specification Framework
- Time Evolution of Density Parameters for Matter and Dark Energy and their Interaction Term in Brans-Dicke Gravity
- An Experimental Investigation on Normal Concrete using Rice Husk Ash, Dolomite Powder and Banana Fibre
- A Novel Implementation for Radio Resource Allocation on Mobile Access Based on Cognitive Radio Network
Last modified: 2019-05-14 17:09:51