Multivariate Prediction for Learning on the Semantic Web
- Cite this paper as:
- Huang Y., Tresp V., Bundschus M., Rettinger A., Kriegel HP. (2011) Multivariate Prediction for Learning on the Semantic Web. In: Frasconi P., Lisi F.A. (eds) Inductive Logic Programming. ILP 2010. Lecture Notes in Computer Science, vol 6489. Springer, Berlin, Heidelberg
One of the main characteristics of Semantic Web (SW) data is that it is notoriously incomplete: in the same domain a great deal might be known for some entities and almost nothing might be known for others. A popular example is the well known friend-of-a-friend data set where some members document exhaustive private and social information whereas, for privacy concerns and other reasons, almost nothing is known for other members. Although deductive reasoning can be used to complement factual knowledge based on the ontological background, still a tremendous number of potentially true statements remain to be uncovered. The paper is focused on the prediction of potential relationships and attributes by exploiting regularities in the data using statistical relational learning algorithms. We argue that multivariate prediction approaches are most suitable for dealing with the resulting high-dimensional sparse data matrix. Within the statistical framework, the approach scales up to large domains and is able to deal with highly sparse relationship data. A major goal of the presented work is to formulate an inductive learning approach that can be used by people with little machine learning background. We present experimental results using a friend-of-a-friend data set.
Unable to display preview. Download preview PDF.