By Topic

A novel algorithm for enumerating maximal bicliques from a symmetric matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Savio, M.D. ; Dept. of Comput. & Inf. Sci., PSG Coll. of Technol., Coimbatore, India ; Sankar, A. ; Nataraj, R.V.

We address the problem of enumerating maximal bicliques from a symmetric matrix. We propose a novel algorithm named TWINBLADE which exploits the properties of symmetric matrix, and reduces the search space to a larger extent and it generates not even a single duplicate. Our algorithm is compared with LCM-MBC algorithm, in the experiment conducted, ours take almost only half the running time of LCM-MBC for sparse and comparatively performs better for dense datasets.

Published in:

Emerging Applications of Information Technology (EAIT), 2012 Third International Conference on

Date of Conference:

Nov. 30 2012-Dec. 1 2012