Original paper

Flow-Based Clustering on Directed Graphs: A Structural Entropy Minimization Approach

Volume: 8, Pages: 152579 - 152591
Published: Jan 1, 2020
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....
Paper Details
Title
Flow-Based Clustering on Directed Graphs: A Structural Entropy Minimization Approach
Published Date
Jan 1, 2020
Volume
8
Pages
152579 - 152591
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.