• Title/Summary/Keyword: personalized recommender algorithm

Search Result 29, Processing Time 0.023 seconds

A Personalized Clothing Recommender System Based on the Algorithm for Mining Association Rules (연관 규칙 생성 알고리즘 기반의 개인화 의류 추천 시스템)

  • Lee, Chong-Hyeon;Lee, Suk-Hoon;Kim, Jang-Won;Baik, Doo-Kwon
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.59-66
    • /
    • 2010
  • We present a personalized clothing recommender system - one that mines association rules from transaction described in ontologies and infers a recommendation from the rules. The recommender system can forecast frequently changing trends of clothing using the Onto-Apriori algorithm, and it makes appropriate recommendations for each users possible through the inference marked as meta nodes. We simulates the rule generator and the inferential search engine of the system with focus on accuracy and efficiency, and our results validate the system.

PReAmacy: A Personalized Recommendation Algorithm considering Contents and Intimacy between Users in Social Network Services (PReAmacy: 소셜 네트워크 서비스에서 콘텐츠와 사용자의 친밀도를 고려한 개인화 추천 알고리즘)

  • Seo, Young-Duk;Kim, Jeong-Dong;Baik, Doo-Kwon
    • Journal of KIISE:Databases
    • /
    • v.41 no.4
    • /
    • pp.209-216
    • /
    • 2014
  • Various characteristics of social network contents such as real-time, people relationship and big data can help to improve personalized recommender systems. Among them, 'people relationship' is a key factor of recommendation, so many personalized recommender systems utilizing it have been proposed. However, existing researches can not reflect personal tendency and are unable to provide precise recommendations in various domains, because they do not consider intimacy among people. In this paper, to solve these problems, we propose PReAmacy, a Personalized Recommendation Algorithm, considering intimacy among users and various characteristics of social network contents. Our experimental results indicate that not only the precision of PReAmacy is higher than that of existing algorithms, but intimacy is of great importance in PReAmacy.

XOnto-Apriori: An eXtended Ontology Reasoning-based Association Rule Mining Algorithm (XOnto-Apriori: 확장된 온톨로지 추론 기반의 연관 규칙 마이닝 알고리즘)

  • Lee, Chong-Hyeon;Kim, Jang-Won;Jeong, Dong-Won;Lee, Suk-Hoon;Baik, Doo-Kwon
    • The KIPS Transactions:PartD
    • /
    • v.18D no.6
    • /
    • pp.423-432
    • /
    • 2011
  • In this paper, we introduce XOnto-Apriori algorithm which is an extension of the Onto-Apriori algorithm. The extended algorithm is designed to improve the conventional algorithm's problem of comparing only identifiers of transaction items by reasoning transaction properties of the items which belong in the same category. We show how the mining algorithm works with a smartphone application recommender system based on our extended algorithm to clearly describe the procedures providing personalized recommendations. Further, our simulation results validate our analysis on the algorithm overhead, precision, and recall.

Development of a Personalized Similarity Measure using Genetic Algorithms for Collaborative Filtering

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.12
    • /
    • pp.219-226
    • /
    • 2018
  • Collaborative filtering has been most popular approach to recommend items in online recommender systems. However, collaborative filtering is known to suffer from data sparsity problem. As a simple way to overcome this problem in literature, Jaccard index has been adopted to combine with the existing similarity measures. We analyze performance of such combination in various data environments. We also find optimal weights of factors in the combination using a genetic algorithm to formulate a similarity measure. Furthermore, optimal weights are searched for each user independently, in order to reflect each user's different rating behavior. Performance of the resulting personalized similarity measure is examined using two datasets with different data characteristics. It presents overall superiority to previous measures in terms of recommendation and prediction qualities regardless of the characteristics of the data environment.

User-Item Matrix Reduction Technique for Personalized Recommender Systems (개인화 된 추천시스템을 위한 사용자-상품 매트릭스 축약기법)

  • Kim, Kyoung-Jae;Ahn, Hyun-Chul
    • Journal of Information Technology Applications and Management
    • /
    • v.16 no.1
    • /
    • pp.97-113
    • /
    • 2009
  • Collaborative filtering(CF) has been a very successful approach for building recommender system, but its widespread use has exposed to some well-known problems including sparsity and scalability problems. In order to mitigate these problems, we propose two novel models for improving the typical CF algorithm, whose names are ISCF(Item-Selected CF) and USCF(User-Selected CF). The modified models of the conventional CF method that condense the original dataset by reducing a dimension of items or users in the user-item matrix may improve the prediction accuracy as well as the efficiency of the conventional CF algorithm. As a tool to optimize the reduction of a user-item matrix, our study proposes genetic algorithms. We believe that our approach may relieve the sparsity and scalability problems. To validate the applicability of ISCF and USCF, we applied them to the MovieLens dataset. Experimental results showed that both the efficiency and the accuracy were enhanced in our proposed models.

  • PDF

Optimal Diversity of Recommendation List for Recommender Systems based on the Users' Desire Diversity

  • Mehrjoo, Saeed;Mehrjoo, Mehrdad;Hajipour, Farahnaz
    • Journal of Information Science Theory and Practice
    • /
    • v.7 no.3
    • /
    • pp.31-39
    • /
    • 2019
  • Nowadays, recommender systems suggest lists of items to users considering not only accuracy but also diversity and novelty. However, suggesting the most diverse list of items to all users is not always acceptable, since different users prefer and/or tolerate different degree of diversity. Hence suggesting a personalized list with a diversity degree considering each user preference would improve the efficiency of recommender systems. The main contribution and novelty of this study is to tune the diversity degree of the recommendation list based on the users' variety-seeking feature, which ultimately leads to users' satisfaction. The proposed approach considers the similarity of users' desire diversity as a new parameter in addition to the usual similarity of users in the state-of-the-art collaborative filtering algorithm. Experimental results show that the proposed approach improves the personal diversity criterion comparing to the closest method in the literature, without decreasing accuracy.

Product Recommender System for Online Shopping Malls using Data Mining Techniques (데이터 마이닝을 이용한 인터넷 쇼핑몰 상품추천시스템)

  • Kim, Kyoung-Jae;Kim, Byoung-Guk
    • Journal of Intelligence and Information Systems
    • /
    • v.11 no.1
    • /
    • pp.191-205
    • /
    • 2005
  • This paper presents a novel product recommender system as a tool fur differentiated marketing service of online shopping malls. Ihe proposed model uses genetic algorithnt one of popular global optimization techniques, to construct a personalized product recommender systen The genetic algorinun may be useful to recommendation engine in product recommender system because it produces optimal or near-optimal recommendation rules using the customer profile and transaction data. In this study, we develop a prototype of WeLbased personalized product recommender system using the recommendation rules fi:om the genetic algorithnL In addition, this study evaluates usefulness of the proposed model through the test fur user satisfaction in real world.

  • PDF

Personalized Expert-Based Recommendation (개인화된 전문가 그룹을 활용한 추천 시스템)

  • Chung, Yeounoh;Lee, Sungwoo;Lee, Jee-Hyong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.1
    • /
    • pp.7-11
    • /
    • 2013
  • Taking experts' knowledge to recommend items has shown some promising results in recommender system research. In order to improve the performance of the existing recommendation algorithms, previous researches on expert-based recommender systems have exploited the knowledge of a common expert group for all users. In this paper, we study a problem of identifying personalized experts within a user group, assuming each user needs different kinds and levels of expert help. To demonstrate this idea, we present a framework for using Support Vector Machine (SVM) to find varying expert groups for users; it is shown in an experiment that the proposed SVM approach can identify personalized experts, and that the person-alized expert-based collaborative filtering (CF) can yield better results than k-Nearest Neighbor (kNN) algorithm.

Recommender system using BERT sentiment analysis (BERT 기반 감성분석을 이용한 추천시스템)

  • Park, Ho-yeon;Kim, Kyoung-jae
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.2
    • /
    • pp.1-15
    • /
    • 2021
  • If it is difficult for us to make decisions, we ask for advice from friends or people around us. When we decide to buy products online, we read anonymous reviews and buy them. With the advent of the Data-driven era, IT technology's development is spilling out many data from individuals to objects. Companies or individuals have accumulated, processed, and analyzed such a large amount of data that they can now make decisions or execute directly using data that used to depend on experts. Nowadays, the recommender system plays a vital role in determining the user's preferences to purchase goods and uses a recommender system to induce clicks on web services (Facebook, Amazon, Netflix, Youtube). For example, Youtube's recommender system, which is used by 1 billion people worldwide every month, includes videos that users like, "like" and videos they watched. Recommended system research is deeply linked to practical business. Therefore, many researchers are interested in building better solutions. Recommender systems use the information obtained from their users to generate recommendations because the development of the provided recommender systems requires information on items that are likely to be preferred by the user. We began to trust patterns and rules derived from data rather than empirical intuition through the recommender systems. The capacity and development of data have led machine learning to develop deep learning. However, such recommender systems are not all solutions. Proceeding with the recommender systems, there should be no scarcity in all data and a sufficient amount. Also, it requires detailed information about the individual. The recommender systems work correctly when these conditions operate. The recommender systems become a complex problem for both consumers and sellers when the interaction log is insufficient. Because the seller's perspective needs to make recommendations at a personal level to the consumer and receive appropriate recommendations with reliable data from the consumer's perspective. In this paper, to improve the accuracy problem for "appropriate recommendation" to consumers, the recommender systems are proposed in combination with context-based deep learning. This research is to combine user-based data to create hybrid Recommender Systems. The hybrid approach developed is not a collaborative type of Recommender Systems, but a collaborative extension that integrates user data with deep learning. Customer review data were used for the data set. Consumers buy products in online shopping malls and then evaluate product reviews. Rating reviews are based on reviews from buyers who have already purchased, giving users confidence before purchasing the product. However, the recommendation system mainly uses scores or ratings rather than reviews to suggest items purchased by many users. In fact, consumer reviews include product opinions and user sentiment that will be spent on evaluation. By incorporating these parts into the study, this paper aims to improve the recommendation system. This study is an algorithm used when individuals have difficulty in selecting an item. Consumer reviews and record patterns made it possible to rely on recommendations appropriately. The algorithm implements a recommendation system through collaborative filtering. This study's predictive accuracy is measured by Root Mean Squared Error (RMSE) and Mean Absolute Error (MAE). Netflix is strategically using the referral system in its programs through competitions that reduce RMSE every year, making fair use of predictive accuracy. Research on hybrid recommender systems combining the NLP approach for personalization recommender systems, deep learning base, etc. has been increasing. Among NLP studies, sentiment analysis began to take shape in the mid-2000s as user review data increased. Sentiment analysis is a text classification task based on machine learning. The machine learning-based sentiment analysis has a disadvantage in that it is difficult to identify the review's information expression because it is challenging to consider the text's characteristics. In this study, we propose a deep learning recommender system that utilizes BERT's sentiment analysis by minimizing the disadvantages of machine learning. This study offers a deep learning recommender system that uses BERT's sentiment analysis by reducing the disadvantages of machine learning. The comparison model was performed through a recommender system based on Naive-CF(collaborative filtering), SVD(singular value decomposition)-CF, MF(matrix factorization)-CF, BPR-MF(Bayesian personalized ranking matrix factorization)-CF, LSTM, CNN-LSTM, GRU(Gated Recurrent Units). As a result of the experiment, the recommender system based on BERT was the best.

A Verification about the Formation Process of Filter Bubble with Personalization Algorithm (개인화 알고리즘으로 필터 버블이 형성되는 과정에 대한 검증)

  • Jun, Junyong;Hwang, Soyoun;Yoon, Youngmi
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.3
    • /
    • pp.369-381
    • /
    • 2018
  • Nowadays a personalization algorithm is gaining huge attention. It gives users selective information which is helpful and interesting in a deluge of information based on their past behavior on the internet. However there is also a fatal side effect that the user can only get restricted information on restricted topics selected by the algorithm. Basically, the personalization algorithm makes users have a narrower perspective and even stronger bias because users have less chances to get views of opponent. Eli Pariser called this problem the 'filter bubble' in his book. It is important to understand exactly what a filter bubble is to solve the problem. Therefore, this paper shows how much Google's personalized search algorithm influences search result through an experiment with deep neural networks acting like users. At the beginning of the experiment, two Google accounts are newly created, not to be influenced by the Google's personalized search algorithm. Then the two pure accounts get politically biased by two methods. We periodically calculate the numerical score depending on the character of links and it shows how biased the account is. In conclusion, this paper shows the formation process of filter bubble by a personalization algorithm through the experiment.