Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset

Julaily Aida, Jusoh and Wan Aezwani, Wan Abu Bakar and Mustafa, Man (2018) Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset. International Journal of Engineering & Technology, 7 (4.1). pp. 134-137. ISSN 2227-524X

Text FH02-FIK-20-38454.pdf Restricted to Registered users only Download (301kB)

Abstract

Pattern mining refers to a subfield of data mining that uncovers interesting, unexpected, and useful patterns from transaction databases. Such patterns reflect frequent and infrequent patterns. An abundant literature has dedicated in frequent pattern mining and tremendous efficient algorithms for frequent itemset mining in the transaction database. Nonetheless, the infrequent pattern mining has emerged to be an interesting issue in discovering patterns that rarely occur in the transaction database. More researchers reckon that rare pattern occur-rences may offer valuable information in knowledge data discovery process. The R-Eclat is a novel algorithm that determines infrequent patterns in the transaction database. The multiple variants in the R-Eclat algorithm generate varied performances in infrequent mining patterns. This paper proposes IF-Postdiffset as a new variant in R-Eclat algorithm. This paper also highlights the performance of infrequent mining pattern from the transaction database among different variants of the R-Eclat algorithm regarding its execution time.

Actions (login required)

View Item