Distributed resource discovery is an essential step for information retrieval and providing information services. This step is usually used for determining the location of an information/data repository that has relevant information/data. The most fundamental challenge is the potential lack of semantic interoperability among these repositories. In this paper, we proposed an algorithm to enable distributed rescuce discovery. In the proposed method, the distributed repositories achieve pair wise semantic interoperability through the exchange of both examples (either in the form of raw data or through a set of descriptors) and the classifiers (which have been trained on the raw data or the descriptors). For each repository, the local classifier is used to classify the examples sent by the remote repository, and the classifier from the remote repository is used to classify the examples from the local repository. The correspondence of the class labels from two repositories can then be
established by examining the classification results.
By: C.- S. Li, L. D. Bergman, V. Castelli, Y.-C. Chang, M. Hill, J. R. Smith
Published in: RC21926 in 2001
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .