Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/476544Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Azuraliza Abu Bakar, Prof. Dr. | - |
| dc.contributor.author | Vahid Beiranvand (P59318) | - |
| dc.date.accessioned | 2023-10-06T09:20:44Z | - |
| dc.date.available | 2023-10-06T09:20:44Z | - |
| dc.date.issued | 2012-10-08 | - |
| dc.identifier.other | ukmvital:119291 | - |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/476544 | - |
| dc.description | An anomaly is an observation that does not conform to the expected normal behaviour. Anomaly detection can provide useful information in a variety of real-world problems such as fraud detection, fault detection, and outbreak detection. One of the potential methods for anomaly detection is Association Rule Mining (ARM). Anomalous rule mining is a variation of ARM dealing with unusual knowledge that might be of interest for the user and has its potential use for anomaly detection. One of the important tasks of ARM is determining the appropriate minimum threshold values for support and confidence factors. A large value of minimum threshold will limit the generation of important rules whereas a small minimum threshold value will generate a huge amount of less important rules. Both factors are often determined by the expert user or by trial-and-error, where the features of the dataset are not considered effectively. Therefore, to handle this problem, this study aims to propose a PSO algorithm to optimise the minimum threshold value for the support and confidence factors in anomalous association rules. It attempts to improve the efficiency of the anomalous ARM process by providing suitable threshold values for support and confidence. The proposed approach consists of two main steps. First, the Particle Swarm Optimization (PSO) algorithm is developed to determine both the minimum support and minimum confidence of anomalous rules as the preprocessing phase. Secondly, the obtained minimum support and confidence are employed to extract anomalous rules. Four benchmark datasets are used to evaluate the performance of the algorithm. It is measured in terms of the number of extracted anomalous rules compared to the number of regular association rules. The results showed that the proposed algorithm generates a less number of anomalous rules with high confidence values compared to the previous approach. The study showed that the proposed algorithm is able to obtain the appropriate values for minimum support and confidence leading to extraction of a manageable number of high confidence anomalous rules.,Certification of Master's / Doctoral Thesis" is not available | - |
| dc.language.iso | eng | - |
| dc.publisher | UKM, Bangi | - |
| dc.relation | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | - |
| dc.rights | UKM | - |
| dc.subject | Rules mining | - |
| dc.subject | Particle Swarm Optimization (PSO) | - |
| dc.subject | Algorithm | - |
| dc.subject | Universiti Kebangsaan Malaysia -- Dissertations | - |
| dc.subject | Dissertations, Academic -- Malaysia | - |
| dc.title | Particle swarm optimization algorithm for anomalous association rules mining | - |
| dc.type | theses | - |
| dc.format.pages | 93 | - |
| dc.identifier.callno | Q337.3.B435 2012 3tesis | - |
| dc.identifier.barcode | 004681(2012) | - |
| dc.identifier.barcode | 005620(2021)(PL2) | - |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_119291+SOURCE1+SOURCE1.1.PDF Restricted Access | 891.92 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.