Published January 1, 2008 | Version v1
Journal article Open

Inversion method for content-based networks

  • 1. Feza Gursey Inst, TR-34680 Istanbul, Turkey

Description

In this paper, we generalize a recently introduced expectation maximization (EM) method for graphs and apply it to content-based networks. The EM method provides a classification of the nodes of a graph, and allows one to infer relations between the different classes. Content-based networks are ideal models for graphs displaying any kind of community and/or multipartite structure. We show both numerically and analytically that the generalized EM method is able to recover the process that led to the generation of such networks. We also investigate the conditions under which our generalized EM method can recover the underlying content-based structure in the presence of randomness in the connections. Two entropies, S-q and S-c, are defined to measure the quality of the node classification and to what extent the connectivity of a given network is content based. Sq and Sc are also useful in determining the number of classes for which the classification is optimal.

Files

bib-6d1fb5de-8bf4-43c4-8154-172fccbdb607.txt

Files (103 Bytes)

Name Size Download all
md5:d4c2619e7e66aee1113433fe1f92d657
103 Bytes Preview Download