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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE access Ročník 13; s. 35113 - 35123
Hlavní autori:	Sadriddinov, Ilkhomjon, Peng, Sony, Siet, Sophort, Kim, Dae-Young, Park, Doo-Soon, Yi, Gangman
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!