Learn R Programming

GACFF (version 1.0)

Genetic Similarity in User-Based Collaborative Filtering

Description

The genetic algorithm can be used directly to find the similarity of users and more effectively to increase the efficiency of the collaborative filtering method. By identifying the nearest neighbors to the active user, before the genetic algorithm, and by identifying suitable starting points, an effective method for user-based collaborative filtering method has been developed. This package uses an optimization algorithm (continuous genetic algorithm) to directly find the optimal similarities between active users (users for whom current recommendations are made) and others. First, by determining the nearest neighbor and their number, the number of genes in a chromosome is determined. Each gene represents the neighbor's similarity to the active user. By estimating the starting points of the genetic algorithm, it quickly converges to the optimal solutions. The positive point is the independence of the genetic algorithm on the number of data that for big data is an effective help in solving the problem.

Copy Link

Version

Install

install.packages('GACFF')

Monthly Downloads

190

Version

1.0

License

GPL (>= 2)

Maintainer

Farimah Houshmand

Last Published

December 20th, 2019

Functions in GACFF (1.0)

NewKNN

Nearest Neighbors.
GACFF-package

GACFF
Genetic

The genetic algorithm for finding similarities between users.
Similarity_Pearson

Similarity between users in Pearson method.
Results

Results of all active users.
meanR.Results

Average of results for all active users.
plotResults

Methods for Results objects.
ItemSelect

A set of Items id for recommending to an active user.
Pearson

Pearson method
Prediction

prediction function