K-bisimulation: A novel approach for simplifying heterogeneous information networks

Heterogeneous information networks (HINs) are becoming increasingly important and widely used; however, fewer studies are focusing on the branch structures within HINs. Based on the commonalities of concurrent systems and heterogeneous information networks, as well as the significant application of bisimulation equivalence in concurrent systems, this article proposes k-bisimulation among nodes belonging to same node type, aiming to simplify the branching structure of that to obtain a cost-effective model, wherein the k is a positive integrate being closely related to the similarity degree of nodes. In this paper, we initially define the notion of k-bisimulation for nodes. Subsequently, we propose a computational method to identify k-bisimulation among nodes of same type in HINs. With the assistance of this method, we can derive a network that is approximately bisimular to the original one. Theoretical and practical analysis reveals that errors in connected paths between the original and bisimular networks are controllable. Experimental results indicate that, in comparison to the original network, the obtained network exhibits a reduction in the number of nodes and edges, while still preserve same or similar information.