Learning the Preferences of News Readers with SVM and Lasso Ranking

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01060666
Contributor : Hal Ifip <>
Submitted on : Friday, November 17, 2017 - 2:54:16 PM
Last modification on : Monday, December 18, 2017 - 1:11:00 AM
Long-term archiving on : Sunday, February 18, 2018 - 3:13:29 PM

File

HensingerFC10.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Elena Hensinger, Ilias Flaounas, Nello Cristianini. Learning the Preferences of News Readers with SVM and Lasso Ranking. 6th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations (AIAI), Oct 2010, Larnaca, Cyprus. pp.179-186, ⟨10.1007/978-3-642-16239-8_25⟩. ⟨hal-01060666⟩

Share

Metrics

Record views

130

Files downloads

120