Proceedings of the Fourth ACM Conference on Recommender Systems 2010
DOI: 10.1145/1864708.1864769
|View full text |Cite
|
Sign up to set email alerts
|

Towards context-aware personalization and a broad perspective on the semantics of news articles

Abstract: We analyze preferences and the reading flow of users of a popular Austrian online newspaper. Unlike traditional news filtering approaches, we postulate that a user's preference for particular articles depends not only on the topic and on propositional contents, but also on the user's current context and on more subtle attributes. Our assumption is motivated by the observation that many people read newspapers because they actually enjoy the process. Such sentiments depend on a complex variety of factors. The pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 9 publications
0
11
0
Order By: Relevance
“…As it was mentioned in paper on news recommending (Jancsary et al, 2010) there are context-sensitive features. To involve these aspects we need to find them in real-time.…”
Section: Related Workmentioning
confidence: 99%
“…As it was mentioned in paper on news recommending (Jancsary et al, 2010) there are context-sensitive features. To involve these aspects we need to find them in real-time.…”
Section: Related Workmentioning
confidence: 99%
“…However, the features that are extracted in this step partially determine the power of our hypothesis space. In previous work [8], we motivated and determined of number of such characteristics. Moreover, we recently conducted a psychological study in order to gain further insights into the factors that really drive user preference in the domain of news articles.…”
Section: Feature Extractionmentioning
confidence: 99%
“…In earlier work [8], we experimented with the classic Perceptron [12], the family of Passive-Aggressive online algorithms [2] and the Forgetron [3]. The latter can also incorporate a Mercer kernel in order to overcome the linear decision boundary of (2).…”
Section: Learning Componentmentioning
confidence: 99%
See 2 more Smart Citations