MILAR: Mining Indirect Least Association Rule Algorithm
| Main Authors: | Abdullah, Zailani, Pramana Gusman, Aggy, Herawan, Tutut, Mat Deris, Mustafa |
|---|---|
| Format: | Article NonPeerReviewed Book Document |
| Bahasa: | eng |
| Terbitan: |
LPPM UPI YPTK
, 2016
|
| Subjects: | |
| Online Access: |
http://repository.upiyptk.ac.id/23/1/36-71-1-PB.pdf http://repository.upiyptk.ac.id/23/ http://jcsit.upiyptk.ac.id/index.php/jcsit/article/view/36 |
Daftar Isi:
- One of the interesting and meaningful information that is hiding in transactional database is indirect association rule. It corresponds to the property of high dependencies between two items that are rarely occurred together but indirectly emerged via another items. Since indirect association rule is nontrivial information, it can implicitly give a new perspective of relationship which cannot be directly observed from the common rule. Therefore, we proposed an algorithm for Mining Indirect Least Association Rule (MILAR) from the real and benchmarked datasets. MILAR is embedded with our scalable least measure namely Critical Relative Support (CRS). The experimental results show that MILAR can generate the desired rules in term of least and indirect least association rules. In addition, the obtained results can also be used by the domain experts to do further analysis and finally reveal more interesting findings. Keywords: Data mining; Association rule; Indirect; Least; Algorithm.