Robert H. Sloan, Ken Takata, György Turán

Given a Boolean matrix and a threshold t, a subset of the

columns is frequent if there are at least t rows having a 1 entry in

each corresponding position. This concept is used in the algorithmic,

combinatorial approach to knowledge discovery and data mining. We

consider the complexity aspects ...
more >>>