Heuristics for automated knowledge source integration and service composition

Patrick N. Bless*, Diego Klabjan, Soo Y. Chang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)1292-1314
Number of pages23
JournalComputers and Operations Research
Volume35
Issue number4
DOIs
StatePublished - Apr 2008

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Heuristics for automated knowledge source integration and service composition'. Together they form a unique fingerprint.

Cite this