Structure-aware Mashup service Clustering for cloud-based Internet of Things using genetic algorithm based clustering algorithm

被引:42
作者
Pan, Weifeng [1 ]
Chai, Chunlai [1 ]
机构
[1] Zhejiang Gongshang Univ, Sch Comp Sci & Informat Engn, Hangzhou 310018, Zhejiang, Peoples R China
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2018年 / 87卷
基金
中国国家自然科学基金;
关键词
Service clustering; Mashup; Genetic algorithm; Structural similarity; Semantic similarity; WEB SERVICES; METRICS;
D O I
10.1016/j.future.2018.04.052
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An increasing number of physical objects connected to the Internet makes it possible for smart things to access all kinds of cloud services. Mashup technology has been an effective way to the rapid IoT (Internet of Things) application development. However, the number of Mashup services (IoT applications) being so large makes how to discover the desired loT applications accurately and efficiently become a problem. Service clustering technology can facilitate service discovery effectively, and many different approaches have been proposed. However, many of them only use semantic similarities to guide clustering operations and need the configuration of the number of clusters. Structural similarities are orthogonal to semantic similarities. But they have never been used in service clustering approaches. In this paper, we propose a novel Mashup service clustering approach based on a structural similarity and a genetic algorithm based clustering algorithm. First, it applies a two-mode graph to describe Mashups, Web APIs, and their relations formally. Second, it applies the SimRank algorithm to quantify the structural similarity between every pair of Mashup services. Finally, it introduces a genetic algorithm based clustering algorithm to organize Mashup services into clusters effectively and determines the number of clusters automatically. Empirical results on a real-world Mashup services data set collected from ProgrammableWeb demonstrate that our approach can cluster Mashup services efficiently without any constraints on the number of clusters, and its performance is better than other Mashup service clustering approaches based on semantic metrics. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:267 / 277
页数:11
相关论文
共 36 条
[1]  
ABREU FBE, 1994, J SYST SOFTWARE, V26, P87, DOI 10.1016/0164-1212(94)90099-X
[2]  
[Anonymous], 1999, COMPLEXITY APPROXIMA, DOI DOI 10.1007/978-3-642-58412-1
[3]  
[Anonymous], 1999, Genetic Algorithms + Data Structures = Evolution Programs
[4]  
[Anonymous], 2001, An Introduction to Genetic Algorithms. Complex Adaptive Systems
[5]  
Aznag Mustapha, 2013, Service-Oriented and Cloud Computing. Second European Conference (ESOCC 2013). Proceedings: LNCS 8135, P19, DOI 10.1007/978-3-642-40651-5_3
[6]   Ontology-based methodology for e-service discovery [J].
Bianchini, D ;
De Antonellis, V ;
Pernici, B ;
Plebani, P .
INFORMATION SYSTEMS, 2006, 31 (4-5) :361-380
[7]   Mashup Service Clustering Based on an Integration of Service Content and Network via Exploiting a Two-Level Topic Model [J].
Cao, Buqing ;
Liu, Xiaoqing ;
Li, Bing ;
Liu, Jianxun ;
Tang, Mingdong ;
Zhang, Tingting ;
Shi, Min .
2016 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS), 2016, :212-219
[8]  
Cassar G., 2010, P SMRR, P4
[9]  
Chen L, 2013, LECT NOTES COMPUT SC, V8274, P162, DOI 10.1007/978-3-642-45005-1_12
[10]  
Chen L, 2011, LECT NOTES COMPUT SC, V7084, P204, DOI 10.1007/978-3-642-25535-9_14