scholarly journals Performa Algoritma User K-Nearest Neighbors pada Sistem Rekomendasi di Tokopedia

2020 ◽  
Vol 5 (3) ◽  
pp. 302
Author(s):  
Rama Dian Syah
Keyword(s):  
Recommendation System ◽  
Mean Absolute Error ◽  
Prediction Method ◽  
Large Data ◽  
Nearest Neighbors ◽  
Absolute Error ◽  
K Nearest Neighbors ◽  
Algorithm Performance ◽  
Specific Product ◽  
Rating Prediction

The biggest marketplace in Indonesia such as Tokopedia has data on e-commerce activities that always increase with time. Large data growth in Marketplace can cause problems for users. Buyers who have difficulty in finding the best product that suits their needs and sellers who have difficulty in promoting products that are often visited by buyers can be overcome. The recommendation system can overcome these problems by providing specific product recommendations to be promoted and offered to buyers. This research implements the Recommendation System using the Item Rating Prediction Method by applying the User K-Nearest Neighbors Algorithm. The Recommendation System provides recommendations based on ratings on products given by the buyer. Algorithm performance in Recommendation System is measured by the parameters of Root Mean Square Error (RMSE), Mean Absolute Error (MAE) and Normalized Mean Absolute Error (NMAE). The performance values obtained are RMSE = 0.713, MAE = 0.488 and NMAE = 0.122. Perfomance values below 1 proves that the User K-Nearest Neighbors Algorithm is suitable as a rating prediction model on recommendation system.

scholarly journals Hybrid model for movie recommendation system using content K-nearest neighbors and restricted Boltzmann machine

2021 ◽  
Vol 23 (1) ◽  
pp. 445
Author(s):  
Dayal Kumar Behera ◽  
Madhabananda Das ◽  
Subhra Swetanisha ◽  
Prabira Kumar Sethy
Keyword(s):  
Collaborative Filtering ◽  
Hybrid Model ◽  
Recommendation System ◽  
Nearest Neighbors ◽  
Restricted Boltzmann Machine ◽  
Boltzmann Machine ◽  
K Nearest Neighbors ◽  
Benchmark Datasets ◽  
Data Content ◽  
Rating Prediction

<span>One of the most commonly used techniques in the recommendation framework is collaborative filtering (CF). It performs better with sufficient records of user rating but is not good in sparse data. Content-based filtering works well in the sparse dataset as it finds the similarity between movies by using attributes of the movies. RBM is an energy-based model serving as a backbone of deep learning and performs well in rating prediction. However, the rating prediction is not preferable by a single model. The hybrid model achieves better results by integrating the results of more than one model. This paper analyses the weighted hybrid CF system by integrating content K-nearest neighbors (KNN) with restricted Boltzmann machine (RBM). Movies are recommended to the active user in the proposed system by integrating the effects of both content-based and collaborative filtering. Model efficacy was tested with MovieLens benchmark datasets.</span>

scholarly journals Discretization Based Framework to Improve the Recommendation Quality

2021 ◽  
Vol 18 (3) ◽  
Author(s):  
Bilal Ahmed ◽  
Wang Li
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Information Filtering ◽  
Nearest Neighbors ◽  
User Preferences ◽  
Primary Concern ◽  
K Nearest Neighbors ◽  
Chi Square ◽  
Similarity Computation ◽  
Rating Prediction

Recommendation systems are information filtering software that delivers suggestions about relevant stuff from a massive collection of data. Collaborative filtering approaches are the most popular in recommendations. The primary concern of any recommender system is to provide favorable recommendations based on the rating prediction of user preferences. In this article, we propose a novel discretization based framework for collaborative filtering to improve rating prediction. Our framework includes discretization-based preprocessing, chi-square based attribution selection, and K-Nearest Neighbors (KNN) based similarity computation. Rating prediction affords some basis for the judgment to decide whether recommendations are generated or not, subject to the ratio of performance of any recommendation system. Experiments on two datasets MovieLens and BookCrossing, demonstrate the effectiveness of our method.

A New Contextual Influencer User Measure to Improve the Accuracy of Recommender System

2018 ◽  
Vol 9 (4) ◽  
pp. 38-51
Author(s):  
Maryam Jallouli ◽  
Sonia Lajmi ◽  
Ikram Amous
Keyword(s):  
Social Network ◽  
Recommender System ◽  
Recommendation System ◽  
Mean Absolute Error ◽  
Absolute Error ◽  
User Model ◽  
Context Aware ◽  
Additional Information ◽  
Context Element ◽  
Cold Start Problem

In the last decade, social-based recommender systems have become the best way to resolve a user's cold start problem. In fact, it enriches the user's model by adding additional information provided from his social network. Most of those approaches are based on a collaborative filtering and compute similarities between the users. The authors' preliminary objective in this work is to propose an innovative context aware metric between users (called contextual influencer user). These new similarities are called C-COS, C-PCC and C-MSD, where C refers to the category. The contextual influencer user model is integrated into a social based recommendation system. The category of the items is considered as the most pertinent context element. The authors' proposal is implemented and tested within the food dataset. The experimentation proved that the contextual influencer user measure achieves 0.873, 0.874, and 0.882 in terms of Mean Absolute Error (MAE) corresponding to C-cos, C-pcc and C-msd, respectively. The experimental results showed that their model outperforms several existing methods.

scholarly journals An AI-Based Exercise Prescription Recommendation System

2021 ◽  
Vol 11 (6) ◽  
pp. 2661
Author(s):  
Hung-Kai Chen ◽  
Fueng-Ho Chen ◽  
Shien-Fong Lin
Keyword(s):  
Recommendation System ◽  
Exercise Prescription ◽  
Rest Heart Rate ◽  
Mean Absolute Error ◽  
Absolute Error ◽  
Exercise Mode ◽  
Preventive Cardiology ◽  
Community Data ◽  
Testing Accuracy ◽  
Digital Training

The European Association of Preventive Cardiology Exercise Prescription in Everyday Practice and Rehabilitative Training (EXPERT) tool has been developed for digital training and decision support in cardiovascular disease patients in clinical practice. Exercise prescription recommendation systems for sub-healthy people are essential to enhance this dominant group’s physical ability as well. This study aims to construct a guided exercise prescription system for sub-healthy groups using exercise community data to train an AI model. The system consists of six modules, including three-month suggested exercise mode (3m-SEM), predicted value of rest heart rate (rest HR) difference after following three-month suggested exercise mode (3m-PV), two-month suggested exercise mode (2m-SEM), predicted value of rest HR difference after following two-month suggested exercise mode (2m-PV), one-month suggested exercise mode (1m-SEM) and predicted value of rest HR difference after following one-month suggested exercise mode (1m-PV). A new user inputs gender, height, weight, age, and current rest HR value, and the above six modules will provide the user with a prescription. A four-layer neural network model is applied to construct the above six modules. The AI-enabled model produced 95.80%, 100.00%, and 95.00% testing accuracy in 1m-SEM, 2m-SEM, and 3m-SEM, respectively. It reached 3.15, 2.89, and 2.75 BPM testing mean absolute error in 1m-PV, 2m-PV, and 3m-PV. The developed system provides quantitative exercise prescriptions to guide the sub-healthy group to engage in effective exercise programs.

scholarly journals Location Based Agricultural Product Recommendation System Using Novel KNN Algorithm

2019 ◽  
pp. 945-950
Author(s):  
Sachin J ◽  
Geethatharani P ◽  
Surya M K ◽  
Kavin K V
Keyword(s):  
Euclidean Distance ◽  
Recommendation System ◽  
Mean Absolute Error ◽  
Market Price ◽  
Absolute Error ◽  
Agricultural Products ◽  
Agricultural Product ◽  
Product Recommendation ◽  
Use Of Data ◽  
Great Circle Distance

It is evident that the need for personalized product recommendation is much needed these days. Generally, product recommender systems are implemented in web servers that make use of data, implicitly obtained as results of the collection of Web browsing patterns of the users. Here, the project's motive is to provide location-based agricultural product recommendation system using a novel KNN algorithm by ensuring effective communication and transparency in agriculture trade marketing among buyers and sellers (farmers). It helps the farmer to fix up the market price by preventing the rue pricing of their products. The farmer can post their products into the application with price and other details like a timestamp of harvesting, color, size, the absence of pest, freshness, ripeness etc. Based on the location, the distance between the seller and buyer is calculated using great circle distance. An improved Novel KNN algorithm is used to find the K Nearest Seller by calculating the distance between the sellers and buyer using a Euclidean distance metric. The details posted by the farmers and buyers are stored and updated in a database dynamically. The recommender system recommends nearest sellers and their agricultural products based on buyer interest. The performance of the system is analyzed in terms of accuracy and mean absolute error.

scholarly journals A Recommendation System & Their Performance Metrics using several ML Algorithms

2020 ◽  
Vol 9 (3) ◽  
pp. 2445-2451
Keyword(s):  
Support Vector Machine ◽  
Logistic Regression ◽  
Search Engine ◽  
Recommendation System ◽  
Performance Metrics ◽  
Nearest Neighbors ◽  
Support Vector ◽  
K Nearest Neighbors ◽  
Data Set ◽  
Google Search

Recommendation systems are subdivision of Refine Data that request to anticipate ranking or liking a user would give to an item. Recommended systems produce user customized exhortations for product or service. Recommended systems are used in different services like Google Search Engine, YouTube, Gmail and also Product recommendation service on any E-Commerce website. These systems usually depends on content based approach. in this paper, we develop these type recommended systems by using several algorithms like K-Nearest neighbors(KNN), Support-Vector Machine(SVM), Logistic Regression(LR), MultinomialNB(MNB),and Multi-layer Perception(MLP). These will predict nearest categories from the News Category Data, among these categories we will recommend the most common sentence to a user and we analyze the performance metrics. This approach is tested on News Category Data set. This data set having more or less 200k Headlines of News and 41 classes, collected from the Huff post from the year of 2012-2018.

Hybrid Model for Movie Recommendation System Using Fireflies and Fuzzy C-Means

2019 ◽  
Vol 11 (2) ◽  
pp. 1-13
Author(s):  
M. Sandeep Kumar ◽  
Prabhu J.
Keyword(s):  
Hybrid Model ◽  
Recommender System ◽  
Firefly Algorithm ◽  
Recommendation System ◽  
Mean Absolute Error ◽  
Research Work ◽  
Absolute Error ◽  
Experimental Result ◽  
Fuzzy C Means ◽  
Fcm Clustering

In the era of Big Data, extremely complicated data is delivered from the system, of which it is impossible to collect the correct information with an online platform. In this research work, it provides a hybrid model for a movie-based recommender system; based on meta-heuristic firefly algorithm and fuzzy c-means (FCM) clustering technique to evaluate rating of a movie for a specific user based on the similarity of users and historical data. The firefly algorithm was employed in the movie lens dataset to get the initial cluster and also to initialize the position of clusters. FCM is used to classify the similarity of the user ratings. The proposed collaborative recommender system performed well regarding accuracy and precision. Various metrics are used in a movie lens dataset like mean absolute error (MAE), precision, and recall. The experimental result delivered by the system provides more efficient performance compared to the existing system in term of mean absolute error (MAE).

scholarly journals COVID-19 Prediction Applying Supervised Machine Learning Algorithms with Comparative Analysis Using WEKA

Algorithms ◽  
2021 ◽  
Vol 14 (7) ◽  
pp. 201
Author(s):  
Charlyn Nayve Villavicencio ◽  
Julio Jerison Escudero Macrohon ◽  
Xavier Alphonse Inbaraj ◽  
Jyh-Horng Jeng ◽  
Jer-Guang Hsieh
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Mean Absolute Error ◽  
Learning Algorithms ◽  
Absolute Error ◽  
Machine Learning Algorithms ◽  
Supervised Machine Learning ◽  
Support Vector ◽  
K Nearest Neighbors ◽  
Use Of Technology

Early diagnosis is crucial to prevent the development of a disease that may cause danger to human lives. COVID-19, which is a contagious disease that has mutated into several variants, has become a global pandemic that demands to be diagnosed as soon as possible. With the use of technology, available information concerning COVID-19 increases each day, and extracting useful information from massive data can be done through data mining. In this study, authors utilized several supervised machine learning algorithms in building a model to analyze and predict the presence of COVID-19 using the COVID-19 Symptoms and Presence dataset from Kaggle. J48 Decision Tree, Random Forest, Support Vector Machine, K-Nearest Neighbors and Naïve Bayes algorithms were applied through WEKA machine learning software. Each model’s performance was evaluated using 10-fold cross validation and compared according to major accuracy measures, correctly or incorrectly classified instances, kappa, mean absolute error, and time taken to build the model. The results show that Support Vector Machine using Pearson VII universal kernel outweighs other algorithms by attaining 98.81% accuracy and a mean absolute error of 0.012.

scholarly journals A new affinity matrix weighted k-nearest neighbors graph to improve spectral clustering accuracy

2021 ◽  
Vol 7 ◽  
pp. e692
Author(s):  
Muhammad Jamal Ahmed ◽  
Faisal Saeed ◽  
Anand Paul ◽  
Sadeeq Jan ◽  
Hyuncheol Seo
Keyword(s):  
Spectral Clustering ◽  
Large Data ◽  
Nearest Neighbors ◽  
Data Sets ◽  
Affinity Matrix ◽  
Clustering Methods ◽  
K Nearest Neighbors ◽  
Learning Techniques ◽  
Interesting Task ◽  
Similarity Graph

Researchers have thought about clustering approaches that incorporate traditional clustering methods and deep learning techniques. These approaches normally boost the performance of clustering. Getting knowledge from large data-sets is quite an interesting task. In this case, we use some dimensionality reduction and clustering techniques. Spectral clustering is gaining popularity recently because of its performance. Lately, numerous techniques have been introduced to boost spectral clustering performance. One of the most significant part of these techniques is to construct a similarity graph. We introduced weighted k-nearest neighbors technique for the construction of similarity graph. Using this new metric for the construction of affinity matrix, we achieved good results as we tested it both on real and artificial data-sets.

Sign in / Sign up

Export Citation Format

Share Document