Hierarchical Co-Clustering of Bipartite Graphs | CSCE 2021 Presentation 🎯

This video present two scientific contributions:
- We address the problem of dimension relatedness in the Vector Space Model
- We propose a hierarchical co-clustering algorithm, allowing to clusters both side of the bipartite graph at the same time, exploiting synergies between clusters. Our approach has the particularity of building clusters of equivalent size, preventing the obtention of a single large cluster and many small cluster.
The approaches have been applied over the DBLP dataset, a citation graph.
It leads to balanced cluster with highly coherent clusters.
For further details, looks at the proceedings of the CSCE conference.