• Title/Summary/Keyword: social filtering

Search Result 156, Processing Time 0.024 seconds

Comparison of Recommendation Using Social Network Analysis with Collaborative Filtering in Social Network Sites (SNS에서 사회연결망 기반 추천과 협업필터링 기반 추천의 비교)

  • Park, Sangun
    • Journal of Information Technology Services
    • /
    • v.13 no.2
    • /
    • pp.173-184
    • /
    • 2014
  • As social network services has become one of the most successful web-based business, recommendation in social network sites that assist people to choose various products and services is also widely adopted. Collaborative Filtering is one of the most widely adopted recommendation approaches, but recommendation technique that use explicit or implicit social network information from social networks has become proposed in recent research works. In this paper, we reviewed and compared research works about recommendation using social network analysis and collaborative filtering in social network sites. As the results of the analysis, we suggested the trends and implications for future research of recommendation in SNSs. It is expected that graph-based analysis on the semantic social network and systematic comparative analysis on the performances of social filtering and collaborative filtering are required.

Proactive Friend Recommendation Method using Social Network in Pervasive Computing Environment (퍼베이시브 컴퓨팅 환경에서 소셜네트워크를 이용한 프로액티브 친구 추천 기법)

  • Kwon, Joon Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.1
    • /
    • pp.43-52
    • /
    • 2013
  • Pervasive computing and social network are good resources in recommendation method. Collaborative filtering is one of the most popular recommendation methods, but it has some limitations such as rating sparsity. Moreover, it does not consider social network in pervasive computing environment. We propose an effective proactive friend recommendation method using social network and contexts in pervasive computing environment. In collaborative filtering method, users need to rate sufficient number of items. However, many users don't rate items sufficiently, because the rating information must be manually input into system. We solve the rating sparsity problem in the collaboration filtering method by using contexts. Our method considers both a static and a dynamic friendship using contexts and social network. It makes more effective recommendation. This paper describes a new friend recommendation method and then presents a music friend scenario. Our work will help e-commerce recommendation system using collaborative filtering and friend recommendation applications in social network services.

A Social Travel Recommendation System using Item-based collaborative filtering

  • Kim, Dae-ho;Song, Je-in;Yoo, So-yeop;Jeong, Ok-ran
    • Journal of Internet Computing and Services
    • /
    • v.19 no.3
    • /
    • pp.7-14
    • /
    • 2018
  • As SNS(Social Network Service) becomes a part of our life, new information can be derived through various information provided by SNS. Through the public timeline analysis of SNS, we can extract the latest tour trends for the public and the intimacy through the social relationship analysis in the SNS. The extracted intimacy can also be used to make the personalized recommendation by adding the weights to friends with high intimacy. We apply SNS elements such as analyzed latest trends and intimacy to item-based collaborative filtering techniques to achieve better accuracy and satisfaction than existing travel recommendation services in a new way. In this paper, we propose a social travel recommendation system using item - based collaborative filtering.

Movie Recommendation Algorithm Using Social Network Analysis to Alleviate Cold-Start Problem

  • Xinchang, Khamphaphone;Vilakone, Phonexay;Park, Doo-Soon
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.616-631
    • /
    • 2019
  • With the rapid increase of information on the World Wide Web, finding useful information on the internet has become a major problem. The recommendation system helps users make decisions in complex data areas where the amount of data available is large. There are many methods that have been proposed in the recommender system. Collaborative filtering is a popular method widely used in the recommendation system. However, collaborative filtering methods still have some problems, namely cold-start problem. In this paper, we propose a movie recommendation system by using social network analysis and collaborative filtering to solve this problem associated with collaborative filtering methods. We applied personal propensity of users such as age, gender, and occupation to make relationship matrix between users, and the relationship matrix is applied to cluster user by using community detection based on edge betweenness centrality. Then the recommended system will suggest movies which were previously interested by users in the group to new users. We show shown that the proposed method is a very efficient method using mean absolute error.

Recommender Systems using SVD with Social Network Information (사회연결망정보를 고려하는 SVD 기반 추천시스템)

  • Kim, Min-Gun;Kim, Kyoung-jae
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.4
    • /
    • pp.1-18
    • /
    • 2016
  • 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.

Dynamic Recommender on User Taste Tendency Model : Focusing on Movie Recommender System (사용자 경향에 기반한 동적 추천 기법 : 영화 추천 시스템을 중심으로)

  • 이수정;이형동;김형주
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.2
    • /
    • pp.153-163
    • /
    • 2004
  • Many recommender systems are based on Content-based Filtering and Social Filtering Both methods have their own advantages and disadvantages, and they complement each other rather than compete. So incorporating of both methods can make the better system and combination technique controls the quality of the entire recommender system. In this paper, we presented each user has his own tendency to decide which is the better recommendation for himself among the various recommendation results, and suggested the Personalized combination technique. To represent user tendency, we defined and used loyalty, diversity and pioneerity and showed by experiments that our combination technique is useful. This combination technique improved the average coverage 23% and for the ceiling 40%.

Personalized Bookmark Search Word Recommendation System based on Tag Keyword using Collaborative Filtering (협업 필터링을 활용한 태그 키워드 기반 개인화 북마크 검색 추천 시스템)

  • Byun, Yeongho;Hong, Kwangjin;Jung, Keechul
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.11
    • /
    • pp.1878-1890
    • /
    • 2016
  • Web 2.0 has features produced the content through the user of the participation and share. The content production activities have became active since social network service appear. The social bookmark, one of social network service, is service that lets users to store useful content and share bookmarked contents between personal users. Unlike Internet search engines such as Google and Naver, the content stored on social bookmark is searched based on tag keyword information and unnecessary information can be excluded. Social bookmark can make users access to selected content. However, quick access to content that users want is difficult job because of the user of the participation and share. Our paper suggests a method recommending search word to be able to access quickly to content. A method is suggested by using Collaborative Filtering and Jaccard similarity coefficient. The performance of suggested system is verified with experiments that compare by 'Delicious' and "Feeltering' with our system.

An Event Recommendation Scheme Using User Preference and Collaborative Filtering in Social Networks (소셜 네트워크에서 사용자 성향 및 협업 필터링을 이용한 이벤트 추천 기법)

  • Bok, Kyoungsoo;Lee, Suji;Noh, Yeonwoo;Kim, Minsoo;Kim, Yeonwoo;Lim, Jongtae;Yoo, Jaesoo
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.10
    • /
    • pp.504-512
    • /
    • 2016
  • In this paper, we propose a personalized event recommendation scheme using user's activity analysis and collaborative filtering in social network environments. The proposed scheme predicts un-evaluated attribute values through analysis of user activities, relationships, and collaborative filtering. The proposed scheme also incorporates a user's recent preferences by considering the recent history for the user or context-aware information to precisely grasp the user's preferences. As a result, the proposed scheme can recommend events to users with a high possibility to participate in new events, preventing indiscriminate recommendations. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through performance evaluation.

Personalizing Information Using Users' Online Social Networks: A Case Study of CiteULike

  • Lee, Danielle
    • Journal of Information Processing Systems
    • /
    • v.11 no.1
    • /
    • pp.1-21
    • /
    • 2015
  • This paper aims to assess the feasibility of a new and less-focused type of online sociability (the watching network) as a useful information source for personalized recommendations. In this paper, we recommend scientific articles of interests by using the shared interests between target users and their watching connections. Our recommendations are based on one typical social bookmarking system, CiteULike. The watching network-based recommendations, which use a much smaller size of user data, produces suggestions that are as good as the conventional Collaborative Filtering technique. The results demonstrate that the watching network is a useful information source and a feasible foundation for information personalization. Furthermore, the watching network is substitutable for anonymous peers of the Collaborative Filtering recommendations. This study shows the expandability of social network-based recommendations to the new type of online social networks.

Credibility Enhancement of Online Reputation Systems for SNS Using Collaborative Filtering Method (협업필터링을 이용한 사회연결망서비스(SNS)용 온라인 평판시스템 신뢰도 향상에 관한 연구)

  • Cho, Jin-hyung;Kang, Hwan-Soo;Kim, Sea-Woo
    • Journal of Digital Convergence
    • /
    • v.15 no.2
    • /
    • pp.115-120
    • /
    • 2017
  • Online reputation systems for social network services(SNS) aggregate users' feedback and estimate the reputation of contents or providers. The aim of this research is to enhance credibility of the online reputation system on the SNS based e-Commerce(we called it as social commerce). SNS users usually refer to evaluations from other users who bought the products before. Most social commerce sites provide reputation system to help their customer make a decision, but sometimes we can't believe the reputation because the reputation is too subjective and the seller can deceive the customer for sales promotion. Threrefore, we usually use just the average value to show the general customer's evaluation result. We applied collaborative filtering method to give more weighting to the users who have evaluated correctly in the past. As a result, we could get more accurate evaluation results by considering each customers' credibility value that was computed by collaborative filtering.