• Title/Summary/Keyword: Recommendation Method

Search Result 976, Processing Time 0.027 seconds

Genre-based Collaborative Filtering Movie Recommendation (장르 기반 Collaborative Filtering 영화 추천)

  • Hwang, Ki-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.3
    • /
    • pp.51-59
    • /
    • 2010
  • There have been proposed several movie recommendation algorithms based on Collaborative Filtering(CF). CF decides neighbors whose ratings are the most similar to each other and it predicts how well users will like new movies, based on ratings from neighbors. This paper proposes a new method to improve the result predicted by CF based on genres of the movies seen by users. The proposed method can be combined to the most of all existing CF algorithms. In this paper, a performance evaluation has been conducted between an existing simple CF algorithm and CF-Genre that is the proposed genre-based method added to the CF algorithm. The result shows that CF-Genre improves 3.3% in prediction performance over existing CF algorithms.

A Study on Recommendation Technique Using Mining and Clustering of Weighted Preference based on FRAT (마이닝과 FRAT기반 가중치 선호도 군집을 이용한 추천 기법에 관한 연구)

  • Park, Wha-Beum;Cho, Young-Sung;Ko, Hyung-Hwa
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.419-428
    • /
    • 2013
  • Real-time accessibility and agility are required in u-commerce under ubiquitous computing environment. Most of the existing recommendation techniques adopt the method of evaluation based on personal profile, which has been identified with difficulties in accurately analyzing the customers' level of interest and tendencies, as well as the problems of cost, consequently leaving customers unsatisfied. Researches have been conducted to improve the accuracy of information such as the level of interest and tendencies of the customers. However, the problem lies not in the preconstructed database, but in generating new and diverse profiles that are used for the evaluation of the existing data. Also it is difficult to use the unique recommendation method with hierarchy of each customer who has various characteristics in the existing recommendation techniques. Accordingly, this dissertation used the implicit method without onerous question and answer to the users based on the data from purchasing, unlike the other evaluation techniques. We applied FRAT technique which can analyze the tendency of the various personalization and the exact customer.

(Efficient Methods for Combining User and Article Models for Collaborative Recommendation) (협력적 추천을 위한 사용자와 항목 모델의 효율적인 통합 방법)

  • 도영아;김종수;류정우;김명원
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.5_6
    • /
    • pp.540-549
    • /
    • 2003
  • In collaborative recommendation two models are generally used: the user model and the article model. A user model learns correlation between users preferences and recommends an article based on other users preferences for the article. Similarly, an article model learns correlation between preferences for articles and recommends an article based on the target user's preference for other articles. In this paper, we investigates various combination methods of the user model and the article model for better recommendation performance. They include simple sequential and parallel methods, perceptron, multi-layer perceptron, fuzzy rules, and BKS. We adopt the multi-layer perceptron for training each of the user and article models. The multi-layer perceptron has several advantages over other methods such as the nearest neighbor method and the association rule method. It can learn weights between correlated items and it can handle easily both of symbolic and numeric data. The combined models outperform any of the basic models and our experiments show that the multi-layer perceptron is the most efficient combination method among them.

Item Recommendation Technique Using Spark (Spark를 이용한 항목 추천 기법에 관한 연구)

  • Yun, So-Young;Youn, Sung-Dae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.5
    • /
    • pp.715-721
    • /
    • 2018
  • With the spread of mobile devices, the users of social network services or e-commerce sites have increased dramatically, and the amount of data produced by the users has increased exponentially. E-commerce companies have faced a task regarding how to extract useful information from a vast amount of data produced by the users. To solve this problem, there are various studies applying big data processing technique. In this paper, we propose a collaborative filtering method that applies the tag weight in the Apache Spark platform. In order to elevate the accuracy of recommendation, the proposed method refines the tag data in the preprocessing process and categorizes the items and then applies the information of periods and tag weight to the estimate rating of the items. After generating RDD, we calculate item similarity and prediction values and recommend items to users. The experiment result indicated that the proposed method process large amounts of data quickly and improve the appropriateness of recommendation better.

Big Data Analysis Method for Recommendations of Educational Video Contents (사용자 추천을 위한 교육용 동영상의 빅데이터 분석 기법 비교)

  • Lee, Hyoun-Sup;Kim, JinDeog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.12
    • /
    • pp.1716-1722
    • /
    • 2021
  • Recently, the capacity of video content delivery services has been increasing significantly. Therefore, the importance of user recommendation is increasing. In addition, these contents contain a variety of characteristics, making it difficult to express the characteristics of the content properly only with a few keywords(Elements used in the search, such as titles, tags, topics, words, etc.) specified by the user. Consequently, existing recommendation systems that use user-defined keywords have limitations that do not properly reflect the characteristics of objects. In this paper, we compare the efficiency of between a method using voice data-based subtitles and an image comparison method using keyframes of images in recommendation module of educational video service systems. Furthermore, we propose the types and environments of video content in which each analysis technique can be efficiently utilized through experimental results.

A Collaborative Filtering-based Recommendation System with Relative Classification and Estimation Revision based on Time (상대적 분류 방법과 시간에 따른 평가값 보정을 적용한 협력적 필터링 기반 추천 시스템)

  • Lee, Se-Il;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.2
    • /
    • pp.189-194
    • /
    • 2010
  • In the recommendation system that recommends services to a specific user by using the estimation value of other users for users' recommendation service, collaborative filtering methods are widely used. But such recommendation systems have problems that exact classification is not possible because a specific user is classified to already classified group in the course of clustering and inexact result can be recommended in case of big errors in users' estimation values. In this paper, in order to increase estimation accuracy, the researchers suggest a recommendation system that applies collaborative filtering after reclassifying on the basis of a specific user's classification items and then finding and correcting the estimation values of the users beyond the critical value of time. This system uses a method where a specific user is not classified to already classified group in the course of clustering but a group is reorganized on the basis of the specific user. In addition, the researchers correct estimation information by cutting off the subordinate 10% from the trimmed mean of samples and then applies weight over time to the remaining data. As the result of an experiment, the suggested method demonstrated about 14.9%'s more accurate estimation result in case of using MAE than general collaborative filtering method.

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.73-92
    • /
    • 2014
  • An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.

Design of Music Recommendation System Considering Context-Information in the Home Network (홈 네트워크에서 상황정보를 고려한 음악 추천 시스템 설계)

  • Song Chang-Woo;Kim Jomg-Hun;Lee Jung-Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.650-657
    • /
    • 2006
  • The music is a part of our daily life in these days. And when the people listen to the music, they are affected by the context. However, previous researches on the music recommendation system have the problem that they didn't consider the proper contextual information efficiently. They only used the content-based filtering or the method to use musical metadata (genre, artist, etc.). Recently, there are some researches about the music recommendation system which applies the status(temperature, humidity, etc.) of environments. But, it is difficult to be accepted by the contextual information. Therefore, we propose the music recommendation system that is dynamically applied by the contextual information as well as the metadata in the previous researches. And the system can provide users with the music that they want to listen to, and then the users can be more satisfied. Also, the services can be improved by the feedback of the users. In order to solve this problem, the context-information for selecting a music list is defined and the music recommendation system is designed by using the content-based filtering method. The system is suitable for the user's taste and the context. The music recommendation system we are proposing uses an OSGi framework in the home network. As a result, the satisfaction of users and the quality of services will be improved more efficiently by supporting the mobility of services as well as the distributed processing.

A Multimedia Contents Recommendation System using Preference Transition Probability (선호도 전이 확률을 이용한 멀티미디어 컨텐츠 추천 시스템)

  • Park, Sung-Joon;Kang, Sang-Gil;Kim, Young-Kuk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.164-171
    • /
    • 2006
  • Recently Digital multimedia broadcasting (DMB) has been available as a commercial service. The users sometimes have difficulty in finding their preferred multimedia contents and need to spend a lot of searching time finding them. They are even very likely to miss their preferred contents while searching for them. In order to solve the problem, we need a method for recommendation users preferred only minimum information. We propose an algorithm and a system for recommending users' preferred contents using preference transition probability from user's usage history. The system includes four agents: a client manager agent, a monitoring agent, a learning agent, and a recommendation agent. The client manager agent interacts and coordinates with the other modules, the monitoring agent gathers usage data for analyzing the user's preference of the contents, the learning agent cleans the gathered usage data and modeling with state transition matrix over time, and the recommendation agent recommends the user's preferred contents by analyzing the cleaned usage data. In the recommendation agent, we developed the recommendation algorithm using a user's preference transition probability for the contents. The prototype of the proposed system is designed and implemented on the WIPI(Wireless Internet Platform for Interoperability). The experimental results show that the recommendation algorithm using a user's preference transition probability can provide better performances than a conventional method.

Personalized Clothing and Food Recommendation System Based on Emotions and Weather (감정과 날씨에 따른 개인 맞춤형 옷 및 음식 추천 시스템)

  • Ugli, Sadriddinov Ilkhomjon Rovshan;Park, Doo-Soon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.11 no.11
    • /
    • pp.447-454
    • /
    • 2022
  • In the era of the 4th industrial revolution, we are living in a flood of information. It is very difficult and complicated to find the information people need in such an environment. Therefore, in the flood of information, a recommendation system is essential. Among these recommendation systems, many studies have been conducted on each recommendation system for movies, music, food, and clothes. To date, most personalized recommendation systems have recommended clothes, books, or movies by checking individual tendencies such as age, genre, region, and gender. Future generations will want to be recommended clothes, books, and movies at once by checking age, genre, region, and gender. In this paper, we propose a recommendation system that recommends personalized clothes and food at once according to the user's emotions and weather. We obtained user data from Twitter of social media and analyzed this data as user's basic emotion according to Paul Eckman's theory. The basic emotions obtained in this way were converted into colors by applying Hayashi's Quantification Method III, and these colors were expressed as recommended clothes colors. Also, the type of clothing is recommended using the weather information of the visualcrossing.com API. In addition, various foods are recommended according to the contents of comfort food according to emotions.