• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

Putting OAC-triclustering on MapReduce

P. 47-58.
Зудин С., Gnatyshak D. V., Ignatov D. I.
In our previous work an efficient one-pass online algorithm for triclustering of binary data (triadic formal contexts) was proposed. This algorithm is a modified version of the basic algorithm for OAC-triclustering approach; it has linear time and memory complexities. In this paper we parallelise it via map-reduce framework in order to make it suitable for big datasets. The results of computer experiments show the efficiency of the proposed algorithm; for example, it outperforms the online counterpart on Bibsonomy dataset with ≈ 800, 000 triples.  

In book

Edited by: S. Ben Yahia, J. Konecny. Vol. 1466. Clermont-Ferrand: CEUR Workshop Proceedings, 2015.