论文信息 - Graph Clustering in SPARQL Kevin Deweese

Graph Clustering in SPARQL Kevin Deweese

SPARQL is a powerful engine for querying graphs based on local patterns. We present a method to find a global graph metric, clustering using the PeerPressure algorithm, using RDF/SPARQL. Our approach is extensible to other classes of algorithms such as searches and centrality metrics.

John R. Gilbert | Adam Lugowski | Steve Reinhardt

[1] Tamara G. Kolda,et al. Community structure and scale-free collections of Erdös-Rényi graphs , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2] Réka Albert,et al. Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3] John R. Gilbert,et al. An interactive system for combinatorial scientific computing with an emphasis on programmer productivity , 2007 .

[4] Marco Rosa,et al. Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks , 2010, WWW.

[5] Tinkara Toš,et al. Graph Algorithms in the Language of Linear Algebra , 2012, Software, environments, tools.