Exploiting propositionalization based on random relational rules for semi-supervised learning
Pfahringer, B. & Anderson, G. (2008). Exploiting propositionalization based on random relational rules for semi-supervised learning. In T. Washio et al. (Eds), Proceedings of 12th Pacific-Asia Conference, PAKDD 2008 Osaka, Japan, May 20-23, 2008(pp. 495-502). Berlin: Springer.
Permanent Research Commons link: https://hdl.handle.net/10289/1428
In this paper we investigate an approach to semi-supervised learning based on randomized propositionalization, which allows for applying standard propositional classification algorithms like support vector machines to multi-relational data. Randomization based on random relational rules can work both with and without a class attribute and can therefore be applied simultaneously to both the labeled and the unlabeled portion of the data present in semi-supervised learning. An empirical investigation compares semi-supervised propositionalization to standard propositionalization using just the labeled data portion, as well as to a variant that also just uses the labeled data portion but includes the label information in an attempt to improve the resulting propositionalization. Preliminary experimental results indicate that propositionalization generated on the full dataset, i.e. the semi- supervised approach, tends to outperform the other two more standard approaches.