On Maximising the Vertex Coverage for ${\text{Top}}-k$ t-Bicliques in Bipartite Graphs.
Aman AbidiLu ChenChengfei LiuRui ZhouPublished in: ICDE (2022)
Keyphrases
- bipartite graph
- minimum weight
- maximum cardinality
- maximum matching
- edge weights
- information retrieval
- link prediction
- information retrieval systems
- maximum weight
- keywords
- active learning
- graph clustering
- query processing
- bipartite graph matching
- web documents
- directed graph
- information extraction
- mutual reinforcement
- social networks