Earticle

초록

영어

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. We 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, we demonstrate this technique for finding frequent itemsets in case of transactions naming it as RDSP. After that we show, how this technique may be suitably modified for mining top-k itemsets. This technique scores over existing efficient techniques, which had been used in recent times. In this technique, each transaction updates the existing graph created by previous transactions, modifying the RDSP value associated with the link. The unique feature of the created RDSP graph is that it contains nodes equal to total number of items only. This significantly reduces the processing time and memory space required for ARM. The technique works optimally for small and moderate size database. Large databases give rise to enhanced RDSP, which are cumbersome in updating. Still, saving in number of access of database and efficient handling of generated RDSP graph achieved by the proposed technique make it a strong candidate for determining top-k itemsets.

목차

Abstract
 1. Introduction
 2. The Relative Dotted Sequence Path (RDSP) BASED ARM
  2.1. Running Example of RDSP Calculation
  2.2. RDSP Algorithm The creation of the proposed graph may be described as follows:
 3. The Performance Analysis
  3.1. ARM with Other Techniques
 4. Conclusion & Future Scope
 References

키워드

저자

• Shorya Agrawal [ Research Scholar, RGPV Bhopal, India ]
• Nirved K. Pandey [ Director, GEC Gwalior, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605