Simple Search:

Compact structure representation in discovering frequent patterns for association rules


Citation

Mustapha, Norwati and Sulaiman, Md. Nasir and Othman, Mohamed and Selamat, Mohd Hasan (2002) Compact structure representation in discovering frequent patterns for association rules. Journal of Information and Communication Technology, 1 (1). pp. 19-31. ISSN 1675-414X; ESSN: 2180-3862

Abstract / Synopsis

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.


Download File

[img]
Preview
PDF (Abstract)
Compact structure representation in discovering frequent patterns for association rules.pdf

Download (34kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Computer Science and Information Technology
Publisher: Universiti Utara Malaysia Press
Keywords: Frequent patterns; Candidate sets; Association rules; Lexicographic tree; Itemsets
Depositing User: Nurul Ainie Mokhtar
Date Deposited: 10 Oct 2016 12:29
Last Modified: 10 Oct 2016 12:29
URI: http://psasir.upm.edu.my/id/eprint/34764
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item