Learning the Preferences of News Readers with SVM and Lasso Ranking

We attack the task of predicting which news-stories are more appealing to a given audience by comparing ‘most popular stories’, gathered from various online news outlets, over a period of seven months, with stories that did not become popular despite appearing on the same page at the same time. We cast this as a learning-to-rank task, and train two different learning algorithms to reproduce the preferences of the readers, within each of the outlets. The first method is based on Support Vector Machines, the second on the Lasso. By just using words as features, SVM ranking can reach significant accuracy in correctly predicting the preference of readers for a given pair of articles. Furthermore, by exploiting the sparsity of the solutions found by the Lasso, we can also generate lists of keywords that are expected to trigger the attention of the outlets’ readers.

• Type: Journal
• Year: 2010
• Where: IFIP12
• Authors: Elena Hensinger, Ilias N. Flaounas, Nello Cristianini
• Keywords: IFIP12 2010, Information Technology, Lasso, Learning-to-rank Task, Support Vector Machines