Behzad Soleimani Neysiani

Work place: Faculty of Electrical & Computer Engineering, University of Kashan, Kashan, Isfahan, Iran

E-mail: b.soleimani@grad.kashanu.ac.ir

Website:

Research Interests: Software Creation and Management, Software Engineering, Computer systems and computational processes, Data Mining, Data Structures and Algorithms

Biography

Behzad Soleimani Neysiani is a lecturer at Islamic Azad University (Isfahan Branch). He received the B.Sc. and M.Sc. degrees in Computer Engineering from Islamic Azad University (Najaf Abad Branch), in 2008 and 2013 respectively. He’s a PhD Candidate in University of Kashan now. His research interests include Distributed Computing especially Clouds and P2P systems, Software engineering especially software testing, Database Management, Knowledge Discovery and Data mining and Machine learning and published many papers in these fields. Now he’s working on Text Mining for his PhD dissertation.

Author Articles
Improving Performance of Association Rule-Based Collaborative Filtering Recommendation Systems using Genetic Algorithm

By Behzad Soleimani Neysiani Nasim Soltani Reza Mofidi Mohammad Hossein Nadimi-Shahraki

DOI: https://doi.org/10.5815/ijitcs.2019.02.06, Pub. Date: 8 Feb. 2019

Recommender systems that possess adequate information about users and analyze their information, are capable of offering appropriate items to customers. Collaborative filtering method is one of the popular recommender system approaches that produces the best suggestions by identifying similar users or items based on their previous transactions. The low accuracy of suggestions is one of the major concerns in the collaborative filtering method. Several methods have been introduced to enhance the accuracy of this method through the discovering association rules and using evolutionary algorithms such as particle swarm optimization. However, their runtime performance does not satisfy this need, thus this article proposes an efficient method of producing cred associations rules with higher performances based on a genetic algorithm. Evaluations were performed on the data set of MovieLens. The parameters of the assessment are: run time, the average of quality rules, recall, precision, accuracy and F1-measurement. The experimental evaluation of a system based on our algorithm outperforms show than the performance of the multi-objective particle swarm optimization association rule mining algorithm, finally runtime has dropped by around 10%.

[...] Read more.
Other Articles