HIGHLIGHTS
- What: The random walk approach focuses on weak nodes in the network, while the algorithms for getting network global information and network end centrality based on degree centrality are challenging but complex.
- Who: Random walk et al. from the The density peak clustering (DPC) algorithm uses Euclidean distance to define local density and relative distance because it is based on local density and relative distanceAs a result, some sparse and large differences and long arcs have an unfavorable clustering effect, and some coordination strategies are not reliable [8]. This work presents a density peak clustering . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.