Next Article in Journal
Direction-of-Arrival Estimation with Coarray ESPRIT for Coprime Array
Next Article in Special Issue
RGCA: A Reliable GPU Cluster Architecture for Large-Scale Internet of Things Computing Based on Effective Performance-Energy Optimization
Previous Article in Journal
Monocular Vision-Based Underwater Object Detection
Previous Article in Special Issue
Non-Convex Sparse and Low-Rank Based Robust Subspace Segmentation for Data Mining
Article Menu
Issue 8 (August) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(8), 1786;

Constrained Active Learning for Anchor Link Prediction Across Multiple Heterogeneous Social Networks

College of Computer, National University of Defense Technology, Changsha 410073, China
Department of Computer Science, Florida State University, Tallahassee, FL 32306-4530, USA
Department of Computer Science, University of Illinois at Chicago, Chicago, IL 60607, USA
Author to whom correspondence should be addressed.
Received: 25 May 2017 / Revised: 20 July 2017 / Accepted: 27 July 2017 / Published: 3 August 2017
Full-Text   |   PDF [1040 KB, uploaded 4 August 2017]   |  


Nowadays, people are usually involved in multiple heterogeneous social networks simultaneously. Discovering the anchor links between the accounts owned by the same users across different social networks is crucial for many important inter-network applications, e.g., cross-network link transfer and cross-network recommendation. Many different supervised models have been proposed to predict anchor links so far, but they are effective only when the labeled anchor links are abundant. However, in real scenarios, such a requirement can hardly be met and most anchor links are unlabeled, since manually labeling the inter-network anchor links is quite costly and tedious. To overcome such a problem and utilize the numerous unlabeled anchor links in model building, in this paper, we introduce the active learning based anchor link prediction problem. Different from the traditional active learning problems, due to the one-to-one constraint on anchor links, if an unlabeled anchor link a = ( u , v ) is identified as positive (i.e., existing), all the other unlabeled anchor links incident to account u or account v will be negative (i.e., non-existing) automatically. Viewed in such a perspective, asking for the labels of potential positive anchor links in the unlabeled set will be rewarding in the active anchor link prediction problem. Various novel anchor link information gain measures are defined in this paper, based on which several constraint active anchor link prediction methods are introduced. Extensive experiments have been done on real-world social network datasets to compare the performance of these methods with state-of-art anchor link prediction methods. The experimental results show that the proposed Mean-entropy-based Constrained Active Learning (MC) method can outperform other methods with significant advantages. View Full-Text
Keywords: multiple heterogeneous social networks; anchor link prediction; Constrained Active Learning multiple heterogeneous social networks; anchor link prediction; Constrained Active Learning

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Zhu, J.; Zhang, J.; Wu, Q.; Jia, Y.; Zhou, B.; Wei, X.; Yu, P.S. Constrained Active Learning for Anchor Link Prediction Across Multiple Heterogeneous Social Networks. Sensors 2017, 17, 1786.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top