Frequent pattern discovery with memory constraint

We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improving the mining efficiency or on reducing the memory size by best effort, we first attempt to constrain the upper memory size that can be utilized by mining frequent itemsets in this paper. Categories and Subject Descriptors: H.2.8 [Database Applications]: Data mining General Terms: Algorithms, Management

• Type: Conference
• Year: 2005
• Where: CIKM
• Authors: Kun-Ta Chuang, Ming-Syan Chen
• Keywords: CIKM 2005, Frequent Itemsets, Interesting Mining Task, Memory Size