A movie recommendation algorithm based on genre correlations

Sang Min Choi, Sang Ki Ko, Yo-Sub Han

Research output: Contribution to journalArticle

56 Citations (Scopus)

Abstract

Since the late 20th century, the number of Internet users has increased dramatically, as has the number of Web searches performed on a daily basis and the amount of information available. A huge amount of new information is transferred to the Web on a daily basis. However, not all data are reliable and valuable, which implies that it may become more and more difficult to obtain satisfactory results from Web searches. We often iterate searches several times to find what we are looking for. To solve this problem, researchers have suggested the use of recommendation systems. Instead of searching for the same information several times, a recommendation system proposes relevant information. In the Web 2.0 era, recommendation systems often rely on collaborative filtering by users. In general, a collaborative filtering approach based on user information such as gender, location, or preference is effective. However, the traditional approach can fail due to the cold-start problem or the sparsity problem, because initial user information is required for this approach to be effective. Recently, several attempts have been made to tackle these collaborative filtering problems. One such attempt used category correlations of contents. For instance, a movie has genre information provided by movie experts and directors. This category information is more reliable than user ratings. Moreover, newly created content always has category information, allowing avoidance of the cold-start problem. In this study, we consider a movie recommendation system and improve the previous algorithms based on genre correlations to correct its shortcomings. We also test the modified algorithm and analyze the results with respect to two characteristics of genre correlations.

Original languageEnglish
Pages (from-to)8079-8085
Number of pages7
JournalExpert Systems with Applications
Volume39
Issue number9
DOIs
Publication statusPublished - 2012 Jul 1

Fingerprint

Recommender systems
Collaborative filtering
Internet

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Cite this

Choi, Sang Min ; Ko, Sang Ki ; Han, Yo-Sub. / A movie recommendation algorithm based on genre correlations. In: Expert Systems with Applications. 2012 ; Vol. 39, No. 9. pp. 8079-8085.
@article{bfb1c5a8c39c4c47ae7017047c730a6e,
title = "A movie recommendation algorithm based on genre correlations",
abstract = "Since the late 20th century, the number of Internet users has increased dramatically, as has the number of Web searches performed on a daily basis and the amount of information available. A huge amount of new information is transferred to the Web on a daily basis. However, not all data are reliable and valuable, which implies that it may become more and more difficult to obtain satisfactory results from Web searches. We often iterate searches several times to find what we are looking for. To solve this problem, researchers have suggested the use of recommendation systems. Instead of searching for the same information several times, a recommendation system proposes relevant information. In the Web 2.0 era, recommendation systems often rely on collaborative filtering by users. In general, a collaborative filtering approach based on user information such as gender, location, or preference is effective. However, the traditional approach can fail due to the cold-start problem or the sparsity problem, because initial user information is required for this approach to be effective. Recently, several attempts have been made to tackle these collaborative filtering problems. One such attempt used category correlations of contents. For instance, a movie has genre information provided by movie experts and directors. This category information is more reliable than user ratings. Moreover, newly created content always has category information, allowing avoidance of the cold-start problem. In this study, we consider a movie recommendation system and improve the previous algorithms based on genre correlations to correct its shortcomings. We also test the modified algorithm and analyze the results with respect to two characteristics of genre correlations.",
author = "Choi, {Sang Min} and Ko, {Sang Ki} and Yo-Sub Han",
year = "2012",
month = "7",
day = "1",
doi = "10.1016/j.eswa.2012.01.132",
language = "English",
volume = "39",
pages = "8079--8085",
journal = "Expert Systems with Applications",
issn = "0957-4174",
publisher = "Elsevier Limited",
number = "9",

}

A movie recommendation algorithm based on genre correlations. / Choi, Sang Min; Ko, Sang Ki; Han, Yo-Sub.

In: Expert Systems with Applications, Vol. 39, No. 9, 01.07.2012, p. 8079-8085.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A movie recommendation algorithm based on genre correlations

AU - Choi, Sang Min

AU - Ko, Sang Ki

AU - Han, Yo-Sub

PY - 2012/7/1

Y1 - 2012/7/1

N2 - Since the late 20th century, the number of Internet users has increased dramatically, as has the number of Web searches performed on a daily basis and the amount of information available. A huge amount of new information is transferred to the Web on a daily basis. However, not all data are reliable and valuable, which implies that it may become more and more difficult to obtain satisfactory results from Web searches. We often iterate searches several times to find what we are looking for. To solve this problem, researchers have suggested the use of recommendation systems. Instead of searching for the same information several times, a recommendation system proposes relevant information. In the Web 2.0 era, recommendation systems often rely on collaborative filtering by users. In general, a collaborative filtering approach based on user information such as gender, location, or preference is effective. However, the traditional approach can fail due to the cold-start problem or the sparsity problem, because initial user information is required for this approach to be effective. Recently, several attempts have been made to tackle these collaborative filtering problems. One such attempt used category correlations of contents. For instance, a movie has genre information provided by movie experts and directors. This category information is more reliable than user ratings. Moreover, newly created content always has category information, allowing avoidance of the cold-start problem. In this study, we consider a movie recommendation system and improve the previous algorithms based on genre correlations to correct its shortcomings. We also test the modified algorithm and analyze the results with respect to two characteristics of genre correlations.

AB - Since the late 20th century, the number of Internet users has increased dramatically, as has the number of Web searches performed on a daily basis and the amount of information available. A huge amount of new information is transferred to the Web on a daily basis. However, not all data are reliable and valuable, which implies that it may become more and more difficult to obtain satisfactory results from Web searches. We often iterate searches several times to find what we are looking for. To solve this problem, researchers have suggested the use of recommendation systems. Instead of searching for the same information several times, a recommendation system proposes relevant information. In the Web 2.0 era, recommendation systems often rely on collaborative filtering by users. In general, a collaborative filtering approach based on user information such as gender, location, or preference is effective. However, the traditional approach can fail due to the cold-start problem or the sparsity problem, because initial user information is required for this approach to be effective. Recently, several attempts have been made to tackle these collaborative filtering problems. One such attempt used category correlations of contents. For instance, a movie has genre information provided by movie experts and directors. This category information is more reliable than user ratings. Moreover, newly created content always has category information, allowing avoidance of the cold-start problem. In this study, we consider a movie recommendation system and improve the previous algorithms based on genre correlations to correct its shortcomings. We also test the modified algorithm and analyze the results with respect to two characteristics of genre correlations.

UR - http://www.scopus.com/inward/record.url?scp=84862826817&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862826817&partnerID=8YFLogxK

U2 - 10.1016/j.eswa.2012.01.132

DO - 10.1016/j.eswa.2012.01.132

M3 - Article

VL - 39

SP - 8079

EP - 8085

JO - Expert Systems with Applications

JF - Expert Systems with Applications

SN - 0957-4174

IS - 9

ER -