SNA::Network - Social Network Analysis with Perl
By Darko Obradovic from Kaiserslautern.pm
Date: Tuesday, 21 August 2012 15:15
Duration: 20 minutes
Target audience: Any
Language: English
Tags: algorithms analysis graphs
In this talk the SNA::Network module from CPAN is presented. It allows the fast and flexible analysis of network structure data, which is present in many Web 2.0 Internet platforms, not only in the social networks.
We present state of the art centrality and community identification algorithms, and compare the performance to Graph.pm.
We also show how to easily extend it with own algorithms, data fields and import/export filters with a very simple plugin mechanism.
Attended by: Martin Becker (martin), Lars Dɪᴇᴄᴋᴏᴡ (daxim), Fabian Zimmermann (fobs), atoomic, Thomas Klausner (domm), Abe Timmerman (abeltje), Robin Sheat, Oskari Ojala (Okko), Tobias Reimann, Alex Timoshenko, Winfried Puchinger (winpuc), Gligan Horea (Horea), Markus Raulf, Bogdan Lucaciu (zamolxes), Sebastian Willert, Kang-min Liu (gugod), Darko Obradovic, Hilko Bengen (hillu), Dave Sherohman (dsheroh), Patrick Ringl (pari), Hans-Jürgen Schloz, Sebastian Stellingwerff (webmind), Peter Makholm (brother), Tri Duong Tran, Christian Altergott, Wesley Johnson (wesjdj),
