Amanjeet ThakurShefali Singh ThakurDeepali Thakur Deepali ThakurKrishna BalanSakti KarthigaPriyaWang FengR AgrawalT ImielinskiA Swami
Data Mining plays an important role in extracting patterns and other information from data.The Apriori Algorithm has been the most popular techniques infinding frequent patterns.However, Apriori Algorithm scans the database many times leading to large I/O.This paper is proposed to overcome the limitaions of Apriori Algorithm while improving the overall speed of execution for all variations in 'minimum support'.It is aimed to reduce the number of scans required to find frequent patters.
M. Naresh KumarB. Eswara Reddy
Zhenyi ZhaoZhou JianGurjot Singh GabaRoobaea AlroobaeaMehedi MasudSaeed Rubaiee
Mikołaj MorzyTadeusz MorzyZbyszko Królikowski
D. Kerana HanirexK. P. Kaliyamurthie
Manish SaggarAnirudha AgrawalAtharv Lad