Heuristics for automated knowledge source integration and service composition
Lists
Only you see this
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 properties (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.
BibTeX
@article{bless2008heuristics,
author = {Patrick N. Bless and Diego Klabjan and Soo Y. Chang},
title = {{Heuristics for automated knowledge source integration and service composition}},
journal = {Comput. Oper. Res.},
year = {2008},
doi = {10.1016/j.cor.2006.08.012},
}Loading related content...