• Title/Summary/Keyword: Recommendation systems

Search Result 832, Processing Time 0.027 seconds

Toward Trustworthy Social Network Services: A Robust Design of Recommender Systems

  • Noh, Giseop;Oh, Hayoung;Lee, Kyu-haeng;Kim, Chong-kwon
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.145-156
    • /
    • 2015
  • In recent years, electronic commerce and online social networks (OSNs) have experienced fast growth, and as a result, recommendation systems (RSs) have become extremely common. Accuracy and robustness are important performance indexes that characterize customized information or suggestions provided by RSs. However, nefarious users may be present, and they can distort information within the RSs by creating fake identities (Sybils). Although prior research has attempted to mitigate the negative impact of Sybils, the presence of these fake identities remains an unsolved problem. In this paper, we introduce a new weighted link analysis and influence level for RSs resistant to Sybil attacks. Our approach is validated through simulations of a broad range of attacks, and it is found to outperform other state-of-the-art recommendation methods in terms of both accuracy and robustness.

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.

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.

Development of Hybrid Recommender System Using Review Data Mining: Kindle Store Data Analysis Case (리뷰 데이터 마이닝을 이용한 하이브리드 추천시스템 개발: Amazon Kindle Store 데이터 분석사례)

  • Yihua Zhang;Qinglong Li;Ilyoung Choi;Jaekyeong Kim
    • Information Systems Review
    • /
    • v.23 no.1
    • /
    • pp.155-172
    • /
    • 2021
  • With the recent increase in online product purchases, a recommender system that recommends products considering users' preferences has still been studied. The recommender system provides personalized product recommendation services to users. Collaborative Filtering (CF) using user ratings on products is one of the most widely used recommendation algorithms. During CF, the item-based method identifies the user's product by using ratings left on the product purchased by the user and obtains the similarity between the purchased product and the unpurchased product. CF takes a lot of time to calculate the similarity between products. In particular, it takes more time when using text-based big data such as review data of Amazon store. This paper suggests a hybrid recommendation system using a 2-phase methodology and text data mining to calculate the similarity between products easily and quickly. To this end, we collected about 980,000 online consumer ratings and review data from the online commerce store, Amazon Kinder Store. As a result of several experiments, it was confirmed that the suggested hybrid recommendation system reflecting the user's rating and review data has resulted in similar recommendation time, but higher accuracy compared to the CF-based benchmark recommender systems. Therefore, the suggested system is expected to increase the user's satisfaction and increase its sales.

Recommendation System Based on Correlation Analysis of User Behavior Data in Online Shopping Mall Environment (온라인 쇼핑몰 환경에서 사용자 행동 데이터의 상관관계 분석 기반 추천 시스템)

  • Yo Han Park;Jong Hyeok Mun;Jong Sun Choi;Jae Young Choi
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.13 no.1
    • /
    • pp.10-20
    • /
    • 2024
  • As the online commerce market continues to expand with an increase of diverse products and content, users find it challenging in navigating and in the selection process. Thereafter both platforms and shopping malls are actively working in conducting continuous research on recommendations system to select and present products that align with user preferences. Most existing recommendation studies have relied on user data which is relatively easy to obtain. However, these studies only use a single type of event and their reliance on time dependent data results in issues with reliability and complexity. To address these challenges, this paper proposes a recommendation system that analysis user preferences in consideration of the relationship between various types of event data. The proposed recommendation system analyzes the correlation of multiple events, extracts weights, learns the recommendation model, and provides recommendation services through it. Through extensive experiments the performance of our system was compared with the previously studied algorithms. The results confirmed an improvement in both complexity and performance.

Conditional Generative Adversarial Network based Collaborative Filtering Recommendation System (Conditional Generative Adversarial Network(CGAN) 기반 협업 필터링 추천 시스템)

  • Kang, Soyi;Shin, Kyung-shik
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.3
    • /
    • pp.157-173
    • /
    • 2021
  • With the development of information technology, the amount of available information increases daily. However, having access to so much information makes it difficult for users to easily find the information they seek. Users want a visualized system that reduces information retrieval and learning time, saving them from personally reading and judging all available information. As a result, recommendation systems are an increasingly important technologies that are essential to the business. Collaborative filtering is used in various fields with excellent performance because recommendations are made based on similar user interests and preferences. However, limitations do exist. Sparsity occurs when user-item preference information is insufficient, and is the main limitation of collaborative filtering. The evaluation value of the user item matrix may be distorted by the data depending on the popularity of the product, or there may be new users who have not yet evaluated the value. The lack of historical data to identify consumer preferences is referred to as data sparsity, and various methods have been studied to address these problems. However, most attempts to solve the sparsity problem are not optimal because they can only be applied when additional data such as users' personal information, social networks, or characteristics of items are included. Another problem is that real-world score data are mostly biased to high scores, resulting in severe imbalances. One cause of this imbalance distribution is the purchasing bias, in which only users with high product ratings purchase products, so those with low ratings are less likely to purchase products and thus do not leave negative product reviews. Due to these characteristics, unlike most users' actual preferences, reviews by users who purchase products are more likely to be positive. Therefore, the actual rating data is over-learned in many classes with high incidence due to its biased characteristics, distorting the market. Applying collaborative filtering to these imbalanced data leads to poor recommendation performance due to excessive learning of biased classes. Traditional oversampling techniques to address this problem are likely to cause overfitting because they repeat the same data, which acts as noise in learning, reducing recommendation performance. In addition, pre-processing methods for most existing data imbalance problems are designed and used for binary classes. Binary class imbalance techniques are difficult to apply to multi-class problems because they cannot model multi-class problems, such as objects at cross-class boundaries or objects overlapping multiple classes. To solve this problem, research has been conducted to convert and apply multi-class problems to binary class problems. However, simplification of multi-class problems can cause potential classification errors when combined with the results of classifiers learned from other sub-problems, resulting in loss of important information about relationships beyond the selected items. Therefore, it is necessary to develop more effective methods to address multi-class imbalance problems. We propose a collaborative filtering model using CGAN to generate realistic virtual data to populate the empty user-item matrix. Conditional vector y identify distributions for minority classes and generate data reflecting their characteristics. Collaborative filtering then maximizes the performance of the recommendation system via hyperparameter tuning. This process should improve the accuracy of the model by addressing the sparsity problem of collaborative filtering implementations while mitigating data imbalances arising from real data. Our model has superior recommendation performance over existing oversampling techniques and existing real-world data with data sparsity. SMOTE, Borderline SMOTE, SVM-SMOTE, ADASYN, and GAN were used as comparative models and we demonstrate the highest prediction accuracy on the RMSE and MAE evaluation scales. Through this study, oversampling based on deep learning will be able to further refine the performance of recommendation systems using actual data and be used to build business recommendation systems.

Integration of Heterogeneous Models with Knowledge Consolidation

  • Kim, Jin-Hwa;Bae, Jae-Kwon
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.571-575
    • /
    • 2007
  • For better predictions and classifications in customer recommendation, this study proposes an integrative model that efficiently combines the currently-in-use statistical and artificial intelligence models. In particular, by integrating the models such as Association Rule, Connection Frequency Matrix, and Rule Induction, this study suggests an integrative prediction model.

  • PDF

Collaborative Filtering in Recommendation Systems: Idea and Evaluation (추천 시스템의 협업 필터링: 아이디어와 평가)

  • Kim, Joosung (James)
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.10a
    • /
    • pp.716-719
    • /
    • 2019
  • Collaborative filtering has been used frequently as a recommendation system. To reduce the errors on predicting the ratings that may be given by the user, we propose a new aggregation method to do so. We used a real-world dataset MovieLens to compare our proposed method from previously existing methods, and accordingly to the results, ours was more accurate.

Personalized Mentor/Mentee Recommendation Algorithms for Matching in e-Mentoring Systems (e-멘토링 시스템에서 매칭을 위한 개인선호도기반 멘토/멘티 추천 알고리즘)

  • Jin, Heui-Lan;Park, Chan-Jung
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.1
    • /
    • pp.11-21
    • /
    • 2008
  • In advance of Knowledge Information Society, mentoring is becoming an efficient method for developing and managing human resources. There are several factors to improve the effect of mentoring. Among them, a matching mechanism that connects a mentee and a mentor is the most important in mentoring. In the existing e-mentoring systems, administrators rarely consider personal data. They match suitable mentors for mentees in a mandatory way, which reflects bad effects in the e-mentoring. In this paper, we propose new recommendation algorithms for matching by analyzing personal preferences for secondary school students to improve the effects of the mentoring. In addition, we compare our algorithms with the existing algorithms in terms of elaborateness, accordance, and diversity in order to prove the effectiveness of the proposed algorithms.

  • PDF