Media
Forecasting the Success of Television Series using Machine Learning
Akula, Ramya, Wieselthier, Zachary, Martin, Laura, Garibay, Ivan
Television is an ever-evolving multi billion dollar industry. The success of a television show in an increasingly technological society is a vast multi-variable formula. The art of success is not just something that happens, but is studied, replicated, and applied. Hollywood can be unpredictable regarding success, as many movies and sitcoms that are hyped up and promise to be a hit end up being box office failures and complete disappointments. In current studies, linguistic exploration is being performed on the relationship between Television series and target community of viewers. Having a decision support system that can display sound and predictable results would be needed to build confidence in the investment of a new TV series. The models presented in this study use data to study and determine what makes a sitcom successful. In this paper, we use descriptive and predictive modeling techniques to assess the continuing success of television comedies: The Office, Big Bang Theory, Arrested Development, Scrubs, and South Park. The factors that are tested for statistical significance on episode ratings are character presence, director, and writer. These statistics show that while characters are indeed crucial to the shows themselves, the creation and direction of the shows pose implication upon the ratings and therefore the success of the shows. We use machine learning based forecasting models to accurately predict the success of shows. The models represent a baseline to understanding the success of a television show and how producers can increase the success of current television shows or utilize this data in the creation of future shows. Due to the many factors that go into a series, the empirical analysis in this work shows that there is no one-fits-all model to forecast the rating or success of a television show.
JSCN: Joint Spectral Convolutional Network for Cross Domain Recommendation
Liu, Zhiwei, Zheng, Lei, Zhang, Jiawei, Han, Jiayu, Yu, Philip S.
--Cross-domain recommendation can alleviate the data sparsity problem in recommender systems. T o transfer the knowledge from one domain to another, one can either utilize the neighborhood information or learn a direct mapping function. However, all existing methods ignore the high-order connectivity information in cross-domain recommendation area and suffer from the domain-incompatibility problem. In this paper, we propose a Joint Spectral Convolutional Network (JSCN) for cross-domain recommendation. JSCN will simultaneously operate multi-layer spectral convolutions on different graphs, and jointly learn a domain-invariant user representation with a domain adaptive user mapping module. As a result, the high-order comprehensive connectivity information can be extracted by the spectral convolutions and the information can be transferred across domains with the domain-invariant user mapping. The domain adaptive user mapping module can help the incompatible domains to transfer the knowledge across each other . Extensive experiments on 24 Amazon rating datasets show the effectiveness of JSCN in the cross-domain recommendation, with 9 .2% Recommending users with a set of preferred items is still an open problem [1]-[6], especially when the dataset is very sparse. To remedy the data sparsity issue, broad-leraning based model [7] and cross-domain recommender system [4], [8] are proposed where the information from other source domains can be transferred to the target domain. To transfer the knowledge from one domain to another, one can use the overlapping users [4], [6], [8], [9] in two ways: (1) the neighborhood information of common users stores the structure information of different domains with which we can do cross-domain recommendation [6], [10]; or (2) we can learn a mapping function [4], [8] to project latent vectors learned in one domain into another, and thus the knowledge can be transferred.