Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Louvain_Modularity> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Louvain_Modularity abstract "The Louvain Method for community detection is a method to extract communities from large networks created by Vincent Blondel, Jean-Loup Guillaume, Renaud Lambiotte and Etienne Lefebvre. The method is a greedy optimization method that appears to run in time O(n log n).".
- Louvain_Modularity wikiPageExternalLink 0803.0476.
- Louvain_Modularity wikiPageExternalLink louvain.html.
- Louvain_Modularity wikiPageID "44454257".
- Louvain_Modularity wikiPageLength "7187".
- Louvain_Modularity wikiPageOutDegree "10".
- Louvain_Modularity wikiPageRevisionID "708174300".
- Louvain_Modularity wikiPageWikiLink Category:Network_theory.
- Louvain_Modularity wikiPageWikiLink Community_structure.
- Louvain_Modularity wikiPageWikiLink Dirac_delta_function.
- Louvain_Modularity wikiPageWikiLink K-means_clustering.
- Louvain_Modularity wikiPageWikiLink Modularity_(networks).
- Louvain_Modularity wikiPageWikiLink Network_science.
- Louvain_Modularity wikiPageWikiLink Vincent_Blondel.
- Louvain_Modularity wikiPageWikiLinkText "Louvain Modularity".
- Louvain_Modularity wikiPageWikiLinkText "Louvain method".
- Louvain_Modularity wikiPageUsesTemplate Template:Network_Science.
- Louvain_Modularity wikiPageUsesTemplate Template:Reflist.
- Louvain_Modularity subject Category:Network_theory.
- Louvain_Modularity hypernym Method.
- Louvain_Modularity type Software.
- Louvain_Modularity comment "The Louvain Method for community detection is a method to extract communities from large networks created by Vincent Blondel, Jean-Loup Guillaume, Renaud Lambiotte and Etienne Lefebvre. The method is a greedy optimization method that appears to run in time O(n log n).".
- Louvain_Modularity label "Louvain Modularity".
- Louvain_Modularity sameAs m.012brwkx.
- Louvain_Modularity wasDerivedFrom Louvain_Modularity?oldid=708174300.
- Louvain_Modularity isPrimaryTopicOf Louvain_Modularity.