Archive

Posts Tagged ‘algorithms’

Algorithmic Community Detection in Networks

September 29th, 2009 dmartink No comments

Communities in Networks

Community detection in networks is an extremely important part of the broader network science literature. For quite a while, we have meant to highlight the extremely useful review article written by Mason Porter (Oxford) Jukka-Pekka Onnela (Harvard/Oxford) and Peter J Mucha (UNC). Rather than offer our description of the article, we thought it best to highlight commentary on the subject provided by the authors.

For example, in describing the paper over at Harvard’s Complexity and Social Networks Blog Jukka-Pekka Onnela posted the following… “Uncovering the “community” structure of social networks has a long history, but communities play a pivotal role in almost all networks across disciplines. Intuitively, one can think of a network community as consisting of a group of nodes that are relatively densely connected to each other but sparsely connected to other dense groups of nodes. Communities are important because they are thought to have a strong bearing on functional units in many networks. So, for example, communities in social networks can correspond to different social groups, such as family, whereas web pages dealing with a given subject tend to form topical communities.  The concept is simple enough, but it turns out that coming up with precise mathematical definitions and algorithms for community detection is one of the most challenging problems in network science. Recently, a lot of the research in this area has been done using ideas from statistical physics, which has an arsenal of tools and concepts to tackle the problem. Unfortunately (but understandably) relatively few non-physicists like to read statistical physics papers.”

These scholars quote Mark Newman noting “[T]he development of methods for finding communities within networks is a thriving sub-area of the field, with an enormous number of different techniques under development. Methods for understanding what the communities mean after you find them are, by contrast, still quite primitive, and much needs to be done if we are to gain real knowledge from the output of our computer programs.”  They later note “the problem of how to validate and use communities once they are identified is almost completely open.”

Anyway, if you are interested in learning more about this important piece of the network science toolkit … we suggest you read this paper!

Distance Measures for Dynamic Citation Networks (On the arXiv) (Bommartio, Katz, Zelner & Fowler)

September 11th, 2009 dmartink No comments

Distance Measures for Dynamic Citation Networks

Our Presentation Slides from ASNA 2009 @ ETH Zurich

August 27th, 2009 dmartink No comments

ASNA 2009

Stability of Community Detection Algorithms on Longitudinal Citation Data — Our New Paper on the Physics arXiv — {Click Below to Download}

August 18th, 2009 dmartink No comments

Bommarito, Katz & Zelner

Bruce B d M on Predicting Iran’s Development of Nuclear Weapons

August 17th, 2009 dmartink No comments

Iranian Weapons

The Power of Collaboration in the NetFlix Challenge [NY Times]

July 28th, 2009 dmartink No comments

Netflix Prize

Stunning Data Visualization in the AlloSphere

July 22nd, 2009 dmartink No comments

Ted Talk

HarambeeNet @ Duke Computer Science

July 20th, 2009 dmartink No comments

We enjoyed today’s discussion at the Harambeenet Conference here in the Duke Computer Science Department.  The conference is centered upon network science and computer science education. It features lots of interdisciplinary scholarship and applications of computer science techniques in novel domains.

We are looking forward to an interesting final day of discussion and hope to participate in allied future conferences.  

Computational Linguistics and Law — Some Useful Introductory Slides

July 7th, 2009 dmartink No comments

Comp Linguistics & Law

Citation Analysis in Continental Jurisdictions

July 6th, 2009 dmartink No comments

Citation Analysis

Anton Geist has posted Using Citation Analysis Techniques for Computer-Assisted Legal Research in Continental Jurisdictions to the SSRN.  While this is certainly longer than most papers, we believe it offers a good review of the broader information retrieval and law literature.  In addition, it offers some empirical insight into citation patterns within continental jurisdictions. The findings in this paper are similar to those shown in important papers by Thomas Smith in The Web of the Law and by David Post & Michael Eisen in How Long is the Coastline of Law? Thoughts on the Fractal Nature of Legal Systems. 

In our view, the next step for this research is to determine whether the pattern does indeed follow a power law distribution.  Specifically, there exists a Maximum Likelihood based test developed in the applied physics paper Power-law Distributions in Empirical Data by Aaron ClausetCosma Shalizi and Mark Newman which can help adjudicate whether the detected pattern represents a highly skewed distribution or is indeed a power law.

Either way, we are excited by this paper as we believe comparative research is absolutely critical to broader theory development.

Iranian Blogosphere: Followup from Harvard NIPS 2009

June 16th, 2009 dmartink No comments

Iranian Blogosphere

We genuinely enjoyed our trip to Boston for the Networks in Political Science 2009 Conference at Harvard.  There were many highlights but given the timely nature of their work we wanted to highlight the presentation by John Kelly & Bruce Etling entitled Mapping Culture, Politics, and Religion in the Arabic Blogosphere.  This is a followup to last year’s presentation, Mapping Iran’s Online Public: Politics and Culture in the Persian Blogosphere.  As usual, the folks at the Berkman Center are doing great work.  Check out today’s New York Times featuring an article entitled Iranian Blogosphere Tests Government’s Limits

WP SlimStat