dc.contributor.author | Hlaing, May Me Me | |
dc.contributor.author | Kham, Nang Saing Moon | |
dc.date.accessioned | 2019-07-12T04:47:05Z | |
dc.date.available | 2019-07-12T04:47:05Z | |
dc.date.issued | 2010-12-16 | |
dc.identifier.uri | http://onlineresource.ucsy.edu.mm/handle/123456789/847 | |
dc.description.abstract | Data mining is the process of analyzing large data sets in order to find patterns. Mining frequent patterns is a fundamental and crucial task in data mining problems. The association rule mining is needed in order to search for interesting relationship among items from a very large database. FP-Growth algorithm that allows mining of the frequent itemsets without candidate generation. In this paper, implement the pattern growth approach (FOLD-Growth) algorithm is used to analyze transaction database in the real world. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Fifth Local Conference on Parallel and Soft Computing | en_US |
dc.title | Analyzing Transaction database using Fast Online Dynamic-Growth (FOLD-growth) algorithm | en_US |
dc.type | Article | en_US |