Algorithm for Mining Maximal Balanced Bicliques Using Formal Concept Analysis

One of the most fundamental models for cohesive subgraph mining in network analysis is that which involves the use of cliques. In bipartite graph analysis, the detection of maximal balanced bicliques (MBB) is an important problem with numerous applications, including VLSI design, protein interaction...

Full description

Bibliographic Details

Published in:	IEEE access Vol. 13; pp. 35113 - 35123
Main Authors:	Sadriddinov, Ilkhomjon, Peng, Sony, Siet, Sophort, Kim, Dae-Young, Park, Doo-Soon, Yi, Gangman
Format:	Journal Article
Language:	English
Published:	IEEE 2025
Subjects:	Bipartite graph Data mining Detection algorithms Formal concept analysis Lattices maximal balanced biclique Social networking (online) Time complexity Web pages
ISSN:	2169-3536, 2169-3536
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!