A Near Optimal Approach for Top-K Frequent Itemset Mining
Mining of top-k items is much useful to a user than mining transactions for minimum support threshold. User may only provide expected minimum support after careful scanning of transaction. Still experience and expertise would be required. However user can much more easily project expected number of items to be included as per requirements. For this purpose, some approaches have been suggested but they rely on FP Tree modification. The authors have implemented another efficient technique for mining frequent itemsets from web logs. This technique is termed as WRDSP for Web access pattern Relative Dot Sequence Path. In this paper, they demonstrate this technique for finding frequent itemsets in case of transactions naming it as RDSP.