Cloud Service Community Detection for Real-World Service Networks Based on Parallel Graph Computing

Heterogeneous information networks (e.g. cloud service relation networks and social networks), where multiple-typed objects are interconnected, can be structured by big graphs. A major challenge for clustering in such big graphs is the complex structures that can generate different results, carrying...

Full description

Bibliographic Details
Main Authors: Yu Lei, Philip S. Yu
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8689099/
id doaj-3d9bdf4c38c74356b83c836b34fc7a46
record_format Article
spelling doaj-3d9bdf4c38c74356b83c836b34fc7a462021-04-05T17:12:28ZengIEEEIEEE Access2169-35362019-01-01713135513136210.1109/ACCESS.2019.29108048689099Cloud Service Community Detection for Real-World Service Networks Based on Parallel Graph ComputingYu Lei0https://orcid.org/0000-0002-8679-6569Philip S. Yu1Department of Computer Science, Inner Mongolia University, Hohhot, ChinaDepartment of Computer Science, University of Illinois at Chicago, Chicago, IL, USAHeterogeneous information networks (e.g. cloud service relation networks and social networks), where multiple-typed objects are interconnected, can be structured by big graphs. A major challenge for clustering in such big graphs is the complex structures that can generate different results, carrying many diverse semantic meanings. In order to generate desired clustering, we propose a parallel clustering method for the heterogeneous information net-works on an efficient graph computation system (Spark). We use a multi-relation and path-based method to create similarity matrices, and implement our method based on graph computation model. It is inefficient to directly use existing data-parallel tools (e.g. Hadoop) for graph computation tasks, and some graph-parallel tools (e.g. Pregel) do not effectively address the challenges of graph construction and transformation. Therefore, we implemented our parallel method on the Spark system. The experiment results of clustering show our method is more accuracy.https://ieeexplore.ieee.org/document/8689099/Heterogeneous information networksclusterparallel computingservice mashupcommunity detection
collection DOAJ
language English
format Article
sources DOAJ
author Yu Lei
Philip S. Yu
spellingShingle Yu Lei
Philip S. Yu
Cloud Service Community Detection for Real-World Service Networks Based on Parallel Graph Computing
IEEE Access
Heterogeneous information networks
cluster
parallel computing
service mashup
community detection
author_facet Yu Lei
Philip S. Yu
author_sort Yu Lei
title Cloud Service Community Detection for Real-World Service Networks Based on Parallel Graph Computing
title_short Cloud Service Community Detection for Real-World Service Networks Based on Parallel Graph Computing
title_full Cloud Service Community Detection for Real-World Service Networks Based on Parallel Graph Computing
title_fullStr Cloud Service Community Detection for Real-World Service Networks Based on Parallel Graph Computing
title_full_unstemmed Cloud Service Community Detection for Real-World Service Networks Based on Parallel Graph Computing
title_sort cloud service community detection for real-world service networks based on parallel graph computing
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2019-01-01
description Heterogeneous information networks (e.g. cloud service relation networks and social networks), where multiple-typed objects are interconnected, can be structured by big graphs. A major challenge for clustering in such big graphs is the complex structures that can generate different results, carrying many diverse semantic meanings. In order to generate desired clustering, we propose a parallel clustering method for the heterogeneous information net-works on an efficient graph computation system (Spark). We use a multi-relation and path-based method to create similarity matrices, and implement our method based on graph computation model. It is inefficient to directly use existing data-parallel tools (e.g. Hadoop) for graph computation tasks, and some graph-parallel tools (e.g. Pregel) do not effectively address the challenges of graph construction and transformation. Therefore, we implemented our parallel method on the Spark system. The experiment results of clustering show our method is more accuracy.
topic Heterogeneous information networks
cluster
parallel computing
service mashup
community detection
url https://ieeexplore.ieee.org/document/8689099/
work_keys_str_mv AT yulei cloudservicecommunitydetectionforrealworldservicenetworksbasedonparallelgraphcomputing
AT philipsyu cloudservicecommunitydetectionforrealworldservicenetworksbasedonparallelgraphcomputing
_version_ 1721540002987376640