Open Access Open Access  Restricted Access Subscription or Fee Access

A Novel Enumeration Strategy of Maximal Bicliques from 3-Dimensional Symmetric Adjacency Matrix

Michael Raj Dominic Savio, Annamalai Sankar, Nataraj Ramaiya Vijayarajan


Several algorithms are available in the literature to find all maximal bicliques from an adjacency matrix. If these algorithms are applied directly on a symmetric adjacency matrix, all maximal bicliques will be generated twice. We propose a novel algorithm, S-Datapeeler, to enumerate all maximal bicliques only once in the context of 3-dimensional symmetric adjacency matrix i.e. zero duplicate patterns are generated. We have compared our results with DataPeeler in 3-D context. The DataPeeler algorithm generates all duplicate patterns, whereas the proposed algorithm completely eliminates all duplicate maximal bicliques. The proposed methodology results in 50% reduction in search space and thereby running time of S-Datapeeler is better for 3-D symmetric datasets.


Data Mining, Maximal Bicliques, Symmetric matrix, Algorithms

Full Text:


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.