A Hybrid Harmony Search: Antlion Optimization Algorithm for Multi-Level High Utility Association Rule Mining

A Hybrid Harmony Search: Antlion Optimization Algorithm for Multi-Level High Utility Association Rule Mining

Sivamathi Abarajithan, S.Vijayarani
Copyright: © 2022 |Pages: 20
DOI: 10.4018/IJSIR.308293
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

High Utility Association Rule mining discovers high correlated products in the form of rules. Till date there was no existing algorithm for High Utility Association Rules in a multi-level database. This research work proposes a Hybrid Harmony Search - Antlion Optimization algorithm (HHSAO) to retrieve high utility association rules in multi-level transaction database. First the proposed algorithm implements Harmony Search Algorithm to remove less profitable transactions and then apply Antlion trapping behaviour of Antlion Optimization algorithm to recover the rules from reduced database.The performance of proposed algorithm was compared with adopted existing algorithms like GA, PSO, ACO, AMO, BSO, PeSO, HS and ALO. The experiment was carried out with six datasets. The experimental results prove that the HHSAO algorithm works better.
Article Preview
Top

1. Introduction

1.1. High Utility Association Rule Mining

In some true applications, data mining procedures are utilized to take out intriguing instances from the databases, for helping vital basic leadership (Meruva, & Bondu, 2021). Two major undertakings for detection of fascinating relationships between items are: itemset mining and association rule mining (ARM). Numerous algorithms have been proposed to proficiently mine affiliation rules. The limitation with ARM is that it deliberates only the existences of items, not any other factors. Later another choice to association rule mining, called Quantitative Affiliation Rule Mining (QARM) was proposed. QARM considers quantity of items along with existences of items. Both affiliation rule mining and quantitative affiliation rule mining don't consider different elements for assessing instances, the value, utility, significance, weight etc.

To address this impediment of customary association rule mining and quantitative affiliation rule mining systems, High-Utility Association Rule Mining (HURM) was proposed. (Mai, Vo, & Nguyen, 2017).

HURM discovers rules from High-Utility Itemsets (HUIs) (Stuti, Gupta, Srivastava & Verma,2022) (Agarwal, 2022). The utility of an itemset could evaluate regarding buying amounts and unit benefits of items (Lin, Wu, & Tseng, 2015). At the point when the utility of an itemset is bigger than base utility limit, an itemset is viewed as a HUIs. HUI mining is valuable to find profoundly productive and fascinating instances, and it would thus be able to be considered as more reasonable than Functional Independence Measure for a few applications. HUIs can be utilized to take key business choices and adjust business systems to build deals and benefit. Hence HURM retrieved from HUIs can reveal highly semantic significant and highly correlated rules (Sahoo, Das & Adrijit, 2015) (Nguyen, Mai, & Vo,2019).

Generation of utility association rules(Krishna, & Ravi, 2020) is also contain two phases. The first phase in generating high utility itemset and in second phase, utility association rules are retrieved from these high utility itemsets. Utility association rules are represented as, I1® I2 and is defined as utility association rules only if, I1 and I2 are high utility itemsets and I1 Ç I2 is NULL. In utility based association rules, these support and confidence measures are not sufficient. The utility factors for the rules have to be incorporated in rules.

In this work, a novel measurement for utility confidence is given as,Util.conf(I1® I2) = IJSIR.308293.m01(1) i.e it is a ratio of Transaction Utility (TU) of transactions contains both items to the transaction utility of transaction containing first item. The preliminary definitions and calculations of utility mining are available in: [3][4][5][6].

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 3 Issues (2023)
Volume 13: 4 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing