Abstract
In this study, we focus on flow-based clustering on directed graphs and propose a localized algorithm for this problem. Flow-based clustering in networks requires a set of closely related vertices where the flow amount getting into it is larger than that going out of it. It is able to formulate a variety of practical problems, such as fund-raising set detection in financial networks and influential document clustering in citation networks, etc. Methodologically, we propose the new concept of two-dimensional structural entropy on directed graphs, and based on this, a local structural entropy minimization algorithm for detecting the flow-based community structure of networks is designed. We adopt our algorithm for the problem of fund-raising set detection in financial networks, in which vertices represent accounts, edges represent transactions between two accounts, and weights represent money amounts of transactions. In our experiments, the local two-dimensional structure entropy minimization algorithm is devoted to find a fund-raising community which involves a given input account. We conduct experiments on both synthetic and real fund-raising datasets. The experimental results demonstrate that, given a fixed account, our algorithm is able to efficiently locate a fund-raising community (if any) for which the fund flowing into the community is much higher than that flowing out, and the transactions within the community are relatively denser (fund amount based) than that of inter-community. For a synthetic ground-truth fund-raising community, we adjust the parameters to change its fund-raising tendency. The results for the synthetic datasets show that our algorithm obtains higher precision and recall rates as this tendency gets stronger with each single factor varing. For a real fund-raising community embedded in a simulated capital flow network, our algorithm also find it with high precision and recall rates. The experiments for both scenarios verify the effectiveness of our algorithm.
Highlights
Using Networks to Represent Complex Systems in various fields has become ubiquitous
We demonstrate its application in fund-raising community detection, which is quite an important problem in financial network analysis, for example, in the field of fund supervision
Structural entropy was raised by Li and Pan [29] for undirected graphs to measure the information embedded in graph structures
Summary
Using Networks to Represent Complex Systems in various fields has become ubiquitous. Examples include the World Wide Web (WWW), social networks, business collaborations, scientific citations, neural networks, biological networks, and metabolic networks, etc. [1]–[5]. (1) Vertices in a cluster are relatively densely connected; (2) The total amount of inflows is greater than that of the outflows This kind of flow-based clustering can be inferred to represent communities of special significance in real-world networks, such as fund-raising communities in financial networks. Another example is the citation networks, in which if paper u cites paper v, there is a directed edge linking from u to v. We demonstrate its application in fund-raising community detection, which is quite an important problem in financial network analysis, for example, in the field of fund supervision. The experiment results verify the effectiveness of our algorithm in terms of high precision and recall rates
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
