Home Author Index Search Volume 1 May 2009 ISSN 1797-9617

International Journal of

Recent Trends in Engineering

Home > Vol. 1, No. 1


International Journal of Recent Trends in Engineering (IJRTE)

ISSN 1797-9617

Volume 1, Number 1, May 2009

Issue on Computer Science

Page(s): 372-376

Memory Efficient Mining of Maximal Itemsets using Order Preserving Generators

R V Nataraj and S Selvan

Full text: PDF


In this paper, we propose a memory efficient algorithm for maximal frequent itemset mining from transactional datasets. We propose OP-MAX* (Order Preserving MAXimal itemset mining) algorithm, which mines all the maximal itemsets from transactional datasets with less space and time. Our methodology uses a memory efficient maximality checking technique to generate frequent maximal itemsets. We have also incorporated several optimization techniques to improve the mining efficiency. Experiments involving publicly available datasets show that our algorithm takes less memory and less computation time than other algorithms in most cases.

Index Terms

Data Mining, Closed Itemsets, Maximal Itemsets, Algorithms

Published by Academy Publisher in cooperation with the ACEEE

@ Copyright 2009 ACADEMY PUBLISHER All rights reserved