Welcome to the InfoSci Platform
Multi-Objective Optimization-Based Networked Multi-Label Active Learning

Multi-Objective Optimization-Based Networked Multi-Label Active Learning

Lei Li, Yuqi Chu, Guanfeng Liu, Xindong Wu
Copyright: © 2019 |Volume: 30 |Issue: 2 |Pages: 26
ISSN: 1063-8016|EISSN: 1533-8010|EISBN13: 9781522563792|DOI: 10.4018/JDM.2019040101
Cite Article Cite Article

MLA

Li, Lei, et al. "Multi-Objective Optimization-Based Networked Multi-Label Active Learning." JDM vol.30, no.2 2019: pp.1-26. http://doi.org/10.4018/JDM.2019040101

APA

Li, L., Chu, Y., Liu, G., & Wu, X. (2019). Multi-Objective Optimization-Based Networked Multi-Label Active Learning. Journal of Database Management (JDM), 30(2), 1-26. http://doi.org/10.4018/JDM.2019040101

Chicago

Li, Lei, et al. "Multi-Objective Optimization-Based Networked Multi-Label Active Learning," Journal of Database Management (JDM) 30, no.2: 1-26. http://doi.org/10.4018/JDM.2019040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Along with the fast development of network applications, network research has attracted more and more attention, where one of the most important research directions is networked multi-label classification. Based on it, unknown labels of nodes can be inferred by known labels of nodes in the neighborhood. As both the scale and complexity of networks are increasing, the problems of previously neglected system overhead are turning more and more seriously. In this article, a novel multi-objective optimization-based networked multi-label seed node selection algorithm (named as MOSS) is proposed to improve both the prediction accuracy for unknown labels of nodes from labels of seed nodes during classification and the system overhead for mining the labels of seed nodes with third parties before classification. Compared with other algorithms on several real networked data sets, MOSS algorithm not only greatly reduces the system overhead before classification but also improves the prediction accuracy during classification.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.