TY - GEN
T1 - Classical music for rock fans?
T2 - 19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10
AU - Nakatsuji, Makoto
AU - Fujiwara, Yasuhiro
AU - Tanaka, Akimichi
AU - Uchiyama, Toshio
AU - Fujimura, Ko
AU - Ishida, Toru
PY - 2010
Y1 - 2010
N2 - Most recommender algorithms produce types similar to those the active user has accessed before. This is because they measure user similarity only from the co-rating behaviors against items and compute recommendations by analyzing the items possessed by the users most similar to the active user. In this paper, we define item novelty as the smallest distance from the class the user accessed before to the class that includes target items over the taxonomy. Then, we try to accurately recommend highly novel items to the user. First, our method measures user similarity by employing items rated by users and a taxonomy of items. It can accurately identify many items that may suit the user. Second, it creates a graph whose nodes are users; weighted edges are set between users according to their similarity. It analyzes the user graph and extracts users that are related on the graph though the similarity between the active user and each of those users is not high. The users so extracted are likely to have highly novel items for the active user. An evaluation conducted on several datasets finds that our method accurately identifies items with higher novelty than previous methods.
AB - Most recommender algorithms produce types similar to those the active user has accessed before. This is because they measure user similarity only from the co-rating behaviors against items and compute recommendations by analyzing the items possessed by the users most similar to the active user. In this paper, we define item novelty as the smallest distance from the class the user accessed before to the class that includes target items over the taxonomy. Then, we try to accurately recommend highly novel items to the user. First, our method measures user similarity by employing items rated by users and a taxonomy of items. It can accurately identify many items that may suit the user. Second, it creates a graph whose nodes are users; weighted edges are set between users according to their similarity. It analyzes the user graph and extracts users that are related on the graph though the similarity between the active user and each of those users is not high. The users so extracted are likely to have highly novel items for the active user. An evaluation conducted on several datasets finds that our method accurately identifies items with higher novelty than previous methods.
KW - Collaborative filtering
KW - Novelty detection
UR - http://www.scopus.com/inward/record.url?scp=78651316651&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651316651&partnerID=8YFLogxK
U2 - 10.1145/1871437.1871558
DO - 10.1145/1871437.1871558
M3 - Conference contribution
AN - SCOPUS:78651316651
SN - 9781450300995
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 949
EP - 958
BT - CIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops
Y2 - 26 October 2010 through 30 October 2010
ER -