CPPG: Efficient mining of coverage patterns using projected pattern growth technique

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The knowledge of coverage patterns extracted from the transactional data sets is useful in efficient placement of banner advertisements. The existing algorithm to extract coverage patterns is an apriori-like approach. In this paper, we propose an improved coverage pattern mining method by exploiting the notion of "non-overlap pattern projection". The proposed approach improves the performance by efficiently pruning the search space and extracting the complete set of coverage patterns. The performance results show that the proposed approach significantly improves the performance over the existing approach. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Srinivas, P. G., Reddy, P. K., & Trinath, A. V. (2013). CPPG: Efficient mining of coverage patterns using projected pattern growth technique. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7867 LNAI, pp. 319–329). https://doi.org/10.1007/978-3-642-40319-4_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free