Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/5335
Title: | Development of a Causality Least Association Rules Algorithm Tool Using Rational Unified Process Methodology | Authors: | Zailani Abdullah Fatihah Mohd Amir Ngah Ang Bee Choo Nabilah Huda Zailani Wan Aezwani Wan Abu Bakar |
Keywords: | Least;Algorithm;Association rules;Rational unified process | Issue Date: | 2023 | Publisher: | Springer, Singapore | Conference: | InCEBT: International Conference on Entrepreneurship, Business and Technology | Abstract: | Among the most crucial research areas in data mining is association rule mining (ARM). Rules are classified into two types: frequent rules and least frequent rules. Extracting the least association rules is more difficult and always leads to the “rare item problem” quandary. The rules with the fewest items are known as the “least association rules.” However, most data mining tools favour frequent association rules over the least frequent association rules. Furthermore, the process of extracting the least association rules is more difficult. Therefore, this paper proposes and develops Causality Least Association Rules Algorithm Tool (CLART) using the Rational Unified Process (RUP) methodology and the C# programming language. The results showed that CLART is workable, and the proposed algorithm also outperformed the existing benchmark algorithm. In addition, CLART is a dedicated tool that is freely available and can be used to extract the causality least association rules from the benchmarked datasets. |
Description: | Others |
URI: | http://hdl.handle.net/123456789/5335 | ISBN: | 978-981-99-2337-3 | DOI: | 10.1007/978-981-99-2337-3_50 |
Appears in Collections: | Faculty of Entrepreneurship and Business - Proceedings |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Causality Least Assoc Rules_Zailani_Full paper by Springer.pdf | Indexed by Google Scholar | 10.73 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.