Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

JMLR
2012

favoriteEmaildiscussreport

253views Programming Languages» more JMLR 2012»

Graphlet decomposition of a weighted network

11 years 7 months ago

Graphlet decomposition of a weighted network

Download jmlr.csail.mit.edu

We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combines EM with Bron-Kerbosch in a novel fashion, for estimating the parameters of the model underlying graphlets using one network sample. We explore theoretical properties of graphlets, including computational complexity, redundancy and expected accuracy. We test graphlets on synthetic data, and we analyze messaging on Facebook and crime associations in the 19th century.

Hossein Azari Soufiani, Edo Airoldi

Real-time Traffic

Computational Complexity | Facebook | JMLR 2012 | Programming Languages | Scalable Algorithm |

claim paper

Related Content

» Prediction of Chaotic TimeSeries with a ResourceAllocating RBF Network

» NearLinear Time Construction of Sparse Neighborhood Covers

» Modular Neural Network Task Decomposition Via Entropic Clustering

» Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulat...

» High Order Eigentensors as Symbolic Rules in Competitive Learning

» Spectral Decomposition of Signaling Networks

» Ensembling neural networks Many could be better than all

» Neural predictive control for a carlike mobile robot

» Distributed Base Station Cooperation via BlockDiagonalization and DualDecomposition

Post Info
More Details (n/a)

Added	27 Sep 2012
Updated	27 Sep 2012
Type	Journal
Year	2012
Where	JMLR
Authors	Hossein Azari Soufiani, Edo Airoldi

Comments (0)