DocumentCode :
2462490
Title :
Efficient Mining of Maximal Patterns using Order Preserving Generators
Author :
Nataraj, R.V. ; Selvan, S.
Author_Institution :
Dept. of Inf. Technol., PSG Coll. of Technol., Coimbatore
fYear :
2008
fDate :
14-17 Dec. 2008
Firstpage :
410
Lastpage :
415
Abstract :
In this paper, we address the problem of maximal frequent pattern mining from transactional datasets. Many of the existing algorithms for mining maximal patterns are based on frequent patterns which consume large amount of time & space. We propose OP-MAX (order preserving-maximal pattern mining) algorithm, which mines all the maximal patterns from transactional datasets with less space and time. Our methodology computes frequent closed maximal patterns and outputs maximal patterns among them. We also incorporate several optimization techniques to improve the mining efficiency. Experiments involving publicly available datasets show that our algorithm outperforms in time complexity when compared to the recently proposed FP-max, Eclat and MAFIA algorithms.
Keywords :
data mining; optimisation; pattern recognition; transaction processing; Eclat algorithm; FP-max algorithm; MAFIA algorithm; OP-MAX algorithm; maximal pattern mining; optimization techniques; order preserving generators; transactional datasets; Algorithm design and analysis; Association rules; Computer science; Data analysis; Data engineering; Data mining; Educational institutions; Information technology; Pattern analysis; Social network services; Closed Patterns; Data Mining; Maximal Patterns - Algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Computing and Communications, 2008. ADCOM 2008. 16th International Conference on
Conference_Location :
Chennai
Print_ISBN :
978-1-4244-2962-2
Electronic_ISBN :
978-1-4244-2963-9
Type :
conf
DOI :
10.1109/ADCOM.2008.4760481
Filename :
4760481
Link To Document :
بازگشت