Labeling actors in social networks using a heterogeneous graph kernel

1Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the problem of labeling actors in social networks where the labels correspond to membership in specific interest groups, or other attributes of the actors. Actors in a social network are linked to not only other actors but also items (e.g., video and photo) which in turn can be linked to other items or actors. Given a social network in which only some of the actors are labeled, our goal is to predict the labels of the remaining actors. We introduce a variant of the random walk graph kernel to deal with the heterogeneous nature of the network (i.e., presence of a large number of node and link types). We show that the resulting heterogeneous graph kernel (HGK) can be used to build accurate classifiers for labeling actors in social networks. Specifically, we describe results of experiments on two real-world data sets that show HGK classifiers often significantly outperform or are competitive with the state-of-the-art methods for labeling actors in social networks. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Bui, N., & Honavar, V. (2014). Labeling actors in social networks using a heterogeneous graph kernel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8393 LNCS, pp. 27–34). Springer Verlag. https://doi.org/10.1007/978-3-319-05579-4_4

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