UTHM Institutional Repository

An efficient algorithm for mining causality least pattern

Abdullah, Zailani and Mat Deris, Mustafa and Jaafar , S. Zulaikha (2009) An efficient algorithm for mining causality least pattern. International Conference on Advanced Computer Theory and Engineering (ICACTE 2009).

Full text not available from this repository.


The process of discovering the least pattern is more challenging as compared to frequent pattern. Thus, only few attentions have been paid in the past decades in this area. Discovery of least pattern mining is very important especially in detecting the abnormal events or errors such as in networking system, tsunami disaster system, etc. Here, we propose a scalable Causality Least Pattern Algorithm (CALPA) that can discover the least pattern sets with the degree of causality. The study shows that this algorithm can easily reveals the desired pattern sets and can be applied in any standard datasets.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA150 Algebra
Depositing User: Muhamad Azrul Hisam Salleh
Date Deposited: 07 Nov 2012 03:57
Last Modified: 07 Nov 2012 03:57
URI: http://eprints.uthm.edu.my/id/eprint/3147
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item