Mustapha, Norwati and Nadimi-Shahraki, Mohammad-Hossein and Mamat, Ali and Sulaiman, Md. Nasir (2009) A numerical method for frequent pattern mining. Journal of Theoretical and Applied Information Technology, 7 (2). pp. 92-98. ISSN 1992-8645
Full text not available from this repository.
Frequent pattern mining is one of the active research themes in data mining. It plays an important role in all data mining tasks such as clustering, classification, prediction, and association analysis. Identifying all frequent patterns is the most time consuming process due to a massive number of patterns generated. A reasonable solution is identifying maximal frequent patterns which form the smallest representative set of patterns to generate all frequent patterns. In this paper, an efficient numerical method for mining frequent patterns is proposed. This method is based on prime number characteristics to generate all frequent patterns by using maximal frequent ones. There are two new properties introduced in this method; a novel tree structure called PC_Tree and PC_Miner algorithm. The PC_Tree is a simple tree structure but yet capable to capture the whole of transactions information with an efficient data transformation technique that utilizes the prime number theory. The PC_Miner algorithm traverses the PC_Tree by using an efficient pruning technique. The experimental results verify the compactness and the efficiency of mining shown by the proposed method.
|Keyword:||Data Mining; Frequent Pattern; Maximal frequent pattern; Data Transformation|
|Faculty or Institute:||Faculty of Computer Science and Information Technology|
|Publisher:||Asian Research Publication Network|
|Deposited By:||Umikalthom Abdullah|
|Deposited On:||25 Jan 2012 03:53|
|Last Modified:||12 Dec 2012 06:45|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 25 Jan 2012 03:53.