Spectral density-based clustering algorithms for complex networks

HIGHLIGHTS

• who: Taiane Coelho Ramos from the University of Warsaw, Poland have published the article: Spectral density-based clustering algorithms for complex networks, in the Journal: (JOURNAL)
• what: When the data set comprises graphs, the most common approaches focus on clustering its vertices. The authors show that the methods work well in both toy models and realworld data. To solve this problem, the authors propose a model-based method that can cluster 2.4. Idea, the authors propose an EM-inspired method for graphs.
• how: The authors evaluated their performance in toy models. The . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.