Iterative ensemble classification for relational data: A case study of semantic web services

5Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For the classification of relational data, iterative algorithms that feed back predicted labels of associated objects have been used. In this paper we show two extensions to existing approaches. First, we propose to use two separate classifiers for the intrinsic and the relational (extrinsic) attributes and vote their predictions. Second, we introduce a new way of exploiting the relational structure. When the extrinsic attributes alone are not sufficient to make a prediction, we train specialised classifiers on the intrinsic features and use the extrinsic features as a selector. We apply these techniques to the task of semi-automated Web Service annotation, a task with a rich relational structure. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Heß, A., & Kushmerick, N. (2004). Iterative ensemble classification for relational data: A case study of semantic web services. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3201, pp. 156–167). Springer Verlag. https://doi.org/10.1007/978-3-540-30115-8_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free