| dc.date.accessioned |
2013-12-11T07:15:35Z |
und |
| dc.date.accessioned |
2017-10-24T12:23:38Z |
|
| dc.date.available |
2013-12-11T07:15:35Z |
und |
| dc.date.available |
2017-10-24T12:23:38Z |
|
| dc.date.issued |
2013-12-11T07:15:35Z |
|
| dc.identifier.uri |
http://radr.hulib.helsinki.fi/handle/10138.1/3365 |
und |
| dc.identifier.uri |
http://hdl.handle.net/10138.1/3365 |
|
| dc.title |
Music recommendation by exploiting users' listening history |
en |
| ethesis.department.URI |
http://data.hulib.helsinki.fi/id/225405e8-3362-4197-a7fd-6e7b79e52d14 |
|
| ethesis.department |
Institutionen för datavetenskap |
sv |
| ethesis.department |
Department of Computer Science |
en |
| ethesis.department |
Tietojenkäsittelytieteen laitos |
fi |
| ethesis.faculty |
Matematisk-naturvetenskapliga fakulteten |
sv |
| ethesis.faculty |
Matemaattis-luonnontieteellinen tiedekunta |
fi |
| ethesis.faculty |
Faculty of Science |
en |
| ethesis.faculty.URI |
http://data.hulib.helsinki.fi/id/8d59209f-6614-4edd-9744-1ebdaf1d13ca |
|
| ethesis.university.URI |
http://data.hulib.helsinki.fi/id/50ae46d8-7ba9-4821-877c-c994c78b0d97 |
|
| ethesis.university |
Helsingfors universitet |
sv |
| ethesis.university |
University of Helsinki |
en |
| ethesis.university |
Helsingin yliopisto |
fi |
| dct.creator |
Zhou, Wenqing |
|
| dct.issued |
2013 |
|
| dct.language.ISO639-2 |
eng |
|
| dct.abstract |
With the prevalence of Internet and mobile technology, it becomes much easier for people to access millions of songs anywhere, anytime. The explosive increase of music collections on the Internet makes music retrieval much harder and more complicated for normal users. A music recommender system is a music retrieval system, which actively recommends music collections to users based on their preferences.
Many general recommender system techniques are also suitable for music recommendation. In this work, we evaluated five music recommendation algorithms: popularity-based, item-based, userbased, Pure-SVD, and incremental-SVD approach. The experiment was conducted on a real-world music listening history dataset from Last.fm. We used recall@N to evaluate the performance of different recommendation algorithms on a top-N recommendation task.
The result showed that the SVD-based approaches generally have better performance than other types of recommendation algorithm. The incremental-SVD approach produced the best performance among all, and the Pure-SVD approach achieved the second-best result with very good scalability. |
en |
| dct.language |
en |
|
| ethesis.language.URI |
http://data.hulib.helsinki.fi/id/languages/eng |
|
| ethesis.language |
English |
en |
| ethesis.language |
englanti |
fi |
| ethesis.language |
engelska |
sv |
| ethesis.thesistype |
pro gradu-avhandlingar |
sv |
| ethesis.thesistype |
pro gradu -tutkielmat |
fi |
| ethesis.thesistype |
master's thesis |
en |
| ethesis.thesistype.URI |
http://data.hulib.helsinki.fi/id/thesistypes/mastersthesis |
|
| ethesis.degreeprogram |
Algorithms and Machine Learning |
en |
| dct.identifier.urn |
URN:NBN:fi-fe2017112251274 |
|
| dc.type.dcmitype |
Text |
|
