Алгоритмы параллельной реализации анализа формальных понятий для приближённых множеств в однородных семантических сетях

Abstract

This paper considers a way of parallel implementation of an algorithm of formal con-cept analysis for rough sets in homogeneous semantic networks. The algorithm description consists of two parts. The first part describes two supply algorithms for set intersection and union operations respectively, which are adapted for parallel implementation on heterogeneous compute architectures with data stream parallelism. The second part describes steps for building graph of class-subclass ontology (taxonomy) from a rough formal context.