Joint IAPR International Workshop on Structural and Syntactic Pattern Recognition (SSPR) / International Workshop on Statistical Techniques in Pattern Recognition (SPR), Hiroshima, Japan, 7 - 09 November 2012, vol.7626, pp.448-457
This paper develops PAC (probably approximately correct) error bounds for network classifiers in the transductive setting, where the network node inputs and links are all known, the training nodes class labels are known, and the goal is to classify a working set of nodes that have unknown class labels. The bounds are valid for any model of network generation. They require working nodes to be selected independently, but not uniformly at random. For example, they allow different regions of the network to have different densities of unlabeled nodes.