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.
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.
WSEAS Transactions on Information Science and Applications, ISSN / E-ISSN: 1790-0832 / 2224-3402, Volume 12, 2015, Art. #7
M. Dominic Savio, A. Sankar, R. V. Nataraj, "One Time Enumeration of Maximal Biclique Patterns from 3d Symmetric Matrix," WSEAS Transactions on Information Science and Applications, vol. 12, pp. 61-67, 2015, DOI:
M. Dominic Savio, A. Sankar, R. V. Nataraj. One Time Enumeration of Maximal Biclique Patterns from 3d Symmetric Matrix.
WSEAS Transactions on Information Science and Applications. 2015;12:61-67.