DSOSW: A Deleting Strategy in Mining Frequent Itemsets over Sliding Window of Stream

Most traditional mining approaches of frequent item sets consider mainly on databases and thus can use the second storage and need multiple scans which are not adapted to mining of stream. Some new algorithms over stream´s sliding window are presented recently, which perform addition and deletion over stream independently, so the common deleting strategy which removes the earliest transaction is used when the window slides. This paper considers both operations together to reduce the computation cost, consequently, three deleting strategies are proposed to improve the performance with little precision loss. The experimental results show that these strategies over current method are effective and efficient.