An Effective Algorithm in a Recommender System Based on a Combination of Imperialist Competitive and Firey Algorithms

نویسندگان

چکیده مقاله:

With the rapid expansion of the information on the Internet, recommender systems play an important role in terms of trade and research. Recommender systems try to guess the user's way of thinking, using the in-formation of user's behavior or similar users and their views, to discover and then propose a product which is the most appropriate and closest product of user's interest. In the past decades, many studies have been done in the field of recommender systems, most of which have focused on designing new recommender algorithms based on computational intelligence algorithms. The success of a recommender system besides the quality of the algorithm depends on other factors such as: Sparsity, Cold start and Scalability in the performance of a recommender system, which can affect the quality of the recommendation. Consequently, the main motivation for this research is to providing an effective meta heuristic algorithm based on a combination of imperialist competitive and firefly algorithms using clustering technique. The simulation results of the proposed algorithm on real data sets Move Lens and Film Trust have shown better forecast accuracy in the item recommendation to users than other algorithms presented in subject literature. Also the proposed algorithm can choose appropriate items among the wide range of data and give it to output in a reasonable time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

an effective algorithm in a recommender system based on a combination of imperialist competitive and firey algorithms

with the rapid expansion of the information on the internet, recommender systems play an important role in terms of trade and research. recommender systems try to guess the user's way of thinking, using the in-formation of user's behavior or similar users and their views, to discover and then propose a product which is the most appropriate and closest product of user's interest. ...

متن کامل

An Improved Imperialist Competitive Algorithm based on a new assimilation strategy

Meta-heuristic algorithms inspired by the natural processes are part of the optimization algorithms that they have been considered in recent years, such as genetic algorithm, particle swarm optimization, ant colony optimization, Firefly algorithm. Recently, a new kind of evolutionary algorithm has been proposed that it is inspired by the human sociopolitical evolution process. This new algorith...

متن کامل

Scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...

متن کامل

MOEICA: Enhanced multi-objective optimization based on imperialist competitive algorithm

In this paper, a multi-objective enhanced imperialist competitive algorithm (MOEICA) is presented. The main structures of the original ICA are employed while some novel approaches are also developed. Other than the non-dominated sorting and crowding distance methods which are used as the main tools for comparing and ranking solutions, an auxiliary comparison approach called fuzzy possession is ...

متن کامل

A Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

متن کامل

An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 2  شماره 1

صفحات  1- 21

تاریخ انتشار 2017-05-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023