We propose a probabilistic latent variable model for unsupervised cluster matching, which is the task of finding correspondences between clusters of objects in different domains. Existing object matching methods find oneto-one matching. The proposed model finds many-tomany matching, and can handle multiple domains with different numbers of objects. The proposed model assumes that there are an i...

The recent growing of the Semantic Web requires the need to cope with highly semantic heterogeneities among available ontologies. Ontology matching techniques aim to tackle this problem by establishing correspondences between ontologies’ elements. An intricate obstacle faces the ontology matching problem is its scalability against large number and large-scale ontologies. To tackle these challen...

data obtained in association with many real-life random experiments from different fields cannot be perfectly/exactly quantified.hspace{.1cm}often the underlying imprecision can be suitably described in terms of fuzzy numbers/values. for these random experiments, the scale of fuzzy numbers/values enables to capture more variability and subjectivity than that of categorical data, and more accura...

In this note we consider a series of lattices that are enumerated by the well-known Catalan numbers. For each of these lattices, we exhibit a matching in a constructive way.

We compute the matching conditions between lattice and continuum 3-D SU(N) Higgs theories, with both adjoint and fundamental scalars, at O(a), except for additive corrections to masses and φ insertions. PACS numbers: 11.15.Ha, 11.15.Kc

Abstract The power graph P ( G ) of a finite group is the undirected simple with vertex set , where two elements are adjacent if one other. In this paper, matching numbers graphs groups investigated. We give upper and lower bounds, conditions for to possess perfect matching. formula number any nilpotent group. addition, using some elementary theory, we show that enhanced $$P_e(G)$$ <mml:math xm...

Reasoning with domains containing continuous numeric change remains an open challenge in planning. In this paper, we discuss how an established temporal planner, CRIKEY3, can be adapted to plan in domains containing linear continuous numeric change. In particular, we discuss how an LP can be used to scheudule action choices, and how the LPRPG heuristic (hitherto for non-temporal planning) can b...

The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...