Publication: A Parallel Version of the In-Close Algorithm
| dc.contributor.author | Kodagoda, N. | |
| dc.contributor.author | Andrews, S. | |
| dc.contributor.author | Pulasinghe, K. | |
| dc.date.accessioned | 2022-01-28T04:40:38Z | |
| dc.date.available | 2022-01-28T04:40:38Z | |
| dc.date.issued | 2017-01-17 | |
| dc.description.abstract | This research paper presents a new parallel algorithm for computing the formal concepts in a formal context. The proposed shared memory parallel algorithm Parallel-Task-In-Close3 parallelizes Andrews's In-Close3 serial algorithm. The paper presents the key parallelization strategy used and presents experimental results of the parallelization using the OpenMP framework | en_US |
| dc.identifier.doi | 10.1109/NCTM.2017.7872818 | en_US |
| dc.identifier.issn | 1800-3591 | |
| dc.identifier.uri | https://rda.sliit.lk/handle/123456789/807 | |
| dc.language.iso | en | en_US |
| dc.publisher | Faculty of Graduate Studies and Research | en_US |
| dc.relation.ispartofseries | Vol.6; | |
| dc.subject | FCA | en_US |
| dc.subject | In-close | en_US |
| dc.subject | parrellel | en_US |
| dc.subject | OpenMP | en_US |
| dc.subject | formal concept analysis | en_US |
| dc.title | A Parallel Version of the In-Close Algorithm | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication |