Cross-domain analogies are a powerful method for learning new domains. This paper extends the Domain Transfer via Analogy (DTA) method with the idea of persistent mappings, correspondences between domains that are incrementally built up as a system gains experience with a new domain. We evaluate DTA plus persistent mappings by learning three domains (rotational mechanics, electricity, and heat)...

In this paper, a method for building data dictionaries (DDs) is discussed, which can be used to support query processing in feder-ated systems. In this method, the meda data stored in a DD are organized into three classes: structure mappings, concept mappings and data mappings. Based on them, a query submitted to a federated system can be decomposed and translated, and the local results can be ...

Automatically discovering semantic relations between ontologies is an important task with respect to overcoming semantic heterogeneity on the semantic web. Ontology matching systems, however, often produce erroneous mappings. In this paper we propose a method for optimizing precision and recall of existing matching systems. The principle of this method is based on the idea that it is possible t...

Executable schema mappings between XML schemas are essential to support numerous data management tasks such as data exchange, data integration and schema evolution. The novelty of this paper consists in a method for automatic generation of automappings (automorphisms) from key constraints and value dependencies over XML schemas, and designing algebraic operations on mappings and schemas represe...

We present a method to simultaneously learn a mixture of mappings and large margin hyperplane classifier. This method learns useful mappings of the training data to improve classification accuracy. We first present a simple iterative algorithm that finds a greedy local solution and then derive a semidefinite relaxation to find an approximate global solution. This relaxation leads to the matrix ...

We present a method for learning syntaxsemantics mappings for verbs from unannotated corpora. We learn linkings, i.e., mappings from the syntactic arguments and adjuncts of a verb to its semantic roles. By learning such linkings, we do not need to model individual semantic roles independently of one another, and we can exploit the relation between different mappings for the same verb, or betwee...

Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between ontologies have been developed. Most of these systems rely on general heuristics for finding mappings, hence are bound to fail in many situations. Consequently, automatically generated mappings often contain logical inconsistencies...

The paper establishes the existence of homeomorphisms between two planar domains that minimize the Dirichlet energy. Among all homeomorphisms f : Ω onto −→ Ω∗ between bounded doubly connected domains such that ModΩ 6 ModΩ∗ there exists, unique up to conformal authomorphisms of Ω, an energy-minimal diffeomorphism. No boundary conditions are imposed on f . Although any energyminimal diffeomorphis...