A One-Pass Triclustering Approach: Is There any Room for Big Data?

Abstract

Abstract. An efficient one-pass online algorithm for triclustering of bi-nary data (triadic formal contexts) is proposed. This algorithm is a modified version of the basic algorithm for OAC-triclustering approach, but it has linear time and memory complexities with respect to the car-dinality of the underlying ternary relation and can be easily parallelized in order to be applied for the analysis of big datasets. The results of computer experiments show the efficiency of the proposed algorithm.