• Journal of Information Processing Systems
• /
• 제17권2호
• /
• pp.426-439
• /
• 2021

To alleviate the cold-start problem and data sparsity in web service recommendation and meet the personalized needs of users, this paper proposes a personalized web service recommendation method based on a hybrid social network and multi-objective immune optimization. The network adds the element of the service provider, which can provide more real information and help alleviate the cold-start problem. Then, according to the proposed service recommendation framework, multi-objective immune optimization is used to fuse multiple attributes and provide personalized web services for users without adjusting any weight coefficients. Experiments were conducted on real data sets, and the results show that the proposed method has high accuracy and a low recall rate, which is helpful to improving personalized recommendation.

• 인터넷정보학회논문지
• /
• 제16권6호
• /
• pp.133-141
• /
• 2015

소셜 네트워크를 비롯해 다양한 소셜 미디어 서비스들에서 대량의 멀티미디어 콘텐츠들이 공유되고 있다. 소셜 네트워크에는 사용자의 현재 상황과 관심사가 드러나기 때문에 이러한 특징들을 추천시스템에 적용한다면 만족도가 높은 개인화된 추천이 가능할 것이다. 또한 음악을 감정에 따라 분류하고 사용자의 소셜 네트워크를 분석해 사용자가 최근 느끼고 있는 감정이나 현재 상황에 대해 분석한 정보를 이용한다면 사용자의 음악을 추천할 때에 유용할 것이다. 본 논문에서는 음악을 분류하기 위한 감정 모델을 만들고, 감정모델에 따라 음악을 분류하여 소셜 네트워크에 나타나는 사용자의 현재 감정 상태를 추출하여 음악추천을 하는 방법을 제안하고 실험을 통해 제안한 방법의 유효성을 검증한다.

• 디지털산업정보학회논문지
• /
• 제10권3호
• /
• pp.49-59
• /
• 2014

The Internet of Things(IoT) is a new promising technology made from a variety of technology. The IoT links the objects or people, then enabling anytime, anywhere connectivity for anything and not only for anyone. Social networking services have changed the way people communicate. Recently, new research challenges in many areas of Internet of things and social networking services are fired. In this paper, we propose things recommendation method using social relationship in social Internet of Things. We study previous researches about social network service, IoT, and social IoT. We proposed SIoT_FW(Social IoT Friendship Weight) using static and a dynamic social friendship weight. Also, our method considers four social relationships (Ownership Object Relationship, Co-Location Object Relationship, Social Object Relationship, Parental Object Relationship). We presents a music device scenario using our proposed method.

• Journal of Information Processing Systems
• /
• 제19권5호
• /
• pp.576-589
• /
• 2023

To upgrade home style recommendations and user satisfaction, this paper proposes a personalized and optimized recommendation algorithm for interior design style based on local social network, which includes data acquisition by three-dimensional (3D) model, home-style feature definition, and style association mining. Through the analysis of user behaviors, the user interest model is established accordingly. Combined with the location-based social network of association rule mining algorithm, the association analysis of the 3D model dataset of interior design style is carried out, so as to get relevant home-style recommendations. The experimental results show that the proposed algorithm can complete effective analysis of 3D interior home style with the recommendation accuracy of 82% and the recommendation time of 1.1 minutes, which indicates excellent application effect.

• 디지털산업정보학회논문지
• /
• 제8권4호
• /
• pp.43-51
• /
• 2012

Web 3.0 is the next-generation of the World Wide Web and is included two main platforms, semantic technologies and social computing environment. The basic idea of web 3.0 is to define structure data and link them in order to more effective discovery, automation, integration, and reuse across various applications. The semantic technologies represent open standards that can be applied on the top of the web. The social computing environment allows human-machine co-operations and organizing a large number of the social web communities. In the recent years, recommender systems have been combined with ontologies to further improve the recommendation by adding semantics to the context on the web 3.0. In this paper, we study previous researches about recommendation method and propose a recommendation method based on web 3.0. Our method scores documents based on context tags and social network services. Our social scoring model is computed by both a tagging score of a document and a tagging score of a document that was tagged by a user's friends.

• 디지털산업정보학회논문지
• /
• 제7권2호
• /
• pp.19-27
• /
• 2011

Recent development of information technologies produces a lot of community services. Social Network Service is one of the community services on the world wide webs. In the Social Network Service, a user can register other users as friends and enjoy communication through a virtual message. Previous researches show a few social service methods using manually generated tagging. However, the manual social tagging is not widely used in many social network services. Moreover, they do not consider ubiquitous computing environment. We propose a recommendation method for social service using contexts in ubiquitous environment. Our method scores documents based on context tags and social network services. Our social scoring model is computed by both a tagging score of a document and a tagging score of a document that was tagged by a user's friends.

• 디지털융복합연구
• /
• 제14권8호
• /
• pp.313-318
• /
• 2016

현대사회에서 추천 서비스는 클라이언트-서버 기반의 인터넷 서비스에서 소셜 네트워킹으로 변화되고 있다. 특히 최근에는 크라우드소싱과 소셜 네트워킹을 통하여 사용자에게 개인화 추천을 서비스하고 있다. 소셜 네트워크 기반 시스템은 메모리와 모델 기반 협력적 필터링을 이용한 추천 서비스 제공 방식과 목적에 따라 분류할 수 있다. 이에 본 논문에서는 소셜 네트워크 기반의 {사용자-연관 디자인} 행렬을 이용한 감성 디자인 추천을 제안한다. 제안하는 방법은 소셜 네트워크 기반에서 {사용자-연관 디자인} 행렬을 구성하고 메모리 기반 협력적 필터링을 이용하여 감성 디자인을 추천한다. 제안한 방법의 성능평가는 정확도와 재현율 검증을 진행한다. 정확도의 검증은 소셜 네트워크 기반의 추천 적용유무에 따른 F-measure를 사용한다.

• 인터넷정보학회논문지
• /
• 제15권5호
• /
• pp.73-82
• /
• 2014

최근 SNS가 이슈가 되고 다양한 분야에서 이를 이용한 연구가 활발하게 진행되고 있다. 특히 SNS 상에서 생성되는 여러 소셜 데이터를 기반으로 사용자의 관심사를 찾아내고 추천해 주는 시스템에 대한 연구가 대두되고 있다. 사용자의 관심과 선호도는 단순히 사용자가 작성한 글에서만 나타나는 것이 아니라, 친구와의 관계와 작성한 내용기반으로 분류되는 카테고리를 이용하여 파악될 수 있다. 본 논문에서는 사용자의 사회적 관계와 사용자가 작성한 소셜 데이터의 카테고리를 이용하여 사용자의 선호도를 자동으로 추출하고, 이를 기반으로 추천하는 방법을 제안한다. 그리고 실험을 통해 제안한 기법의 유효성을 검증한다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2019년도 춘계학술발표대회
• /
• pp.267-269
• /
• 2019

There are many recommendation systems offer an effort to get better preciseness the information to the users. In order to further improve more accuracy, the social network analysis method which is used to analyze data to community detection in social networks was introduced in the recommendation system and the result shows this method is improving more accuracy. In this paper, we propose a movie recommendation system using social network analysis and normalized discounted cumulative gain with the best accuracy. To estimate the performance, the collaborative filtering using the k nearest neighbor method, the social network analysis with collaborative filtering method and the proposed method are used to evaluate the MovieLens data. The performance outputs show that the proposed method get better the accuracy of the movie recommendation system than any other methods used in this experiment.

• Journal of Information Processing Systems
• /
• 제15권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.