Mining Frequent patterns under Limited Memory:Without Hard Disk Drive

• Main Authors: Peng-Yu Huang, 黃鵬彧
• Other Authors: Wei-Cheng Lin
• Format: Others
• Language: zh-TW
• Published: 2015
• Online Access: http://ndltd.ncl.edu.tw/handle/sqfg6f

碩士 === 國立高雄應用科技大學 === 資訊工程系 === 103 === When it comes to data mining, it’s a noun that popped up several years ago. Nowadays, data mining has been replaced with big data mining which derives frequent pattern mining that also importantly regarded. Data has become much more important than property not only because our world is filled with computers and digital messages but also because we can't directly find what we need in a great deal of data. Thus, it's a trend to use skill-explored ways to find valuable messages and gain more benefits. According to compile statistics, because our hard disk and memory grow multiple every season results in that we can't deal with data-explored growth correct due to we only have to handle few data like 64kbyte or 128kbyte. It brings a new noun called big data mining. In this study, we come up with a way of FP-Tree. Achieving our goal by using a whole new FP-Tree and sorts an exploring of big data mining in core memory.