The Efficiency of a DoParallel Algorithm and an FCA Network Graph Applied to Recommendation System
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vilakone, Phonexay | - |
dc.contributor.author | Park, Doo-Soon | - |
dc.date.accessioned | 2021-08-11T08:37:47Z | - |
dc.date.available | 2021-08-11T08:37:47Z | - |
dc.date.issued | 2020-02 | - |
dc.identifier.issn | 2076-3417 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/3121 | - |
dc.description.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. | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | MDPI | - |
dc.title | The Efficiency of a DoParallel Algorithm and an FCA Network Graph Applied to Recommendation System | - |
dc.type | Article | - |
dc.publisher.location | 스위스 | - |
dc.identifier.doi | 10.3390/app10082939 | - |
dc.identifier.wosid | 000533352100303 | - |
dc.identifier.bibliographicCitation | Applied Sciences-basel, v.10, no.8 | - |
dc.citation.title | Applied Sciences-basel | - |
dc.citation.volume | 10 | - |
dc.citation.number | 8 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Chemistry | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Materials Science | - |
dc.relation.journalResearchArea | Physics | - |
dc.relation.journalWebOfScienceCategory | Chemistry, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Engineering, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Materials Science, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Physics, Applied | - |
dc.subject.keywordPlus | SET | - |
dc.subject.keywordAuthor | betweenness centrality | - |
dc.subject.keywordAuthor | data mining | - |
dc.subject.keywordAuthor | formal concept analysis | - |
dc.subject.keywordAuthor | k-clique | - |
dc.subject.keywordAuthor | k-nearest neighbor | - |
dc.subject.keywordAuthor | parallel processing | - |
dc.subject.keywordAuthor | recommendation system | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG UNIVERSITY ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.