Modifying iEclat algo ithm for infrequent patterns mining

Julaily Aida, Jusoh and Mustafa, Man (2018) Modifying iEclat algo ithm for infrequent patterns mining. In: International Conference on Computer and Network Applications (ICCNA), 05-06 Sep 2017, Kota Kinabalu, Malaysia.

[img] Text
Restricted to Registered users only

Download (304kB)


Pattern ruining has been extensively studied in research due to its successful application in several data mining scenarios. Association rules mining is a basic step to determine the correlation between data items based on frequency of occurrence. In database, data items can be found as frequent pattern and infrequent pattern. Frequently occuring pattern has been an interesting issue of research in marketing for the past 24 years. However, infrequent patterns could be used as a subject of research as an alternative since it indicates the absence of frequent patterns. Infrequent pattern mining is a variation of frequent pattern mining where it finds the uninteresting patterns which rarely occurs. Infrequent pattern mining has been widely demonstrated its utility in web mining, bioinformatic, medical, genetic and other fields. Eclat is one of the algorithm which applied in finding frequent patterns in a transaction database. In Eclat variants, iEclat is the latest algorithm which has a good performance in mining frequent pattern. A few parts of this algorithm need a modification to assure that it is suitable for mining infrequent pattern. This paper proposes an enhancement algorithm based on iEclat algorithms for mining infrequent pattern.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Informatics & Computing
Depositing User: Muhammad Akmal Azhar
Date Deposited: 18 Nov 2020 06:48
Last Modified: 18 Nov 2020 06:49

Actions (login required)

View Item View Item