Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Incremental algorithm for association rule mining under dynamic threshold

Tools
- Tools
+ Tools

Aqra, Iyad, Abdul Ghani, Norjihan, Maple, Carsten, Machado, José and Sohrabi Safa, Nader (2019) Incremental algorithm for association rule mining under dynamic threshold. Applied Sciences, 9 (24). 5398. doi:10.3390/app9245398 ISSN 2076-3417.

[img]
Preview
PDF
WRAP-incremental-algorithm-association-rule-mining-under-dynamic-threshold-Safa-2019.pdf - Published Version - Requires a PDF viewer.
Available under License Creative Commons Attribution 4.0.

Download (1505Kb) | Preview
Official URL: http://dx.doi.org/10.3390/app9245398

Request Changes to record.

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.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Engineering > WMG (Formerly the Warwick Manufacturing Group)
Library of Congress Subject Headings (LCSH): Data mining, Association rule mining, Computer algorithms, Data sets
Journal or Publication Title: Applied Sciences
Publisher: MDPI
ISSN: 2076-3417
Official Date: 10 December 2019
Dates:
DateEvent
10 December 2019Published
4 December 2019Accepted
Volume: 9
Number: 24
Article Number: 5398
DOI: 10.3390/app9245398
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access (Creative Commons)
Date of first compliant deposit: 13 December 2019
Date of first compliant Open Access: 13 December 2019
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
PG106-2015BUniversiti Malayahttp://dx.doi.org/10.13039/501100004386

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us