By Topic

Self Organization in Coordination Systems Using a WordNet-Based Ontology

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Danilo Pianini ; Alma Mater Studiorum, Univ. di Bologna, Bologna, Italy ; Sascia Virruso ; Ronaldo Menezes ; Andrea Omicini
more authors

In today's data-intensive world, the need for data organization has increased dramatically. Distributed systems are dealing with unheard amounts of data arising primarily from the popularization of pervasive computing applications and the so-called “data-in-the-cloud” paradigm. Naturally, agent-coordination systems are affected by this data-increase phenomenon as they are often used as the basis for pervasive-computing frameworks and cloud-computing systems. There have been a few works on coordination system to include data self-organization (e.g. Swarm Linda) however they generally organize their data based on naive approaches where items are either completely similar or dissimilar (1|0 approach for matching of data). Although this approach is useful, in general-purpose systems where the diversity of data items is large, data items will rarely be considered as plainly similar, leading to a situation where data does not self-organize well. In this paper we move towards a general-purpose approach to organization based on an ontology-defined concept relationship in WordNet. In our approach, data items are seen as concepts that have relation to other concepts: tuples are driven towards one-another at rates that are proportional to the strength of tuple relationship. We demonstrate that this approach leads to a good mechanism to self-organize data in data-intensive environments.

Published in:

2010 Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems

Date of Conference:

Sept. 27 2010-Oct. 1 2010