WSEAS Transactions on Information Science and Applications
Print ISSN: 1790-0832, E-ISSN: 2224-3402
Volume 12, 2015
One Time Enumeration of Maximal Biclique Patterns from 3d Symmetric Matrix
Authors: , ,
Abstract: We propose an algorithm Cubeminer-MBC*, to extract maximal biclique patterns from a 3D symmetric adjacency matrix only once. In this paper, we introduce (i) a novel enumeration strategy and (ii) a new pruning strategy, which results 50% reduction in search space and maximal biclique patterns are generated only once, i.e., zero duplicates are generated. On the basis of experiments conducted, we observed Cubeminer-MBC* outperforms Cubeminer in terms of running time.