-
Minimizing Hitting Time between Disparate Groups with Shortcut Edges
Experiments on real-world datasets to evaluate the effectiveness of the algorithms proposed in paper...-
Github
The resource: 'experiment data and code' is not accessible as guest user. You must login to access it!
-
Github
-
Visualizing the Results of Biclustering and Boolean Matrix Factorization Algo...
This archive contains the code to visualize biclusters from the paper "Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations" by Thibault Marette, Pauli... -
Reducing Graph Structural Bias by Adding shortcut edges
Algorithms that tackle the problem of minimizing average/maximum hitting time (BMAH/BMMH) between different social network groups, given fixed shortcut edges. The...-
Data
The resource: 'Social network dataset' is not accessible as guest user. You must login to access it!
-
Data