• Title/Summary/Keyword: Collaborative Filtering

Search Result 678, Processing Time 0.027 seconds

Cross-Product Category User Profiling for E-Commerce Personalized Recommendation (전자상거래 개인화 추천을 위한 상품 카테고리 중립적 사용자 프로파일링)

  • Park, Soo-Hwan;Lee, Hong-Joo;Cho, Nam-Jae;Kim, Jong-Woo
    • Asia pacific journal of information systems
    • /
    • v.16 no.3
    • /
    • pp.159-176
    • /
    • 2006
  • Collaborative filtering is one of the popular techniques for personalized recommendation in e-commerce. In collaborative filtering, user profiles are usually managed per product category in order to reduce data sparsity. Product diversification of Internet storefronts and multiple product category sales of e-commerce portals require cross-product category usage of user profiles in order to overcome the cold start problem of collaborative filtering. In this paper, we study the feasibility of cross-product category usage of user profiles, and suggest a method to improve recommendation performance of cross-product category user profiling. First, we investigate whether user profiles on a product category can be used to recommend products in other product categories. Furthermore, a way of utilizing user profiles selectively is suggested to increase recommendation performance of cross-product category user profiling. The feasibility of cross-product category user profiling and the usefulness of the proposed method are tested with real click stream data of an Internet storefront which sells multiple product categories including books, music CDs, and DVDs. The experiment results show that user profiles on a product category can be used to recommend products in other product categories. Also, the selective usage of user profiles based on correlations between subcategories of two product categories provides better performance than the whole usage of user profiles.

A Robust Collaborative Filtering against Manipulated Ratings (조작된 선호도에 강건한 협업적 여과 방법)

  • Kim, Heung-Nam;Ha, In-Ay;Jo, Geun-Sik
    • Journal of Internet Computing and Services
    • /
    • v.10 no.6
    • /
    • pp.81-98
    • /
    • 2009
  • Collaborative filtering, one of the most successful technologies among recommender systems, is a system assisting users in easily finding the useful information and supporting the decision making. However, despite of its success and popularity, one notable issue is incredibility of recommendations by unreliable users called shilling attacks. To deal with this problem, in this paper, we analyze the type of shilling attacks and propose a unique method of building a model for protecting the recommender system against manipulated ratings. In addition, we present a method of applying the model to collaborative filtering which is highly robust and stable to shilling attacks.

  • PDF

Transitive Similarity Evaluation Model for Improving Sparsity in Collaborative Filtering (협업필터링의 희박 행렬 문제를 위한 이행적 유사도 평가 모델)

  • Bae, Eun-Young;Yu, Seok-Jong
    • The Journal of Korean Institute of Information Technology
    • /
    • v.16 no.12
    • /
    • pp.109-114
    • /
    • 2018
  • Collaborative filtering has been widely utilized in recommender systems as typical algorithm for outstanding performance. Since it depends on item rating history structurally, The more sparse rating matrix is, the lower its recommendation accuracy is, and sometimes it is totally useless. Variety of hybrid approaches have tried to combine collaborative filtering and content-based method for improving the sparsity issue in rating matrix. In this study, a new method is suggested for the same purpose, but with different perspective, it deals with no-match situation in person-person similarity evaluation. This method is called the transitive similarity model because it is based on relation graph of people, and it compares recommendation accuracy by applying to Movielens open dataset.

Association Rule Mining and Collaborative Filtering-Based Recommendation for Improving University Graduate Attributes

  • Sheta, Osama E.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.339-345
    • /
    • 2022
  • Outcome-based education (OBE) is a tried-and-true teaching technique based on a set of predetermined goals. Program Educational Objectives (PEOs), Program Outcomes (POs), and Course Outcomes (COs) are the components of OBE. At the end of each year, the Program Outcomes are evaluated, and faculty members can submit many recommended measures which dependent on the relationship between the program outcomes and its courses outcomes to improve the quality of program and hence the overall educational program. When a vast number of courses are considered, bad actions may be proposed, resulting in unwanted and incorrect decisions. In this paper, a recommender system, using collaborative filtering and association rules algorithms, is proposed for predicting the best relationship between the program outcomes and its courses in order to improve the attributes of the graduates. First, a parallel algorithm is used for Collaborative Filtering on Data Model, which is designed to increase the efficiency of processing big data. Then, a parallel similar learning outcomes discovery method based on matrix correlation is proposed by mining association rules. As a case study, the proposed recommender system is applied to the Computer Information Systems program, College of Computer Sciences and Information Technology, Al-Baha University, Saudi Arabia for helping Program Quality Administration improving the quality of program outcomes. The obtained results revealed that the suggested recommender system provides more actions for boosting Graduate Attributes quality.

APMDI-CF: An Effective and Efficient Recommendation Algorithm for Online Users

  • Ya-Jun Leng;Zhi Wang;Dan Peng;Huan Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.11
    • /
    • pp.3050-3063
    • /
    • 2023
  • Recommendation systems provide personalized products or services to online users by mining their past preferences. Collaborative filtering is a popular recommendation technique because it is easy to implement. However, with the rapid growth of the number of users in recommendation systems, collaborative filtering suffers from serious scalability and sparsity problems. To address these problems, a novel collaborative filtering recommendation algorithm is proposed. The proposed algorithm partitions the users using affinity propagation clustering, and searches for k nearest neighbors in the partition where active user belongs, which can reduce the range of searching and improve real-time performance. When predicting the ratings of active user's unrated items, mean deviation method is used to impute values for neighbors' missing ratings, thus the sparsity can be decreased and the recommendation quality can be ensured. Experiments based on two different datasets show that the proposed algorithm is excellent both in terms of real-time performance and recommendation quality.

Robustness Analysis of a Novel Model-Based Recommendation Algorithms in Privacy Environment

  • Ihsan Gunes
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.5
    • /
    • pp.1341-1368
    • /
    • 2024
  • The concept of privacy-preserving collaborative filtering (PPCF) has been gaining significant attention. Due to the fact that model-based recommendation methods with privacy are more efficient online, privacy-preserving memory-based scheme should be avoided in favor of model-based recommendation methods with privacy. Several studies in the current literature have examined ant colony clustering algorithms that are based on non-privacy collaborative filtering schemes. Nevertheless, the literature does not contain any studies that consider privacy in the context of ant colony clustering-based CF schema. This study employed the ant colony clustering model-based PPCF scheme. Attacks like shilling or profile injection could potentially be successful against privacy-preserving model-based collaborative filtering techniques. Afterwards, the scheme's robustness was assessed by conducting a shilling attack using six different attack models. We utilize masked data-based profile injection attacks against a privacy-preserving ant colony clustering-based prediction algorithm. Subsequently, we conduct extensive experiments utilizing authentic data to assess its robustness against profile injection attacks. In addition, we evaluate the resilience of the ant colony clustering model-based PPCF against shilling attacks by comparing it to established PPCF memory and model-based prediction techniques. The empirical findings indicate that push attack models exerted a substantial influence on the predictions, whereas nuke attack models demonstrated limited efficacy.

Collaborative Filtering Method Using the Representative Attribute for Better Prediction Quality (향상된 예측을 위한 대표 속성을 이용한 협력적 여과 방법)

  • 류영석;양성봉
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10b
    • /
    • pp.33-35
    • /
    • 2000
  • 사회의 복잡화와 인터넷의 성장으로 인하여 매일 급속도로 증가하고 있는 정보들을 사용자가 모두 검토해 보고 자신의 기호에 맞는 정보들만 선택하여 사용하기는 어려운 일이다. 이를 보완하기 위해 자동화된 정보 여과 기술이 사용되는데 대표적인 방법으로 내용 기반 여과(information Filtering) 기술과 협력적 여과(Collaborative Filtering) 기술이 있다. 이 중 협력적 여과 기술은 정보의 속성을 고려하지 않는다는 단점을 가지는데 본 논문에서는 이를 보완하여 정보의 대표 속성을 중심으로 선호도 예측을 수행하는 개선된 협력적 여과 방법을 제안한다. 그리고 기존 협력적 여과 기술과 예측의 정확성에 대하여 성능 비교 실험을 수행함으로써 제안한 방법의 타당성을 제시한다.

  • PDF

Personalized Movie Recommendation System Using Context-Aware Collaborative Filtering Technique (상황기반과 협업 필터링 기법을 이용한 개인화 영화 추천 시스템)

  • Kim, Min Jeong;Park, Doo-Soon;Hong, Min;Lee, HwaMin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.289-296
    • /
    • 2015
  • The explosive growth of information has been difficult for users to get an appropriate information in time. The various ways of new services to solve problems has been provided. As customized service is being magnified, the personalized recommendation system has been important issue. Collaborative filtering system in the recommendation system is widely used, and it is the most successful process in the recommendation system. As the recommendation is based on customers' profile, there can be sparsity and cold-start problems. In this paper, we propose personalized movie recommendation system using collaborative filtering techniques and context-based techniques. The context-based technique is the recommendation method that considers user's environment in term of time, emotion and location, and it can reflect user's preferences depending on the various environments. In order to utilize the context-based technique, this paper uses the human emotion, and uses movie reviews which are effective way to identify subjective individual information. In this paper, this proposed method shows outperforming existing collaborative filtering methods.

Collaborative Filtering based Recommender System using Restricted Boltzmann Machines

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.9
    • /
    • pp.101-108
    • /
    • 2020
  • Recommender system is a must-have feature of e-commerce, since it provides customers with convenience in selecting products. Collaborative filtering is a widely-used and representative technique, where it gives recommendation lists of products preferred by other users or preferred by the current user in the past. Recently, researches on the recommendation system using deep learning artificial intelligence technologies are actively being conducted to achieve performance improvement. This study develops a collaborative filtering based recommender system using restricted Boltzmann machines of the deep learning technology by utilizing user ratings. Moreover, a learning parameter update algorithm is proposed for learning efficiency and performance. Performance evaluation of the proposed system is made through experimental analysis and comparison with conventional collaborative filtering methods. It is found that the proposed algorithm yields superior performance than the basic restricted Boltzmann machines.

Pain Nursing Intervention Supporting Method using Collaborative Filtering in Health Industry (보건산업에서 협력적 필터링을 이용한 통증 간호중재 지원 방법)

  • Yoo, Hyun;Jo, Sun-Moon;Chung, Kyung-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.7
    • /
    • pp.1-8
    • /
    • 2011
  • In modern society, the amount of information has been significantly increased according to the development of Internet and IT convergence technology and that leads to develop information obtaining and searching technologies from lots of data. Although the system integration for medicare has been largely established and that accumulates large amounts of information, there is a lack of providing and supporting information for nursing activities using such established database. In particular, the judgement for the intervention of pains depends on the experience of individual nurses and that leads to make subjective decisions in usual. In this paper, a pain nursing supporting method that uses the existing medical data and performs collaborative filtering is proposed. The proposed collaborative filtering is a method that extracts some items, which represent a high relativeness level, based on similar preferences. A preference estimation method using a user based collaborative filtering method calculates user similarities through Pearson correlation coefficients in which a neighbor selection method is used based on the user preference.