Rapid prototyping of pattern mining problems isomorphic to boolean lattices

Interesting pattern mining is an important family of data mining problems with applications in many domains. In the last decade, many algorithms and benchmarks have been devised and many experimental studies have been performed for pattern mining problems. In this paper, we focus on the special class of pattern mining problems known to be ‘representable as sets’. This class of problem is important and have many applications such as in data mining, in databases, in artificial intelligence, or in software engineering.