A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas作者机构：Department of Informatics Systems and Communication University of Milano-Bicocca Milan 20126 Italy Department of Human and Social Sciences University of Bergamo Bergamo 24129 Italy
出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)
年 卷 期：2015年第30卷第1期
页 面：214-224页
核心收录：
学科分类：08[工学] 080203[工学-机械设计及理论] 0802[工学-机械工程] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：SPAC3 (Smart services of the new Public Administration for the Citizen-Centricity in the Cloud) co-financed by the Lombardy region partially supported by the Italian Project PON01 00861 SMART (Services and Meta-services for smART eGovernment) and by the Project
主 题：conceptual schema schema integration clustering
摘 要：When tens and even hundreds of schemas are involved in the integration process, criteria are needed for choosing clusters of schemas to be integrated, so as to deal with the integration problem through an efficient iterative process. Schemas in clusters should be chosen according to cohesion and coupling criteria that are based on similarities and dissimilarities among schemas. In this paper, we propose an algorithm for a novel variant of the correlation clustering approach that addresses the problem of assisting a designer in integrating a large number of conceptual schemas. The novel variant introduces upper and lower bounds to the number of schemas in each cluster, in order to avoid too complex and too simple integration contexts respectively. We give a heuristic for solving the problem, being an NP hard combinatorial problem. An experimental activity demonstrates an appreciable increment in the effectiveness of the schema integration process when clusters are computed by means of the proposed algorithm w.r.t, the ones manually defined by an expert.
维普期刊数据库