• Title/Summary/Keyword: Recommendation System

Search Result 1,669, Processing Time 0.053 seconds

User Bias Drift Social Recommendation Algorithm based on Metric Learning

  • Zhao, Jianli;Li, Tingting;Yang, Shangcheng;Li, Hao;Chai, Baobao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.12
    • /
    • pp.3798-3814
    • /
    • 2022
  • Social recommendation algorithm can alleviate data sparsity and cold start problems in recommendation system by integrated social information. Among them, matrix-based decomposition algorithms are the most widely used and studied. Such algorithms use dot product operations to calculate the similarity between users and items, which ignores user's potential preferences, reduces algorithms' recommendation accuracy. This deficiency can be avoided by a metric learning-based social recommendation algorithm, which learns the distance between user embedding vectors and item embedding vectors instead of vector dot-product operations. However, previous works provide no theoretical explanation for its plausibility. Moreover, most works focus on the indirect impact of social friends on user's preferences, ignoring the direct impact on user's rating preferences, which is the influence of user rating preferences. To solve these problems, this study proposes a user bias drift social recommendation algorithm based on metric learning (BDML). The main work of this paper is as follows: (1) the process of introducing metric learning in the social recommendation scenario is introduced in the form of equations, and explained the reason why metric learning can replace the click operation; (2) a new user bias is constructed to simultaneously model the impact of social relationships on user's ratings preferences and user's preferences; Experimental results on two datasets show that the BDML algorithm proposed in this study has better recommendation accuracy compared with other comparison algorithms, and will be able to guarantee the recommendation effect in a more sparse dataset.

A Hybrid Music Recommendation System Combining Listening Habits and Tag Information (사용자 청취 습관과 태그 정보를 이용한 하이브리드 음악 추천 시스템)

  • Kim, Hyon Hee;Kim, Donggeon;Jo, Jinnam
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.2
    • /
    • pp.107-116
    • /
    • 2013
  • In this paper, we propose a hybrid music recommendation system combining users' listening habits and tag information in a social music site. Most of commercial music recommendation systems recommend music items based on the number of plays and explicit ratings of a song. However, the approach has some difficulties in recommending new items with only a few ratings or recommending items to new users with little information. To resolve the problem, we use tag information which is generated by collaborative tagging. According to the meaning of tags, a weighted value is assigned as the score of a tag of an music item. By combining the score of tags and the number of plays, user profiles are created and collaborative filtering algorithm is executed. For performance evaluation, precision, recall, and F-measure are calculated using the listening habit-based recommendation, the tag score-based recommendation, and the hybrid recommendation, respectively. Our experiments show that the hybrid recommendation system outperforms the other two approaches.

Adaptive Recommendation System for Health Screening based on Machine Learning

  • Kim, Namyun;Kim, Sung-Dong
    • International journal of advanced smart convergence
    • /
    • v.9 no.2
    • /
    • pp.1-7
    • /
    • 2020
  • As the demand for health screening increases, there is a need for efficient design of screening items. We build machine learning models for health screening and recommend screening items to provide personalized health care service. When offline, a synthetic data set is generated based on guidelines and clinical results from institutions, and a machine learning model for each screening item is generated. When online, the recommendation server provides a recommendation list of screening items in real time using the customer's health condition and machine learning models. As a result of the performance analysis, the accuracy of the learning model was close to 100%, and server response time was less than 1 second to serve 1,000 users simultaneously. This paper provides an adaptive and automatic recommendation in response to changes in the new screening environment.

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.

A Recommendation System using Dynamic Profiles and Relative Quantification

  • Lee, Se-Il;Lee, Sang-Yong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.7 no.3
    • /
    • pp.165-170
    • /
    • 2007
  • Recommendation systems provide users with proper services using context information being input from many sensors occasionally under ubiquitous computing environment. But in case there isn't sufficient context information for service recommendation in spite of much context information, there can be problems of resulting in inexact result. In addition, in the quantification step to use context information, there are problems of classifying context information inexactly because of using an absolute classification course. In this paper, we solved the problem of lack of necessary context information for service recommendation by using dynamic profile information. We also improved the problem of absolute classification by using a relative classification of context information in quantification step. As the result of experiments, expectation preference degree was improved by 7.5% as compared with collaborative filtering methods using an absolute quantification method where context information of P2P mobile agent is used.

Knowledge Recommendation Based on Dual Channel Hypergraph Convolution

  • Yue Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.11
    • /
    • pp.2903-2923
    • /
    • 2023
  • Knowledge recommendation is a type of recommendation system that recommends knowledge content to users in order to satisfy their needs. Although using graph neural networks to extract data features is an effective method for solving the recommendation problem, there is information loss when modeling real-world problems because an edge in a graph structure can only be associated with two nodes. Because one super-edge in the hypergraph structure can be connected with several nodes and the effectiveness of knowledge graph for knowledge expression, a dual-channel hypergraph convolutional neural network model (DCHC) based on hypergraph structure and knowledge graph is proposed. The model divides user data and knowledge data into user subhypergraph and knowledge subhypergraph, respectively, and extracts user data features by dual-channel hypergraph convolution and knowledge data features by combining with knowledge graph technology, and finally generates recommendation results based on the obtained user embedding and knowledge embedding. The performance of DCHC model is higher than the comparative model under AUC and F1 evaluation indicators, comparative experiments with the baseline also demonstrate the validity of DCHC model.

Automatic Music Recommendation System based on Music Characteristics

  • Kim, Sang-Ho;Kim, Sung-Tak;Kwon, Suk-Bong;Ji, Mi-Kyong;Kim, Hoi-Rin;Yoon, Jeong-Hyun;Lee, Han-Kyu
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.268-273
    • /
    • 2007
  • In this paper, we present effective methods for automatic music recommendation system which automatically recommend music by signal processing technology. Conventional music recommendation system use users’ music downloading pattern, but the method does not consider acoustic characteristics of music. Sometimes, similarities between music are used to find similar music for recommendation in some method. However, the feature used for calculating similarities is not highly related to music characteristics at the system. Thus, our proposed method use high-level music characteristics such as rhythm pattern, timbre characteristics, and the lyrics. In addition, our proposed method store features of music, which individuals queried, to recommend music based on individual taste. Experiments show the proposed method find similar music more effectively than a conventional method. The experimental results also show that the proposed method could be used for real-time application since the processing time for calculating similarities between music, and recommending music are fast enough to be applicable for commercial purpose.

  • PDF

Movie Recommendation System using Social Network Analysis and Normalized Discounted Cumulative Gain (소셜 네트워크 분석 및 정규화된 할인 누적 이익을 이용한 영화 추천 시스템)

  • Vilakone, Phonexay;Xinchang, Khamphaphone;Lee, Hanna;Park, Doo-Soon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.05a
    • /
    • 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.

Font Recommendation Service Based on Emotion Keyword Attribute Value Estimation (감정 기반 키워드 속성값 산출에 따른 글꼴 추천 서비스)

  • Ji, Youngseo;Lim, SoonBum
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.8
    • /
    • pp.999-1006
    • /
    • 2022
  • The use of appropriate fonts is not only an aesthetic point of view, but also a factor influencing the reinforcement of meaning. However, it is a difficult process and wastes a lot of time for general users to choose a font that suits their needs and emotions. Therefore, in this study, keywords and fonts to be used in the experiment were selected for emotion-based font recommendation, and keyword values for each font were calculated through an experiment to check the correlation between keywords and fonts. Using the experimental results, a prototype of a keyword-based font recommendation system was designed and the possibility of the system was tested. As a result of the usability evaluation of the font recommendation system prototype, it received a positive evaluation compared to the existing font search system, but the number of fonts was limited and users had difficulties in the process of associating keywords suitable for their desired situation. Therefore, we plan to expand the number of fonts and conduct follow-up research to automatically recommend fonts suitable for the user's situation without selecting keywords.

Survey for Movie Recommendation System: Challenge and Problem Solution (영화 추천 시스템을 위한 연구: 한계점 및 해결 방법)

  • Latt, Cho Nwe Zin;Aguilar, Mariz;Firdaus, Muhammad;Kang, Sung-Won;Rhee, Kyung-Hyune
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.594-597
    • /
    • 2022
  • Recommendation systems are a prominent approach for users to make informed automated judgments. In terms of movie recommendation systems, there are two methods used; Collaborative filtering, which is based on user similarities; and Content-based filtering which takes into account specific user's activity. However, there are still issues with these two existing methods, and to address those, a combination of collaborative and content-based filtering is employed to produce a more effective system. In addition, various similarity methodologies are used to identify parallels among users. This paper focuses on a survey of the various tactics and methods to find solutions based on the problems of the current recommendation system.