  Co-occurence networks can be adequately modeled by hyper-bag-graphs
(hb-graphs for short). A hb-graph is a family of multisets having same
universe, called the vertex set. An efficient exchange-based diffusion scheme
has been previously proposed that allows the ranking of both vertices and
hb-edges. In this article, we extend this scheme to allow biases of different
kinds and explore their effect on the different rankings obtained. The biases
enhance the emphasize on some particular aspects of the network.
