Mustapha, N. and Sulaiman, M.N. and Othman, M. and Selamat, M.H. (2002) Compact structure representation in discovering frequent patterns for association rules. Journal of ICT, 1 (1). pp. 19-31. ISSN 1675-414X

Preview

PDF Download (632kB) | Preview

Abstract

Frequent pattern mining is a key problem in important data mining applications, such as the discovery of association rules, strong rules and episodes. Structure used in typical algorithms for solving this problem operate in several database scans and a large number of candidate generation. This paper presents a compact structure representation called Flex-tree in discovering frequent patterns for association rules. Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. Efficiency of mining is achieved with one scan of database instead of repeated database passes done in other methods and avoid the costly generation of large numbers of candidate sets, which dramatically reduces the search space.

Item Type:	Article
Uncontrolled Keywords:	frequent patterns, candidate sets, association rules, lexicographic tree, Itemsets
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	UNSPECIFIED
Depositing User:	Mrs. Norazmilah Yaakub
Date Deposited:	29 Aug 2010 04:13
Last Modified:	29 Aug 2010 04:13
URI:	https://repo.uum.edu.my/id/eprint/377

Actions (login required)

View Item