Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Bax, E.: Nearly uniform validation improves compression-based error bounds. Journal of Machine Learning Research 9, 1741–1755 (2008)
Bax, E., Callejas, A.: An error bound based on a worst likely assignment. Journal of Machine Learning Research 9, 581–613 (2008)
Bollobas, B.: Random Graphs, 2nd edn. Cambridge University Press (2001)
Bondy, J.A., Murty, U.: Graph Theory. Springer (2008)
Cataltepe, Z., Sonmez, A., Baglioglu, K., Erzan, A.: Collective classification using heterogeneous classifiers. In: 7th International Conference on Machine Learning and Data Mining, MLDM 2011 (2011)
Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. Cambridge University Press (2000)
Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley & Sons, New York (1968)
Frank, O.: Survey sampling in graphs. Journal of Statistical Planning and Inference 1, 235–264 (1977)
Getoor, L., Friedman, N., Koller, D., Taskar, B.: Learning probabilistic models of link structure. Journal of Machine Learning Research 3, 679–707 (2002)
Kolaczyk, E.D.: Statistical Analysis of Network Data. Springer (2010)
Macskassy, S., Provost, F.: A simple relational classifier. In: Proceedings of the Multi-Relational Data Mining Workshop (MRDM) at the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, pp. 64–76 (2003)
Macskassy, S.A., Provost, F.: Classification in networked data: A toolkit and a univariate case study. Journal of Machine Learning Research 8, 935–983 (2007)
Sen, P., Getoor, L.: Empirical comparison of approximate inference algorithms for networked data. In: ICML Workshop on Open Problems in Statistical Relational Learning, SRL 2006 (2006)
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Magazine 29(3) (2008)
Vapnik, V.: Statistical Learning Theory. John Wiley & Sons (1998)
Watts, D.: Six Degrees: The Science of a Connected Age. Norton & Company (2003)
Watts, D., Strogatz, S.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)
Zheleva, E., Getoor, L.: To join or not to join: The illusion of privacy in social networks with mixed public and private user profiles. In: 18th International World Wide Web Conference, pp. 531–531 (April 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Sonmez, A., Cataltepe, Z., Bax, E. (2012). Validation of Network Classifiers. In: Gimel’farb, G., et al. Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2012. Lecture Notes in Computer Science, vol 7626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34166-3_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-34166-3_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34165-6
Online ISBN: 978-3-642-34166-3
eBook Packages: Computer ScienceComputer Science (R0)