Open Access System for Information Sharing

Login Library

 

Article
Cited 9 time in webofscience Cited 13 time in scopus
Metadata Downloads

Heuristics for automated knowledge source integration and service composition SCIE SCOPUS

Title
Heuristics for automated knowledge source integration and service composition
Authors
Bless, PNKlabjan, DChang, SY
Date Issued
2008-04
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Abstract
The NP-hard component set identification problem is a combinatorial problem arising in the context of knowledge discovery, information integration, and knowledge source/service composition. Considering a granular knowledge domain consisting of a large number of individual bits and pieces of domain knowledge (properties) and a large number of knowledge sources and services that provide mappings between sets of properties, the objective of the component set identification problem is to select a minimum cost combination of knowledge sources that can provide a joint mapping from a given set of initially available properties (initial knowledge) to a set of initially unknown proper-ties (target knowledge). We provide a general framework for heuristics and consider construction heuristics that are followed by local improvement heuristics. Computational results are reported on randomly generated problem instances. (C) 2006 Published by Elsevier Ltd.
Keywords
STEINER TREE PROBLEM; VERTEX COVER PROBLEM; LOCAL SEARCH; NEIGHBORHOOD SEARCH; ALGORITHM; GRAPHS
URI
https://oasis.postech.ac.kr/handle/2014.oak/23071
DOI
10.1016/J.COR.2006.08.012
ISSN
0305-0548
Article Type
Article
Citation
COMPUTERS & OPERATIONS RESEARCH, vol. 35, no. 4, page. 1292 - 1314, 2008-04
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

장수영CHANG, SOO YOUNG
Dept. of Industrial & Management Eng.
Read more

Views & Downloads

Browse