Abstract
Relational classification in networked data plays an important role in many problems such as text categorization, classification of web pages, group finding in peer networks, etc. We have previously demonstrated that for a class of label propagating algorithms the underlying dynamics can be modeled as a two-state epidemic process on heterogeneous networks, where infected nodes correspond to classified data instances. We have also suggested a binary classification algorithm that utilizes non–trivial characteristics of epidemic dynamics. In this paper we extend our previous work by considering a three–state epidemic model for label propagation. Specifically, we introduce a new, intermediate state that corresponds to “susceptible” data instances. The utility of the added state is that it allows to control the rates of epidemic spreading, hence making the algorithm more flexible. We show empirically that this extension improves significantly the performance of the algorithm. In particular, we demonstrate that the new algorithm achieves good classification accuracy even for relatively large overlap across the classes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Galstyan, A., Cohen, P.R.: Inferring Useful Heuristics from the Dynamics of Iterative Relational Classifiers. In: International Joint Conference on Artificial Intelligence, Edinburgh, Scotland (2005)
Galstyan, A., Cohen, P.R.: Identifying Covert Sub-Networks Through Iterative Node Classification. In: Proc. of International Conference on Intelligence Analysis, McLean, VA (2005)
Galstyan, A., Cohen, P.R.: Global Cascades in Modular Networks. working paper (2006)
Getoor, L., Segal, E., Taskar, B., Koller, D.: Probabilistic models of text and link structure for hypertext classification. In: IJCAI Workshop on Text Learning: Beyond Supervision (2001)
Macskassy, S.A., Provost, F.J.: A Simple Relational Classifier. In: Workshop on Multi-Relational Data Mining in conjunction with KDD 2003 (2003)
McCallum, A., Nigam, K., Rennie, J., Seymore, K.: Automating the construction of internet portals with machine learning. Information Retrieval Journal 3, 127–163 (2000)
McGovern, A., Friedland, L., Hay, M., Gallagher, B., Fast, A., Neville, J., Jensen, D.: Exploiting relational structure to understand publication (2003)
Neville, J., Jensen, D.: Iterative classification in relational data. In: Proc. AAAI 2000 Workshop on Learning Statistical Models from Relational Data, pp. 13–20. AAAI Press, Menlo Park (2000)
Slattery, S., Craven, M.: Discovering test set regularities in relational domains. In: Langley, P. (ed.) Proceedings of ICML 2000, 17th International Conference on Machine Learning, Stanford, US, pp. 895–902. Morgan Kaufmann Publishers, San Francisco (2000)
Taskar, B., Segal, E., Koller, D.: Probabilistic Classification and Clustering in Relational Data. In: Proceedings of IJCAI 2001, 17th International Joint Conference on Artificial Intelligence, Seattle, US (2001)
Taskar, B., Wong, M., Abbeel, P., Koller, D.: Link prediction in relational data. In: Proceedings of Neural Information Processing Systems (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galstyan, A., Cohen, P.R. (2006). Iterative Relational Classification Through Three–State Epidemic Dynamics. In: Mehrotra, S., Zeng, D.D., Chen, H., Thuraisingham, B., Wang, FY. (eds) Intelligence and Security Informatics. ISI 2006. Lecture Notes in Computer Science, vol 3975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760146_8
Download citation
DOI: https://doi.org/10.1007/11760146_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34478-0
Online ISBN: 978-3-540-34479-7
eBook Packages: Computer ScienceComputer Science (R0)