4.2 Article

Markov network based ontology matching

Journal

JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Volume 78, Issue 1, Pages 105-118

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcss.2011.02.014

Keywords

Ontology matching; Probabilistic reasoning; Markov networks

Funding

  1. IMG4 consortium of the Israel Ministry of Trade and Industry
  2. Lynn and William Frankel Center for Computer Science

Ask authors/readers for more resources

Ontology matching is a vital step whenever there is a need to integrate and reason about overlapping domains of knowledge. Systems that automate this task are of a great need. iMatch is a probabilistic scheme for ontology matching based on Markov networks, which has several advantages over other probabilistic schemes. First, it handles the high computational complexity by doing approximate reasoning, rather then by ad-hoc pruning. Second, the probabilities that it uses are learned from matched data. Finally, iMatch naturally supports interactive semi-automatic matches. Experiments using the standard benchmark tests that compare our approach with the most promising existing systems show that iMatch is one of the top performers. (C) 2011 Published by Elsevier Inc.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Artificial Intelligence

Repeated-task Canadian Traveler Problem

Zahy Bnaya, Ariel Felner, Dror Fried, Olga Maksin, Solomon Eyal Shimony

AI COMMUNICATIONS (2015)

Article Computer Science, Artificial Intelligence

Some Properties of Batch Value of Information in the Selection Problem

Shahaf S. Shperberg, Solomon Eyal Shimony

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (2017)

Article Computer Science, Artificial Intelligence

Rational deployment of multiple heuristics in optimal state-space search

Erez Karpas, Oded Betzalel, Solomon Eyal Shimony, David Tolpin, Ariel Felner

ARTIFICIAL INTELLIGENCE (2018)

Article Computer Science, Artificial Intelligence

Approximate belief updating in max-2-connected Bayes networks is NP-hard

Erez Karpas, Solomon Eyal Shimony, Amos Beimel

ARTIFICIAL INTELLIGENCE (2009)

Article Mathematics, Applied

Optimal ordering of independent tests with precedence constraints

D. Berend, R. Brafman, S. Cohen, S. E. Shimony, S. Zucker

DISCRETE APPLIED MATHEMATICS (2014)

Article Automation & Control Systems

Semimyopic Measurement Selection for Optimization Under Uncertainty

David Tolpin, Solomon Eyal Shimony

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS (2012)

Article Computer Science, Artificial Intelligence

Generic Preferences over Subsets of Structured Objects

Maxim Binshtok, Ronen I. Brafman, Carmel Domshlak, Solomon E. Shimony

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (2009)

Article Computer Science, Theory & Methods

Complexity of Canadian traveler problem variants

Dror Fried, Solomon Eyal Shimony, Amit Benbassat, Cenny Wenner

THEORETICAL COMPUTER SCIENCE (2013)

Article Mathematics, Applied

Optimal ordering of statistically dependent tests

Daniel Berend, Ronen Brafman, Solomon E. Shimony, Shira Zucker, Shimon Cohen

DISCRETE APPLIED MATHEMATICS (2017)

Proceedings Paper Computer Science, Artificial Intelligence

Optimal Ordering of Tests with Extreme Dependencies

Daniel Berend, Shimon Cohen, Solomon E. Shimony, Shira Zucker

MODELLING, COMPUTATION AND OPTIMIZATION IN INFORMATION SYSTEMS AND MANAGEMENT SCIENCES - MCO 2015, PT 1 (2015)

Proceedings Paper Computer Science, Artificial Intelligence

Estimating the Probability of Meeting a Deadline in Hierarchical Plans

Liat Cohen, Solomon Eyal Shimony, Gera Weiss

PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI) (2015)

Proceedings Paper Computer Science, Artificial Intelligence

Rational Deployment of Multiple Heuristics in IDA

David Tolpin, Oded Betzalel, Ariel Felner, Solomon Eyal Shimony

21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014) (2014)

Proceedings Paper Computer Science, Artificial Intelligence

Canadian Traveler Problem with Remote Sensing

Zahy Bnaya, Ariel Felner, Solomon Eyal Shimony

21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS (2009)

Article Computer Science, Artificial Intelligence

Rational value of information estimation for measurement selection

David Tolpin, Solomon Eyal Shimony

INTELLIGENT DECISION TECHNOLOGIES-NETHERLANDS (2012)

Article Computer Science, Hardware & Architecture

Solving problems on generalized convex graphs via mim-width

Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniel Paulusma

Summary: This article discusses the convexity and mim-width of bipartite graphs, and it proves that for certain families of graphs 7-t, the 7-t-convex graphs can be solved in polynomial time for NP-complete problems. It also explores the bounded and unbounded mim-width of 7-t-convex graphs for different sets 7-t.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Performance modeling and analysis for randomly walking mobile users with Markov chains

Keqin Li

Summary: In this paper, we propose a computation offloading strategy to satisfy all UEs served by an MEC and develop an efficient method to find such a strategy. By using Markov chains to characterize UE mobility and calculating the joint probability distribution of UE locations, we can obtain the average response time of UEs and predict the overall average response time of tasks. Additionally, we solve the power constrained MEC speed setting problem.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Correction Computer Science, Hardware & Architecture

Prediction, learning, uniform convergence, and scale-sensitive dimensions (vol 56, pg 174, 1998)

Peter L. Bartlett, Philip M. Long

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Fast and succinct population protocols for Presburger arithmetic

Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza

Summary: This paper presents a construction method that produces population protocols with a small number of states, while achieving near-optimal expected number of interactions, for deciding Presburger predicates.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Orienting undirected phylogenetic networks

Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple

Summary: This paper investigates the relationship between undirected and directed phylogenetic networks, and provides corresponding algorithms. The study reveals that the directed phylogenetic network is unique under specific conditions. Additionally, an algorithm for directing undirected binary networks is described, applicable to certain classes of directed phylogenetic networks.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs

Francesco Betti Sorbelli, Alfredo Navarra, Lorenzo Palazzetti, Cristina M. Pinotti, Giuseppe Prencipe

Summary: This study discusses the deployment of IoT sensors in an area that needs to be monitored. Drones are used to collect data from the sensors, but they have energy and storage constraints. To maximize the overall reward from the collected data and ensure compliance with energy and storage limits, an optimization problem called Multiple-drone Data-collection Maximization Problem (MDMP) is proposed and solved using an Integer Linear Programming algorithm.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

On the complexity of the storyplan problem

Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nollenburg, Antonios Symvonis

Summary: In this study, we investigate the problem of representing a graph as a storyplan, which is a model for dynamic graph visualization. We prove the NP-completeness of this problem and propose two parameterized algorithms as solutions. We also demonstrate that partial 3-trees always admit a storyplan and can be computed in linear time. Additionally, we show that even if the vertex appearance order is given, the problem of choosing how to draw the frames remains NP-complete.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Perpetual maintenance of machines with different urgency requirements

Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik

Summary: This passage describes the Bamboo Garden Trimming Problem and presents approximation algorithms for both Discrete BGT and Continuous BGT.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)