Incremental Algorithm for Association Rule Mining under Dynamic Threshold

Iyad Aqra, Norjihan Abdul Ghani, Carsten Maple, Jose Machado, Nader Sohrabi Safa

Research output: Contribution to journalArticle

1 Downloads (Pure)

Abstract

Data mining is essentially applied to discover new knowledge from a database through an iterative process. The mining process may be time consuming for massive datasets. A widely used method related to knowledge discovery domain refers to association rule mining (ARM) approach, despite its shortcomings in mining large databases. As such, several approaches have been prescribed to unravel knowledge. Most of the proposed algorithms addressed data incremental issues, especially when a hefty amount of data are added to the database after the latest mining process. Three basic manipulation operations performed in a database include add, delete, and update. Any method devised in light of data incremental issues is bound to embed these three operations. The changing threshold is a long-standing problem within the data mining field. Since decision making refers to an active process, the threshold is indeed changeable. Accordingly, the present study proposes an algorithm that resolves the issue of rescanning a database that had been mined previously and allows retrieval of knowledge that satisfies several thresholds without the need to learn the process from scratch. The proposed approach displayed high accuracy in experimentation, as well as reduction in processing time by almost two-thirds of the original mining execution time.
Original languageEnglish
Article number5398
Number of pages22
JournalApplied Sciences
Volume9
Issue number24
DOIs
Publication statusPublished - 10 Dec 2019

Fingerprint

Association rules
data mining
thresholds
Data mining
experimentation
decision making
retrieval
manipulators
Decision making
Processing

Bibliographical note

This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Keywords

  • data mining
  • knowledge extraction
  • association rule mining
  • incremental mining
  • dynamic threshold

Cite this

Incremental Algorithm for Association Rule Mining under Dynamic Threshold. / Aqra, Iyad; Ghani, Norjihan Abdul; Maple, Carsten; Machado, Jose; Sohrabi Safa, Nader.

In: Applied Sciences, Vol. 9, No. 24, 5398, 10.12.2019.

Research output: Contribution to journalArticle

Aqra, Iyad ; Ghani, Norjihan Abdul ; Maple, Carsten ; Machado, Jose ; Sohrabi Safa, Nader. / Incremental Algorithm for Association Rule Mining under Dynamic Threshold. In: Applied Sciences. 2019 ; Vol. 9, No. 24.
@article{7ea29b27dca448a5bdddcaccd89fa620,
title = "Incremental Algorithm for Association Rule Mining under Dynamic Threshold",
abstract = "Data mining is essentially applied to discover new knowledge from a database through an iterative process. The mining process may be time consuming for massive datasets. A widely used method related to knowledge discovery domain refers to association rule mining (ARM) approach, despite its shortcomings in mining large databases. As such, several approaches have been prescribed to unravel knowledge. Most of the proposed algorithms addressed data incremental issues, especially when a hefty amount of data are added to the database after the latest mining process. Three basic manipulation operations performed in a database include add, delete, and update. Any method devised in light of data incremental issues is bound to embed these three operations. The changing threshold is a long-standing problem within the data mining field. Since decision making refers to an active process, the threshold is indeed changeable. Accordingly, the present study proposes an algorithm that resolves the issue of rescanning a database that had been mined previously and allows retrieval of knowledge that satisfies several thresholds without the need to learn the process from scratch. The proposed approach displayed high accuracy in experimentation, as well as reduction in processing time by almost two-thirds of the original mining execution time.",
keywords = "data mining, knowledge extraction, association rule mining, incremental mining, dynamic threshold",
author = "Iyad Aqra and Ghani, {Norjihan Abdul} and Carsten Maple and Jose Machado and {Sohrabi Safa}, Nader",
note = "This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).",
year = "2019",
month = "12",
day = "10",
doi = "10.3390/app9245398",
language = "English",
volume = "9",
journal = "Applied Sciences",
issn = "2076-3417",
publisher = "MDPI",
number = "24",

}

TY - JOUR

T1 - Incremental Algorithm for Association Rule Mining under Dynamic Threshold

AU - Aqra, Iyad

AU - Ghani, Norjihan Abdul

AU - Maple, Carsten

AU - Machado, Jose

AU - Sohrabi Safa, Nader

N1 - This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

PY - 2019/12/10

Y1 - 2019/12/10

N2 - Data mining is essentially applied to discover new knowledge from a database through an iterative process. The mining process may be time consuming for massive datasets. A widely used method related to knowledge discovery domain refers to association rule mining (ARM) approach, despite its shortcomings in mining large databases. As such, several approaches have been prescribed to unravel knowledge. Most of the proposed algorithms addressed data incremental issues, especially when a hefty amount of data are added to the database after the latest mining process. Three basic manipulation operations performed in a database include add, delete, and update. Any method devised in light of data incremental issues is bound to embed these three operations. The changing threshold is a long-standing problem within the data mining field. Since decision making refers to an active process, the threshold is indeed changeable. Accordingly, the present study proposes an algorithm that resolves the issue of rescanning a database that had been mined previously and allows retrieval of knowledge that satisfies several thresholds without the need to learn the process from scratch. The proposed approach displayed high accuracy in experimentation, as well as reduction in processing time by almost two-thirds of the original mining execution time.

AB - Data mining is essentially applied to discover new knowledge from a database through an iterative process. The mining process may be time consuming for massive datasets. A widely used method related to knowledge discovery domain refers to association rule mining (ARM) approach, despite its shortcomings in mining large databases. As such, several approaches have been prescribed to unravel knowledge. Most of the proposed algorithms addressed data incremental issues, especially when a hefty amount of data are added to the database after the latest mining process. Three basic manipulation operations performed in a database include add, delete, and update. Any method devised in light of data incremental issues is bound to embed these three operations. The changing threshold is a long-standing problem within the data mining field. Since decision making refers to an active process, the threshold is indeed changeable. Accordingly, the present study proposes an algorithm that resolves the issue of rescanning a database that had been mined previously and allows retrieval of knowledge that satisfies several thresholds without the need to learn the process from scratch. The proposed approach displayed high accuracy in experimentation, as well as reduction in processing time by almost two-thirds of the original mining execution time.

KW - data mining

KW - knowledge extraction

KW - association rule mining

KW - incremental mining

KW - dynamic threshold

U2 - 10.3390/app9245398

DO - 10.3390/app9245398

M3 - Article

VL - 9

JO - Applied Sciences

JF - Applied Sciences

SN - 2076-3417

IS - 24

M1 - 5398

ER -