On containment of triclusters collections generated by quantified box operators

Abstract

Analysis of polyadic data (for example n-ary relations) becomes a popular task nowadays. While several data mining techniques exist for dyadic contexts, their extensions to triadic case are not obvious. In this work, we study development of ideas of Formal Concept Analysis for processing three-dimensional data, namely OAC-triclustering (from Object, Attribute, Condition). We consider several similar methods, study relations between their outputs and organize them in an ordered structure.