Big Network Analytics Based on Nonconvex Optimization

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

Abstract

The scientific problems that Big Data faces may be network scientific problems. Network analytics contributes a great deal to networked Big Data processing. Many network issues can be modeled as nonconvex optimization problems and consequently they can be addressed by optimization techniques. In the pipeline of nonconvex optimization techniques, evolutionary computation gives an outlet to handle these problems efficiently. Because, network community discovery is a critical research agenda of network analytics, in this chapter we focus on the evolutionary computation based nonconvex optimization for network community discovery. The single and multiple objective optimization models for the community discovery problem are thoroughly investigated. Several experimental studies are shown to demonstrate the effectiveness of optimization based approach for big network community analytics.

Cite

CITATION STYLE

APA

Gong, M., Cai, Q., Ma, L., & Jiao, L. (2016). Big Network Analytics Based on Nonconvex Optimization. Studies in Big Data, 18, 345–373. https://doi.org/10.1007/978-3-319-30265-2_15

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