Abstract
With broadcast Television (TV) going digital, the number of channels and the programs aired have increased tremendously. Millions of audiences of various categories such as adults, children, youth and families watch these programs. Advertisements (ads) aired during these programs are targeted to reach these varied audiences and are the main revenue earners for TV broadcasters. While TV broadcasters have the task of scheduling hundreds of ads during the various ad breaks of programs, it is important that the ads shown during any ad break have a good impact on the viewers. An intelligent ad recommendation system that takes into account various factors such as ad/program content, viewers’ interests, sponsors’ preferences, program timing, program popularity and the available ad slot that help increasing the ad revenue would be useful for sponsors and broadcasters. We present in this paper a single end-to-end ad recommender system that considers all of these factors and recommends a set of well scheduled and sequenced ads that are the best suited for a given TV ad break. The proposed recommendation system captures the features of the ad video in terms of annotations derived from MPEG-7 descriptions and these annotation keywords are systematically grouped into a number of pre-defined semantic categories by using a categorization technique. A fuzzy categorical data clustering technique is then applied on the categorized data for grouping the best suited ads for a set of pre-defined program classes such as News, Sports, Cartoons etc. The program classes considered are selected to match with the TV program genres proposed in the TV-anytime standard. Since the same ad can be recommended to more than one program depending upon multiple parameters, fuzzy clustering acts as a well suited (and perhaps also the best suited) technique for ad recommendation. The relative fuzzy score called “degree of membership” calculated for each ad is an indicator of the number of program clusters to which the given ad belongs to. The clustered ads are then scheduled using an algorithm that takes into consideration parameters such as program popularity, program timing and available ad slots, to provide the best possible package for sponsors to show their ads. The scheduled set of ads if played randomly during an ad break might make viewers (sponsors) unhappy, for instance, when similar (competing) product ads get played consecutively. Hence, the system employs sequencing algorithm that takes into account the pre- and post-ad sequences in order to better order the scheduled set of ads in any ad break. We show that our proposed recommendation system provides an effective way of recommending the right ads for broadcast TV programs. We also demonstrate that this strategy does indeed help sponsors to attract viewers’ attention while playing their ads during ad breaks of TV programs. The proposed ad recommendation system is compared and evaluated subjectively with the current ad display system, by ten different people, and is rated with a high success score.
Similar content being viewed by others
References
Billsus, D., Pazzani, M.: A hybrid user model for news story classification. In: Proc. of Seventh Int. Conf. on User Modeling, June 1999
Shardanand, U., Maes, P.: Social information filtering: algorithms for automating word of mouth. In: Proc. of Human Factors in Computing Systems (CHIć695) Conf, pp. 210–217. ACM Press, New York (1995)
Burke, R.: Hybrid recommender systems: survey and experiments. User Model. User Adapt. Interact. 12(4), 331–370 (2002)
Bhargava, H.K., Sridhar, S., Herrick, C.: Beyond spreadsheets: tools for building decision support systems. IEEE Comput. 32(3), 31–39 (1999)
Bae, S.-M., Park, S.-C.: Fuzzy web ad selector based on web usage mining. In: IEEE Conf. on Intelligent Systems (2003)
Lekakos, G., et al.: A lifestyle-based approach for delivering personalised advertisements in digital iTV. J. Comput. Mediat. Comm., January (2004)
Kurapati, K., Gutta, S., Schaffer, D., Martino, J., Zimmerman, J.: A multi-agent TV recommender. Workshop on Personalization in Future TV, Germany (2001)
Masthoff, J.: Group modeling: selecting a sequence of television items to suit a group of viewers. User Model. User Adapt. Interact. (UMUAI) Journal 14, 37–85 (2004)
Kosala, R., Blockeel, H.: Web mining research—a survey. SIGKDD Explor. 2, 1–15 (2000)
Amit, T., Srividya, G., Sridhar, V.: ITV application for intent tracking. In: Proc. of 2nd European Conf. on Interactive TV (2004)
Zimmerman, J., Kurapati, K., Buczak, A.L., Schaffer, D., Gutta, S., Martino, J.: TV persolalization system—design of a TV show recommender engine and interface, Chap. 5. Persolaized Digital Television Book
He, Z.-Y., Xu, X.-F., Deng, S.-C., Dong, B.: K-histograms: an efficient clustering algorithm for categorical dataset. In: ARXIV, September 2005
Blanco-Fernandez, Y., Pazos-Arias, J.J., Gil-Solla, A., Ramos-Cabrer, M., Lopez-Nores, M., Barragans-Martinez, B.: AVATAR: a multi-agent TV recommender system using MHP applications. In: Proc. of e-Technology, e-Commerce and e-Service (2005)
Dukes, A.: The adverstising market in a product oligopoly. J. Indus. Econ. 52(3), 327–348 (2004)
https://www.google.com/adsense/support/bin/answer.py?answer=32757&topic=8526 http://msdn2.microsoft.com/en-us/library/
Rovira, M., et al.: IndexTV: a MPEG-7 based personlised recommentation system for digital TV. In: Proc. of IEEE Intl. Conf. on Multimedia and Expo (2004)
Miller, G., Backwith, R., Fellbuam, C., Gross, D., Miller, K.: Introduction to WordNet—an online lexical database. Int. J. Lexicogr.
Chen, H., Dumais, S.T.: Bringing order to the web: automatically categorizing search results. In: CHI’00 Proc. of the SIGCHI Conf. on Human factors in computing systems. ACM press, New York (2000)
Shen, D., Pan, R., Sun, J.T., Pan, J.J., Wu, K., Yin, J., Yang, Q.: Our winning solution to query classification in KDDCUP2005. SIGKDD Newsletter (2005)
He, Z., Xu, X., Deng, S.: Squeezer: an efficient clustering algorithm for categorical data. J. Comput. Sci. Technol. 17, 611–624 (2002)
Guha, S., et al.: ROCK: a robust clustering algorithm for categorical attributes. In: Proc. of Int. Conf. on Data Engineering, pp. 512–521, March 1999
Huang, Z.: Extensions to the K-means algorithm for clustering large datasets with categorical values. Data Min. Knowl. Discov.2, September 1998
Huang, Z.: A fuzzy K-modes algorithm for clustering categorical data. IEEE Trans. Fuzzy Syst. 7(4), (1999)
Frank, H., Frank, K., Rudolf, K., Thomas, R.: Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition. Wiley Publications, London (1999)
Bollapragada, S., Bussieck, M., Mallik, S.: Scheduling commercial videotapes in broadcast television. Oper. Res. November 2004
Subodha, K., Jacob, V.S., Chelliah, S.: Scheduling advertisements on a Web page to maximize revenue. Eur. J. Oper. Res. 1067–1089, September 2005
Saha, A., Pal, M., Pal, T.K.: Selection of programme slots of television channels for giving advertisement: A graph theoretic approach. Inf. Sci. 2480–2492, January 2007
Kimms, A., Müller Bungart, M.: Revenue management for broadcasting commercials: the channelć6s problem of selecting and scheduling the advertisements to be aired. Int. J. Rev. Manage. 1(1), 28–44 (2007)
Benoist, T., Bourreau, E., Rottembourg, B.: The TV-break packing problem. In: Eur. J. Oper. Res. 1371–1386, December (2005)
Ali, K., van Stam, W.: TiVo: Making Show Recommendations Using a Distributed Collaborative Filtering Architecture. KDD’04, August 2004
O’Connor, M., Herlocker, J.: Clustering items for collaborative filtering. In: SIGIR Workshop on Recommender Systems (2001)
Bollapragada, S., Mallik, S.: A mathematical programming based approach to scheduling commercials in broadcast television. Tecnical Report, GE Research and Developement Center, November 2001
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Velusamy, S., Gopal, L., Bhatnagar, S. et al. An efficient ad recommendation system for TV programs. Multimedia Systems 14, 73–87 (2008). https://doi.org/10.1007/s00530-008-0117-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00530-008-0117-1