Abstract
We propose a model of coverage patterns (CPs) and approaches for extracting CPs from transactional databases. The model is motivated by the problem of banner advertisement placement in e-commerce web sites. Normally, an advertiser expects that the banner advertisement should be displayed to a certain percentage of web site visitors. On the other hand, to generate more revenue for a given web site, the publisher makes efforts to meet the coverage demands of multiple advertisers. Informally, a CP is a set of non-overlapping items covered by certain percentage of transactions in a transactional database. The CPs do not satisfy the downward closure property. Efforts are being made in the literature to extract CPs using level-wise pruning approach. In this paper, we propose CP extraction approaches based on pattern growth techniques. Experimental results show that the proposed pattern growth approaches improve the performance over the level-wise pruning approach. The results also show that CPs could be used in meeting the demands of multiple advertisers.
Similar content being viewed by others
References
Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In VLDB (pp. 487–499).
Agrawal, R., Imieliński, T., Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD (pp. 207–216).
Agarwal, R., Aggarwal, C., Prasad, V. (2001). A tree projection algorithm for generation of frequent item sets. Journal of Parallel and Distributed Computing, 61(3), 350–371.
Amiri, A., & Menon, S. (2003). Efficient scheduling of internet banner advertisements. ACM, 3, 334–346.
Bonchi, F., Castillo, C., Donato, D., Gionis, A. (2008). Topical query decomposition. In Proceedings of ACM SIGKDD (pp. 52–60).
Brin, S., Motwani, R., Silverstein, C. (1997). Beyond market baskets: generalizing association rules to correlations. ACM SIGMOD Record, 26, 265–276.
Chvatal, V. (1979). A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 233–235.
Fimi (2010). Frequent itemset mining implementations repository. http://fimi.cs.helsinki.fi/.
Frank, A., & Asuncion, A. (2010). UCI machine learning repository.
Garey, M.R., Johnson, D.S., Stockmeyer, L. (1974). Some simplified np-complete problems. In Proceedings of ACM STOC (pp. 47–63).
Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q., Dayal, U., Hsu, M. (2000a). Freespan: frequent pattern-projected sequential pattern mining. In ACM SIGKDD (pp. 355–359).
Han, J., Pei, J., Yin, Y. (2000b). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29, 1–12.
Liu, B., Hsu, W., Ma, Y. (1999). Mining association rules with multiple minimum supports. In KDD, ACM (pp. 337–341).
Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M. (2004). Mining sequential patterns by pattern-growth: the prefixspan approach. TKDE, 16(11), 1424–1440.
Srinivas, P.G., Reddy, P.K., Sripada, B., Kiran, R.U., Kumar, D.S. (2012). Discovering coverage patterns for banner advertisement placement. In PAKDD (Vol. 2, 133–144).
Srinivas, P.G., Reddy, P.K., Trinath, A.V. (2013). Cppg: efficient mining of coverage patterns using projected pattern growth technique. In Proceedings of TAKDD. PAKDD Workshop (pp. 319–329). Springer.
Sripada, B., Polepalli, K., Rage, U. (2011). Coverage patterns for efficient banner advertisement placement. In WWW, ACM (pp. 131–132).
Venetis, P., Koutrika, G., Garcia-Molina, H. (2011). On the selection of tags for tag clouds. In Proceedings of ACM international conference on Web search and data mining, WSDM ‘11 (pp. 835–844).
Acknowledgments
We thank anonymous reviewers for their useful comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gowtham Srinivas, P., Krishna Reddy, P., Trinath, A.V. et al. Mining coverage patterns from transactional databases. J Intell Inf Syst 45, 423–439 (2015). https://doi.org/10.1007/s10844-014-0318-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10844-014-0318-3