Set Based Similarity Measure for User Based Collaborative Filtering Recommendation System

2019 ◽  
pp. 453-461
Author(s):  
K. V. Uma ◽  
M. Deepika ◽  
Vairam Sujitha
Keyword(s):  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recommendation System

scholarly journals Cognitive Similarity-Based Collaborative Filtering Recommendation System

2020 ◽  
Vol 10 (12) ◽  
pp. 4183 ◽  
Author(s):  
Luong Vuong Nguyen ◽  
Min-Sung Hong ◽  
Jason J. Jung ◽  
Bong-Soo Sohn
Keyword(s):  
Performance Evaluation ◽  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recommendation System ◽  
Pearson Correlation ◽  
Cognitive Network ◽  
Data Set ◽  
New Approach ◽  
Layered Architecture ◽  
F Measure

This paper provides a new approach that improves collaborative filtering results in recommendation systems. In particular, we aim to ensure the reliability of the data set collected which is to collect the cognition about the item similarity from the users. Hence, in this work, we collect the cognitive similarity of the user about similar movies. Besides, we introduce a three-layered architecture that consists of the network between the items (item layer), the network between the cognitive similarity of users (cognition layer) and the network between users occurring in their cognitive similarity (user layer). For instance, the similarity in the cognitive network can be extracted from a similarity measure on the item network. In order to evaluate our method, we conducted experiments in the movie domain. In addition, for better performance evaluation, we use the F-measure that is a combination of two criteria P r e c i s i o n and R e c a l l . Compared with the Pearson Correlation, our method more accurate and achieves improvement over the baseline 11.1% in the best case. The result shows that our method achieved consistent improvement of 1.8% to 3.2% for various neighborhood sizes in MAE calculation, and from 2.0% to 4.1% in RMSE calculation. This indicates that our method improves recommendation performance.

An Enhanced Similarity Measure Used in Personalized Recommendation Algorithms

2010 ◽  
Vol 159 ◽  
pp. 671-675 ◽  
Author(s):  
Song Jie Gong
Keyword(s):  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recommendation System ◽  
Pearson Correlation ◽  
Recommendation Systems ◽  
Personalized Recommendation ◽  
Rating Data ◽  
Measure Methods ◽  
Collaborative Filtering Algorithm

Personalized recommendation systems combine the data mining technology with users browse profile and provide recommendation set to user forecasted by their interests. Collaborative filtering algorithm is one of the most successful methods for building personalized recommendation system, and is extensively used in many fields to date. With the development of E-commerce, the magnitudes of users and items grow rapidly, resulting in the extreme sparsity of user rating data. Traditional similarity measure methods work poor in this situation, make the quality of recommendation system decreased dramatically. To alleviate the problem, an enhanced Pearson correlation similarity measure method is introduced in the personalized collaborative filtering recommendation algorithm. The approach considers the common correlation rating of users. The recommendation using the enhanced similarity measure can improve the neighbors influence in the course of recommendation and enhance the accuracy and the quality of recommendation systems effectively.

Identifying Attack Models for Securing Cluster-Based Recommendation System

2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Recommendation System ◽  
Relevant Information ◽  
System Function ◽  
Recommendation Algorithm ◽  
Underlying Network ◽  
Entire Dataset ◽  
Attack Models ◽  
Wide Usage

: The immense growth of information has led to the wide usage of recommender systems for retrieving relevant information. One of the widely used methods for recommendation is collaborative filtering. However, such methods suffer from two problems, scalability and sparsity. In the proposed research, the two issues of collaborative filtering are addressed and a cluster-based recommender system is proposed. For the identification of potential clusters from the underlying network, Shapley value concept is used, which divides users into different clusters. After that, the recommendation algorithm is performed in every respective cluster. The proposed system recommends an item to a specific user based on the ratings of the item’s different attributes. Thus, it reduces the running time of the overall algorithm, since it avoids the overhead of computation involved when the algorithm is executed over the entire dataset. Besides, the security of the recommender system is one of the major concerns nowadays. Attackers can come in the form of ordinary users and introduce bias in the system to force the system function that is advantageous for them. In this paper, we identify different attack models that could hamper the security of the proposed cluster-based recommender system. The efficiency of the proposed research is validated by conducting experiments on student dataset.

scholarly journals Extrapolative Collaborative Filtering Recommendation System with Word2Vec for Purchased Product for SMEs

2021 ◽  
Vol 13 (13) ◽  
pp. 7156
Author(s):  
Kyoung Jun Lee ◽  
Yu Jeong Hwangbo ◽  
Baek Jeong ◽  
Ji Woong Yoo ◽  
Kyung Yang Park
Keyword(s):  
Collaborative Filtering ◽  
High Performance ◽  
Recommendation System ◽  
Small And Medium Enterprises ◽  
Personal Information ◽  
Business Environment ◽  
Share Data ◽  
Artificial Intelligence Technology ◽  
Medium Enterprises ◽  
Start Ups

Many small and medium enterprises (SMEs) want to introduce recommendation services to boost sales, but they need to have sufficient amounts of data to introduce these recommendation services. This study proposes an extrapolative collaborative filtering (ECF) system that does not directly share data among SMEs but improves recommendation performance for small and medium-sized companies that lack data through the extrapolation of data, which can provide a magical experience to users. Previously, recommendations were made utilizing only data generated by the merchant itself, so it was impossible to recommend goods to new users. However, our ECF system provides appropriate recommendations to new users as well as existing users based on privacy-preserved payment transaction data. To accomplish this, PP2Vec using Word2Vec was developed by utilizing purchase information only, excluding personal information from payment company data. We then compared the performances of single-merchant models and multi-merchant models. For the merchants with more data than SMEs, the performance of the single-merchant model was higher, while for the SME merchants with fewer data, the multi-merchant model’s performance was higher. The ECF System proposed in this study is more suitable for the real-world business environment because it does not directly share data among companies. Our study shows that AI (artificial intelligence) technology can contribute to the sustainability and viability of economic systems by providing high-performance recommendation capability, especially for small and medium-sized enterprises and start-ups.

scholarly journals User profile correlation-based similarity (UPCSim) algorithm in movie recommendation system

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Triyanna Widiyaningtyas ◽  
Indriana Hidayah ◽  
Teguh B. Adji
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
User Behavior ◽  
Correlation Coefficients ◽  
User Profile ◽  
Profile Data ◽  
Similarity Algorithm ◽  
Previous Algorithm ◽  
Movie Recommendation ◽  
Recommendation Accuracy

AbstractCollaborative filtering is one of the most widely used recommendation system approaches. One issue in collaborative filtering is how to use a similarity algorithm to increase the accuracy of the recommendation system. Most recently, a similarity algorithm that combines the user rating value and the user behavior value has been proposed. The user behavior value is obtained from the user score probability in assessing the genre data. The problem with the algorithm is it only considers genre data for capturing user behavior value. Therefore, this study proposes a new similarity algorithm – so-called User Profile Correlation-based Similarity (UPCSim) – that examines the genre data and the user profile data, namely age, gender, occupation, and location. All the user profile data are used to find the weights of the similarities of user rating value and user behavior value. The weights of both similarities are obtained by calculating the correlation coefficients between the user profile data and the user rating or behavior values. An experiment shows that the UPCSim algorithm outperforms the previous algorithm on recommendation accuracy, reducing MAE by 1.64% and RMSE by 1.4%.

User opinions driven social recommendation system

2021 ◽  
Vol 25 (1) ◽  
pp. 21-31
Author(s):  
Lakshmikanth Paleti ◽  
P. Radha Krishna ◽  
J.V.R. Murthy
Keyword(s):  
Social Networks ◽  
Collaborative Filtering ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Social Recommendation ◽  
Novel Approach ◽  
Tripartite Graphs ◽  
Content Based Filtering

Recommendation systems provide reliable and relevant recommendations to users and also enable users’ trust on the website. This is achieved by the opinions derived from reviews, feedbacks and preferences provided by the users when the product is purchased or viewed through social networks. This integrates interactions of social networks with recommendation systems which results in the behavior of users and user’s friends. The techniques used so far for recommendation systems are traditional, based on collaborative filtering and content based filtering. This paper provides a novel approach called User-Opinion-Rating (UOR) for building recommendation systems by taking user generated opinions over social networks as a dimension. Two tripartite graphs namely User-Item-Rating and User-Item-Opinion are constructed based on users’ opinion on items along with their ratings. Proposed approach quantifies the opinions of users and results obtained reveal the feasibility.

ASSIST IN COOKING: ACTION SUPPORT SYSTEM FOR INTERACTIVE SELF-TRAINING

2008 ◽  
Vol 02 (02) ◽  
pp. 207-233
Author(s):  
SATORU MEGA ◽  
YOUNES FADIL ◽  
ARATA HORIE ◽  
KUNIAKI UEHARA
Keyword(s):  
Human Computer Interaction ◽  
Collaborative Filtering ◽  
Similarity Measure ◽  
Support System ◽  
Mixed Reality ◽  
Flexible Learning ◽  
Virtual Objects ◽  
Cooking Process ◽  
Real Objects ◽  
Transition Models

Human-computer interaction systems have been developed in recent years. These systems use multimedia techniques to create Mixed-Reality environments where users can train themselves. Although most of these systems rely strongly on interactivity with the users, taking into account users' states, they still lack the possibility of considering users preferences when they help them. In this paper, we introduce an Action Support System for Interactive Self-Training (ASSIST) in cooking. ASSIST focuses on recognizing users' cooking actions as well as real objects related to these actions to be able to provide them with accurate and useful assistance. Before the recognition and instruction processes, it takes users' cooking preferences and suggests one or more recipes that are likely to satisfy their preferences by collaborative filtering. When the cooking process starts, ASSIST recognizes users' hands movement using a similarity measure algorithm called AMSS. When the recognized cooking action is correct, ASSIST instructs the user on the next cooking procedure through virtual objects. When a cooking action is incorrect, the cause of its failure is analyzed and ASSIST provides the user with support information according to the cause to improve the user's incorrect cooking action. Furthermore, we construct parallel transition models from cooking recipes for more flexible instructions. This enables users to perform necessary cooking actions in any order they want, allowing more flexible learning.

Sign in / Sign up

Export Citation Format

Share Document