The Efficiency of a DoParallel Algorithm and an FCA Network Graph Applied to Recommendation System
Open Access
- 23 April 2020
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 10 (8) , 2939
Abstract
This article investigates the efficiency of a doParallel algorithm and a formal concept analysis (FCA) network graph applied to recommendation systems. It is the first article using the FCA method to create a network graph and apply this graph to improve the accuracy of a recommendation system. According to the fundamental knowledge about users who have similar feature information, they may like the same items. This idea was used to create an FCA network graph. In the proposed process, the k-clique method was used to divide this network graph into various communities. A combination of the k-nearest neighbor and the betweenness centrality methods was used to find a suitable community for a new user based on the feature information similarities between the new user and an existing user in each community. Finally, a data mining method created a list of items from suitable communities and recommended them to the new user. In essence, the execution in this article uses a doParallel algorithm as a mechanism in parallel processing technology. The result of the implementation is satisfactory. It proved that the proposed method could resolve the cold-start problem in a recommendation system and may overcome the vast time consumption when a huge dataset is involved.Keywords
Funding Information
- National Research Foundation of Korea (NRF-2020R1A2B5B01002134)
This publication has 24 references indexed in Scilit:
- A collaborative approach for semantic time-based video annotation using gamificationHuman-centric Computing and Information Sciences, 2017
- k-Cliques mining in dynamic social networks based on triadic formal concept analysisNeurocomputing, 2016
- A new metric of absolute percentage error for intermittent demand forecastsInternational Journal of Forecasting, 2016
- The MovieLens DatasetsACM Transactions on Interactive Intelligent Systems, 2015
- Recommendation systems: Principles, methods and evaluationEgyptian Informatics Journal, 2015
- Recommender systems: from algorithms to user experienceUser Modeling and User-Adapted Interaction, 2012
- Routing betweenness centralityJournal of the ACM, 2010
- The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed GraphIEEE Transactions on Pattern Analysis and Machine Intelligence, 2009
- Analyzing an Email Collection Using Formal Concept AnalysisLecture Notes in Computer Science, 1999
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977