36 search results - page 1 / 8 » Greedy Recommending Is Not Always Optimal |
72
Voted
EWMF
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Recommender systems suggest objects to users. One form recommends documents or other objects to users searching information on a web site. A recommender system can be use...
88
Voted
JMLR
2010
14 years 5 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
93
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
106
Voted
LWA
2007
14 years 11 months ago
2007
Typical conversational recommender systems support interactive strategies that are hard-coded in advance and followed rigidly during a recommendation session. In fact, Reinforceme...
111
Voted
ACMICEC
2008
ACM
15 years 2 days ago
2008
ACM
Conventional conversational recommender systems support interaction strategies that are hard-coded into the system in advance. In this context, Reinforcement Learning techniques h...