Frequent itemset search in Row enumeration and Column enumeration
Feng Pan
Previous frequent itemset search algorithms such as Apriori, Charm and 
Closet search the frequent itemset in the column enumeration space. 
While in the case that the number of column is much larger than the 
number rows, such as microaray data, to search pattern in the row 
enumeration space should be much more efficient. And further more, if 
we can combine these two kinds of methods, hopefully, we can deal with 
dataset with large number rows and columns.