An Improved Version of Closed Spam by using Direct Bit Position Method
E.Elakkiya1, S.Ravichandran2, S.Suresh3

1Dr. E.Elakkiya, Assistant of Department of Computer Application, Alagappa University, Karaikudi, India.
2Dr. S. Ravichandran, Assistant Professor, Head of the Department, of Computer Science, The H.H. Rajah‟s College (Autonomous), Pudukkottai, India.
3Mr. S. Suresh, Assistant Professor, Department of Computer Science, Sri Krishna Arts and Science, Coimbatore India.

Manuscript received on November 16, 2019. | Revised Manuscript received on 23 November, 2019. | Manuscript published on December 10, 2019. | PP: 2927-2931 | Volume-9 Issue-2, December 2019. | Retrieval Number: L36901081219/2019©BEIESP | DOI: 10.35940/ijitee.L3690.129219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: This research paper is a new approach to Closed SPAM by Using Binary DBP Closed SPAM. The idea behind this algorithm is extending the previous DBP using SPAM. The feature DBP Closed SPAM is to retrieve large sequence database from closed Sequential Patterns The test evaluation is done on Real Datasets, experimented results shows that the algorithm DBP Closed SPAM is more efficient than the previous Closed SPAM algorithms. This is also a way to retrieve the closed frequent patterns in a sequence database by giving minimum support value. 
Keywords: Pattern Mining, Frequent Sequential Pattern, Closed Sequential, Bit Position Method
Scope of the Article: Sequential, Parallel and Distributed Algorithms and Data Structures