• Title/Summary/Keyword: Recommendation Method

Search Result 976, Processing Time 0.024 seconds

Collaborative Filtering and Genre Classification for Music Recommendation

  • Byun, Jeong-Yong;Nasridinov, Aziz
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.693-694
    • /
    • 2014
  • This short paper briefly describes the proposed music recommendation method that provides suitable music pieces to a listener depending on both listeners' ratings and content of music pieces. The proposed method consists of two methods. First, listeners' ratings prediction method is a combination the traditional user-based and item-based collaborative filtering methods. Second, genre classification method is a combination of feature extraction and classification procedures. The feature extraction step obtains audio signal information and stores it in data structure, while the second one classifies the music pieces into various genres using decision tree algorithm.

A Simple and Effective Combination of User-Based and Item-Based Recommendation Methods

  • Oh, Se-Chang;Choi, Min
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.127-136
    • /
    • 2019
  • User-based and item-based approaches have been developed as the solutions of the movie recommendation problem. However, the user-based approach is faced with the problem of sparsity, and the item-based approach is faced with the problem of not reflecting users' preferences. In order to solve these problems, there is a research on the combination of the two methods using the concept of similarity. In reality, it is not free from the problem of sparsity, since it has a lot of parameters to be calculated. In this study, we propose a combining method that simplifies the combination equation of prior study. This method is relatively free from the problem of sparsity, since it has less parameters to be calculated. Thus, it can get more accurate results by reflecting the users rating to calculate the parameters. It is very fast to predict new movie ratings as well. In experiments for the proposed method, the initial error is large, but the performance gets quickly stabilized after. In addition, it showed about 6% lower average error rate than the existing method using similarity.

Development of Music Recommendation System based on Customer Sentiment Analysis (소비자 감성 분석 기반의 음악 추천 알고리즘 개발)

  • Lee, Seung Jun;Seo, Bong-Goon;Park, Do-Hyung
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.4
    • /
    • pp.197-217
    • /
    • 2018
  • Music is one of the most creative act that can express human sentiment with sound. Also, since music invoke people's sentiment to get empathized with it easily, it can either encourage or discourage people's sentiment with music what they are listening. Thus, sentiment is the primary factor when it comes to searching or recommending music to people. Regard to the music recommendation system, there are still lack of recommendation systems that are based on customer sentiment. An algorithm's that were used in previous music recommendation systems are mostly user based, for example, user's play history and playlists etc. Based on play history or playlists between multiple users, distance between music were calculated refer to basic information such as genre, singer, beat etc. It can filter out similar music to the users as a recommendation system. However those methodology have limitations like filter bubble. For example, if user listen to rock music only, it would be hard to get hip-hop or R&B music which have similar sentiment as a recommendation. In this study, we have focused on sentiment of music itself, and finally developed methodology of defining new index for music recommendation system. Concretely, we are proposing "SWEMS" index and using this index, we also extracted "Sentiment Pattern" for each music which was used for this research. Using this "SWEMS" index and "Sentiment Pattern", we expect that it can be used for a variety of purposes not only the music recommendation system but also as an algorithm which used for buildup predicting model etc. In this study, we had to develop the music recommendation system based on emotional adjectives which people generally feel when they listening to music. For that reason, it was necessary to collect a large amount of emotional adjectives as we can. Emotional adjectives were collected via previous study which is related to them. Also more emotional adjectives has collected via social metrics and qualitative interview. Finally, we could collect 134 individual adjectives. Through several steps, the collected adjectives were selected as the final 60 adjectives. Based on the final adjectives, music survey has taken as each item to evaluated the sentiment of a song. Surveys were taken by expert panels who like to listen to music. During the survey, all survey questions were based on emotional adjectives, no other information were collected. The music which evaluated from the previous step is divided into popular and unpopular songs, and the most relevant variables were derived from the popularity of music. The derived variables were reclassified through factor analysis and assigned a weight to the adjectives which belongs to the factor. We define the extracted factors as "SWEMS" index, which describes sentiment score of music in numeric value. In this study, we attempted to apply Case Based Reasoning method to implement an algorithm. Compare to other methodology, we used Case Based Reasoning because it shows similar problem solving method as what human do. Using "SWEMS" index of each music, an algorithm will be implemented based on the Euclidean distance to recommend a song similar to the emotion value which given by the factor for each music. Also, using "SWEMS" index, we can also draw "Sentiment Pattern" for each song. In this study, we found that the song which gives a similar emotion shows similar "Sentiment Pattern" each other. Through "Sentiment Pattern", we could also suggest a new group of music, which is different from the previous format of genre. This research would help people to quantify qualitative data. Also the algorithms can be used to quantify the content itself, which would help users to search the similar content more quickly.

App Recommendation System Based on Collaborative Filtering

  • Nasridinov, Aziz;Park, Young-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.1158-1159
    • /
    • 2013
  • It gives to users a difficulty for searching between this huge numbers of programs. Searching the best applications for our needs is a big challenge today. In this paper, we propose a study on collaborative filtering based app recommendation system. The proposed method is composed of three steps. In the first step, we extract the data set from the target website. In the second step, we parse the extracted raw data according to the types, and store in a database. In the third, we perform recommendations based on the stored data in database.

Design and Implementation of SNS-based Exhibition-related Contents Recommendation Service (SNS 기반 전시물 관련 콘텐츠 추천 서비스 설계 및 구현)

  • Seo, Yoon-Deuk;Ahn, Jin-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.2
    • /
    • pp.95-101
    • /
    • 2012
  • As the influence of social networking services across the societies becomes greatly higher, many of the domestic agencies are trying to communicate with users through the introduction of social networking services. In this paper, we present a reliable exhibition-related contents recommendation service to combine social networking service concept with the customized contents recommendation method we previously proposed. The proposed service may effectively and reliably recommend its users exhibition-related contents by exploiting their relationships in the social networks compared with the existing ones.

An Collaborative Filtering Method based on Associative Cluster Optimization for Recommendation System (추천시스템을 위한 연관군집 최적화 기반 협력적 필터링 방법)

  • Lee, Hyun Jin;Jee, Tae Chang
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.3
    • /
    • pp.19-29
    • /
    • 2010
  • A marketing model is changed from a customer acquisition to customer retention and it is being moved to a way that enhances the quality of customer interaction to add value to our customers. Such personalization is emerging from this background. The Web site is accelerate the adoption of a personalization, and in contrast to the rapid growth of data, quantitative analytical experience is required. For the automated analysis of large amounts of data and the results must be passed in real time of personalization has been interested in technical problems. A recommendation algorithm is an algorithm for the implementation of personalization, which predict whether the customer preferences and purchasing using the database with new customers interested or likely to purchase. As recommended number of users increases, the algorithm increases recommendation time is the problem. In this paper, to solve this problem, a recommendation system based on clustering and dimensionality reduction is proposed. First, clusters customers with such an orientation, then shrink the dimensions of the relationship between customers to low dimensional space. Because finding neighbors for recommendations is performed at low dimensional space, the computation time is greatly reduced.

Handling Incomplete Data Problem in Collaborative Filtering System

  • Noh, Hyun-Ju;Kwak, Min-Jung;Han, In-Goo
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.2
    • /
    • pp.51-63
    • /
    • 2003
  • Collaborative filtering is one of the methodologies that are most widely used for recommendation system. It is based on a data matrix of each customer's preferences of products. There could be a lot of missing values in such preference data matrix. This incomplete data is one of the reasons to deteriorate the accuracy of recommendation system. There are several treatments to deal with the incomplete data problem such as case deletion and single imputation. Those approaches are simple and easy to implement but they may provide biased results. Multiple imputation method imputes m values for each missing value. It overcomes flaws of single imputation approaches through considering the uncertainty of missing values. The objective of this paper is to suggest multiple imputation-based collaborative filtering approach for recommendation system to improve the accuracy in prediction performance. The experimental works show that the proposed approach provides better performance than the traditional Collaborative filtering approach, especially in case that there are a lot of missing values in dataset used for recommendation system.

  • PDF

A CSP based Learner Tailoring Question Recommendation Process using Item Response Theory (문항반응이론을 이용한 CSP 기반의 학습자 중심 문제추천 프로세스)

  • Jeong, Hwa-Young
    • Journal of Internet Computing and Services
    • /
    • v.10 no.5
    • /
    • pp.145-152
    • /
    • 2009
  • Applications such as study guides and adaptive tutoring must rely on a fine grained student model to tailor their interaction with the user. They are useful for Computer Adaptive Testing (CAT), for example, where the test items can be administered in order to maximize the information. I study how to design learner tailoring question process for recommendation. And this process can be applied the CAT and I use the formal language such as CSP in each process development for efficient process design. I use the item difficulty of item response theory for question recommendation process and learner can choice the difficulty step for learning change to control the difficulty of question in next learning. Finally, this method displayed the structural difference to compare between existent and this process.

  • PDF

Personal Recommendation Service Design Through Big Data Analysis on Science Technology Information Service Platform (과학기술정보 서비스 플랫폼에서의 빅데이터 분석을 통한 개인화 추천서비스 설계)

  • Kim, Dou-Gyun
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.28 no.4
    • /
    • pp.501-518
    • /
    • 2017
  • Reducing the time it takes for researchers to acquire knowledge and introduce them into research activities can be regarded as an indispensable factor in improving the productivity of research. The purpose of this research is to cluster the information usage patterns of KOSEN users and to suggest optimization method of personalized recommendation service algorithm for grouped users. Based on user research activities and usage information, after identifying appropriate services and contents, we applied a Spark based big data analysis technology to derive a personal recommendation algorithm. Individual recommendation algorithms can save time to search for user information and can help to find appropriate information.

A Dynamic Recommendation Agent System for E-Mail Management based on Rule Filtering Component (이메일 관리를 위한 룰 필터링 컴포넌트 기반 능동형 추천 에이전트 시스템)

  • Jeong, Ok-Ran;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 2004.05a
    • /
    • pp.126-128
    • /
    • 2004
  • As e-mail is becoming increasingly important in every day life activity, mail users spend more and more time organizing and classifying the e-mails they receive into folder. Many existing recommendation systems or text classification are mostly focused on recommending the products for the commercial purposes or web documents. So this study aims to apply these application to e-mail more necessary to users. This paper suggests a dynamic recommendation agent system based on Rule Filtering Component recommending the relevant category to enable users directly to manage the optimum classification when a new e-mail is received as the effective method for E-Mail Management. Moreover we try to improve the accuracy as eliminating the limits of misclassification that can be key in classifying e-mails by category. While the existing Bayesian Learning Algorithm mostly uses the fixed threshold, we prove to improve the satisfaction of users as increasing the accuracy by changing the fixed threshold to the dynamic threshold. We designed main modules by rule filtering component for enhanced scalability and reusability of our system.

  • PDF