Sign in
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks.
Riccardo Dondi
Mohammad Mehdi Hosseinzadeh
Pietro H. Guzzi
Published in:
Appl. Netw. Sci. (2021)
Keyphrases
</>
learning algorithm
k means
probabilistic model
markov chain
data sets
clustering algorithm
data analysis
high precision