Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > LISTING ALGORITHM:
Reports tagged with listing algorithm:
TR98-061 | 29th September 1998
Robert H. Sloan, Ken Takata, György Turán

On frequent sets of Boolean matrices

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 >>>




ISSN 1433-8092 | Imprint