TY - GEN
T1 - Analyzing category correlations for recommendation system
AU - Scholz, Bernhard
AU - Choi, Sang Min
AU - Ko, Sang Ki
AU - Eom, Hae Sung
AU - Han, Yo Sub
N1 - Publisher Copyright:
© 2011 Association for Computing Machinery. All rights reserved.
PY - 2011/2/21
Y1 - 2011/2/21
N2 - Since the late 20th century, the Internet users have noticeably increased and these users have provided lots of information on the Web and searched for information from the Web. Now there are huge amount of new information on the Web everyday. However, not all data are reliable and valuable. This implies that it becomes more and more difficult to find a satisfactory result from the Web. We often iterate searching several times to find what we are looking for. Researcher suggests a recommendation system to solve this problem. Instead of searching several times, a recommendation system proposes relevant information. In the Web 2.0 era, a recommendation system often relies on the collaborative filtering from users. In general, the collaborative filtering approach works based on user information such as gender, location or preference. However, it may cause the cold-star problem or the sparsity problem since it requires initial user information. Recently, there are several attempts to tackle these collaborative filtering problems. One of such attempts is to use category correlation of contents. For instance, a movie has genre information given by movie experts and directors. We notice that these category information are more reliable compared with user ratings. Moreover, a newly created content always has category information; namely, we can avoid the cold-start problem. We consider a movie recommendation system. We revisit the previous algorithm using genre correlation and improve the algorithm. We also test the modified algorithm and analyze the results with respect to a characteristic of genre correlations.
AB - Since the late 20th century, the Internet users have noticeably increased and these users have provided lots of information on the Web and searched for information from the Web. Now there are huge amount of new information on the Web everyday. However, not all data are reliable and valuable. This implies that it becomes more and more difficult to find a satisfactory result from the Web. We often iterate searching several times to find what we are looking for. Researcher suggests a recommendation system to solve this problem. Instead of searching several times, a recommendation system proposes relevant information. In the Web 2.0 era, a recommendation system often relies on the collaborative filtering from users. In general, the collaborative filtering approach works based on user information such as gender, location or preference. However, it may cause the cold-star problem or the sparsity problem since it requires initial user information. Recently, there are several attempts to tackle these collaborative filtering problems. One of such attempts is to use category correlation of contents. For instance, a movie has genre information given by movie experts and directors. We notice that these category information are more reliable compared with user ratings. Moreover, a newly created content always has category information; namely, we can avoid the cold-start problem. We consider a movie recommendation system. We revisit the previous algorithm using genre correlation and improve the algorithm. We also test the modified algorithm and analyze the results with respect to a characteristic of genre correlations.
KW - Cold-start problem
KW - Genre Correlation
KW - Recommendation system
KW - Sparsity problem
UR - http://www.scopus.com/inward/record.url?scp=85185566089&partnerID=8YFLogxK
U2 - 10.1145/1968613.1968615
DO - 10.1145/1968613.1968615
M3 - Conference contribution
AN - SCOPUS:79955982961
T3 - ACM International Conference Proceeding Series
BT - Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011
PB - Association for Computing Machinery
T2 - 5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011
Y2 - 21 February 2011 through 23 February 2011
ER -