Feasible uncertain reasoning for multi agent ontology mapping

Nagy, Miklos; Vargas-Vera, Maria and Motta, Enrico (2008). Feasible uncertain reasoning for multi agent ontology mapping. In: IADIS International Conference Informatics 2008, 22-27 Jul 2008, Amsterdam, The Netherlands.

URL: http://iadisportal.org/digital-library

Abstract

One of the main disadvantages of using Dempster-Shafer theory for uncertain reasoning is the computational complexity of the belief combination. Large number of variables can easily make the applicability unfeasible due to the exponential growth of the problem space. Semantic Web applications like ontology mapping usually exploits different kind of background knowledge in order to augment the available information which increases the number of variables considerably in the reasoning process. Therefore optimalisation is necessary in order to provide a feasible uncertain reasoning for ontology mapping with large number of variables. In this paper we introduce a novel genetic algorithm solution which is based on distributed junction tree optimalisation for a multi agent system.

Viewing alternatives

Item Actions

Export

You can export this page using these formats

About

• Item ORO ID
• 23493
• Item Type
• Conference or Workshop Item
• Extra Information
• IADIS International Conference Informatics 2008
  Editors: Hans Weghorn and Ajith P. Abraham
  ISBN: 978-972-8924-62-1
• Keywords
• uncertain reasoning; multi-agent systems; semantic web; genetic algorithm
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
  Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
• Research Group
• Centre for Research in Computing (CRC)
• Copyright Holders
• © 2008 IADIS
• Related URLs
• • http://www.iadis.net/dl/Search_list_open...(Other)
• Depositing User
• Kay Dave