Recommender Systems using SVD with Social Network InformationRecommender Systems using SVD with Social Network Information
- Other Titles
- Recommender Systems using SVD with Social Network Information
- Authors
- 김민건; 김경재
- Issue Date
- Dec-2016
- Publisher
- 한국지능정보시스템학회
- Keywords
- 추천시스템; 사회연결망정보; 협업필터링; 특이값 분해; 비즈니스 애널리틱스; Recommender systems; Social network information; Collaborative filtering; Singular value decomposition; Business analytics
- Citation
- 지능정보연구, v.22, no.4, pp 1 - 18
- Pages
- 18
- Indexed
- KCI
- Journal Title
- 지능정보연구
- Volume
- 22
- Number
- 4
- Start Page
- 1
- End Page
- 18
- URI
- https://scholarworks.dongguk.edu/handle/sw.dongguk/16480
- ISSN
- 2288-4866
2288-4882
- Abstract
- Collaborative Filtering (CF) predicts the focal user’s preference for particular item based on user’s preference rating data and recommends items for the similar users by using them. It is a popular technique for the personalization in e-commerce to reduce information overload. However, it has some limitations including sparsity and scalability problems. In this paper, we use a method to integrate social network information into collaborative filtering in order to mitigate the sparsity and scalability problems which are major limitations of typical collaborative filtering and reflect the user's qualitative and emotional information in recommendation process. In this paper, we use a novel recommendation algorithm which is integrated with collaborative filtering by using Social SVD++ algorithm which considers social network information in SVD++, an extension algorithm that can reflect implicit information in singular value decomposition (SVD). In particular, this study will evaluate the performance of the model by reflecting the real-world user's social network information in the recommendation process.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Dongguk Business School > Department of Management Information System > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.