Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике
Musical recommendations and personalization in a social network. / Bugaychenko, Dmitry; Dzuba, Alexandr.
Proceedings of the 7th ACM Conference on Recommender Systems. Association for Computing Machinery, 2013. стр. 367-370.Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике
}
TY - CHAP
T1 - Musical recommendations and personalization in a social network
AU - Bugaychenko, Dmitry
AU - Dzuba, Alexandr
PY - 2013
Y1 - 2013
N2 - This paper presents a set of algorithms used for music recommendations and personalization in a general purpose social network www.ok.ru, the second largest social network in the CIS visited by more then 40 millions users per day. In addition to classical recommendation features like "recommend a sequence" and "find similar items" the paper describes novel algorithms for construction of context aware recommendations, personalization of the service, handling of the cold-start problem, and more. All algorithms described in the paper are working on-line and are able to detect and address changes in the user's behavior and needs in the real time. The core component of the algorithms is a taste graph containing information about different entities (users, tracks, artists, etc.) and relations between them (for example, user A likes song B with certainty X, track B created by artist C, artist C is similar to artist D with certainty Y and so on). Using the graph it is possible to select tracks a user would most prob
AB - This paper presents a set of algorithms used for music recommendations and personalization in a general purpose social network www.ok.ru, the second largest social network in the CIS visited by more then 40 millions users per day. In addition to classical recommendation features like "recommend a sequence" and "find similar items" the paper describes novel algorithms for construction of context aware recommendations, personalization of the service, handling of the cold-start problem, and more. All algorithms described in the paper are working on-line and are able to detect and address changes in the user's behavior and needs in the real time. The core component of the algorithms is a taste graph containing information about different entities (users, tracks, artists, etc.) and relations between them (for example, user A likes song B with certainty X, track B created by artist C, artist C is similar to artist D with certainty Y and so on). Using the graph it is possible to select tracks a user would most prob
KW - recommender systems
U2 - 10.1145/2507157.2507192
DO - 10.1145/2507157.2507192
M3 - Article in an anthology
SN - 978-1-4503-2409-0
SP - 367
EP - 370
BT - Proceedings of the 7th ACM Conference on Recommender Systems
PB - Association for Computing Machinery
ER -
ID: 4656145