Frequent Itemsets Mining
Date: April 06, 2014 11:45AM
Hello everyone, I'm trying to solve the problem of given a 0/1 matrix find every submatrices of 1's having at least k rows.
In this paper
appears that my problem has already been solved as the Frequent Itemsets Mining (FIM) problem.
In this form the FIM problem can be stated as follows: given X and k >= 1, find every submatrix of 1s in X having at least k rows, and report the associated set of columns. If the threshold k is allowed to vary, then FIM algorithms essentially seek to find every maximal submatrix of 1s in the data matrix X.
Please is there any algorithm that solves this problem?