G. Folino, A. Forestiero, G. Spezzano Swarming Agents for Discovering Clusters in Spatial Data Second International.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Swarm-Based Traffic Simulation
Clustering.
Particle Swarm Optimization
Data Mining Cluster Analysis: Advanced Concepts and Algorithms
Security Issues in Ant Routing Weilin Zhong. Outline Swarm Intelligence AntNet Routing Algorithm Security Issues in AntNet Possible Solutions.
Flocking Behaviors Presented by Jyh-Ming Lien. Flocking System What is flocking system? – A system that simulates behaviors of accumulative objects (e.g.
Better Group Behaviors in Complex Environments using Global Roadmaps O. Burchan Bayazit, Jyh-Ming Lien and Nancy M. Amato Presented by Mohammad Irfan Rafiq.
Optimizing Flocking Controllers using Gradient Descent
Swarm algorithms COMP308. Swarming – The Definition aggregation of similar animals, generally cruising in the same direction Termites swarm to build colonies.
PARTICLE SWARM OPTIMISATION (PSO) Perry Brown Alexander Mathews Image:
The Antnet Routing Algorithm - A Modified Version Firat Tekiner, Z. Ghassemlooy Optical Communications Research Group, The University of Northumbria, Newcastle.
Automatic Identification of ROIs (Regions of interest) in fMRI data.
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Data Mining Cluster Analysis: Advanced Concepts and Algorithms Lecture Notes for Chapter 9 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,
Better Group Behaviors in Complex Environments using Global Roadmaps O. Burchan Bayazit, Jyh-Ming Lien and Nancy M. Amato Andreas Edlund.
© University of Minnesota Data Mining CSCI 8980 (Fall 2002) 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance Computing Research Center.
Tal Saiag & Anna Itin May 2013
Ant Colony Optimization: an introduction
Clustering Unsupervised learning Generating “classes”
Distributed Systems 15. Multiagent systems and swarms Simon Razniewski Faculty of Computer Science Free University of Bozen-Bolzano A.Y. 2014/2015.
CHAMELEON : A Hierarchical Clustering Algorithm Using Dynamic Modeling
AntNet: Distributed Stigmetric Control for Communications Networks Gianni Di Caro & Marco Dorigo Journal of Artificial Intelligence Research 1998 Presentation.
SWARM INTELLIGENCE IN DATA MINING Written by Crina Grosan, Ajith Abraham & Monica Chis Presented by Megan Rose Bryant.
1 CE 530 Molecular Simulation Lecture 7 David A. Kofke Department of Chemical Engineering SUNY Buffalo
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 11 Some materials adapted from Prof. Keith E. Gubbins:
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Mean-shift and its application for object tracking
An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.
Swarm Computing Applications in Software Engineering By Chaitanya.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
1 CSE 980: Data Mining Lecture 17: Density-based and Other Clustering Algorithms.
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved Event Driven Programming, The.
Clustering Spatial Data Using Random Walk David Harel and Yehuda Koren KDD 2001.
A Graph-based Friend Recommendation System Using Genetic Algorithm
(Particle Swarm Optimisation)
1 IE 607 Heuristic Optimization Particle Swarm Optimization.
FRE 2672 TFG Self-Organization - 01/07/2004 Engineering Self-Organization in MAS Complex adaptive systems using situated MAS Salima Hassas LIRIS-CNRS Lyon.
Emergent Robustness in Software Systems through Decentralized Adaptation: an Ecologically-Inspired ALife Approach Franck Fleurey, Benoit Baudry, Benoit.
CS654: Digital Image Analysis
Controlling the Behavior of Swarm Systems Zachary Kurtz CMSC 601, 5/4/
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Tetris Agent Optimization Using Harmony Search Algorithm
Technical Seminar Presentation Presented By:- Prasanna Kumar Misra(EI ) Under the guidance of Ms. Suchilipi Nepak Presented By Prasanna.
Data Mining Cluster Analysis: Advanced Concepts and Algorithms Lecture Notes for Chapter 9 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach,
CS 8751 ML & KDDData Clustering1 Clustering Unsupervised learning Generating “classes” Distance/similarity measures Agglomerative methods Divisive methods.
DRILL Answer the following question’s in your notebook: 1.How does ACO differ from PSO? 2.What does positive feedback do in a swarm? 3.What does negative.
Data Mining Cluster Analysis: Advanced Concepts and Algorithms
CS483/683 Multi-Agent Systems Lecture 2: Distributed variants of 2 important AI problems: Search and Constraint Satisfaction 21 January 2010 Instructor:
Biologically Inspired Computation Ant Colony Optimisation.
Particle Swarm Optimization (PSO)
DRILL Answer the following question’s about yesterday’s activity in your notebook: 1.Was the activity an example of ACO or PSO? 2.What was the positive.
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Parameter Reduction for Density-based Clustering on Large Data Sets Elizabeth Wang.
Analysis of FMRI Data: Principles and Practice Robert W Cox, PhD Scientific and Statistical Computing Core National Institute of Mental Health Bethesda,
Clustering Microarray Data based on Density and Shared Nearest Neighbor Measure CATA’06, March 23-25, 2006 Seattle, WA, USA Ranapratap Syamala, Taufik.
What we started with To develop an application that facilitates user to draw interactive graphs (e.g. Flowcharts,class diagrams, UML diagrams etc ). Interactive.
EDGE DETECTION USING EVOLUTIONARY ALGORITHMS. INTRODUCTION What is edge detection? Edge detection refers to the process of identifying and locating sharp.
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Self Organizing Maps: Parametrization of Parton Distribution Functions
A weight-incorporated similarity-based clustering ensemble method based on swarm intelligence Yue Ming NJIT#:
A weight-incorporated similarity-based clustering ensemble method based on swarm intelligence Yue Ming NJIT#:
What Is Good Clustering?
FLOSCAN: An Artificial Life Based Data Mining Algorithm
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Agent-Based Models Hiroki Sayama
SWARM INTELLIGENCE Swarms
Presentation transcript:

G. Folino, A. Forestiero, G. Spezzano Swarming Agents for Discovering Clusters in Spatial Data Second International Symposium on Parallel and Distributed Computing Ljubljana, Slovenia · October 2003

Sommario Introduction Swarm intelligence Flocking algorithm Clustering and spatial datasets Sparrow-SNN Experimental results Conclusions and Future Works

Swarm Intelligence Swarm Intelligence (SI) is the property of a system whereby the collective behaviors of (unsophisticated) agents interacting locally with their environment cause coherent functional global patterns to emerge. A swarm has the following interesting properties: Distributed, without central control Ability to change the environment Stigmergy (indirect communication via interaction with environment) Fault tolerance Adaptivity and self organization Typical examples are ant colonies, flocks of birds, etc..

Flocking algorithm Typical example of emergent collective behavior. No global control Every agent has a limited visibility The collective behavior emerges only by local interation, following these three simple rules: Separation Alignment Cohesion

Flocking algorithm Agents could have an exploratory behavior: Before, agents can search for a goal of particular interest Then, the other flock members will be driven towards the goal in order to explore interesting area more carefully.

Clustering Clustering means to divide all objects in different groups (clusters) so that all members of a cluster are as similar as possible whereas the members of different clusters differ as much as possible from each other. Spatial clustering should identify clusters of different dimensions, size, shape and density (particularly difficult).

Clustering A different density spatial dataset

SNN algorithm (1) SNN is based on the famous Jarvis-Patrick algorithm. identifies the K nearest-neighbors of each object (data point) in the dataset. two objects i and j join the same cluster if: 1) i is one of the K nearest-neighbors of j; 2) j is one of the K nearest-neighbors of i; 3) i and j have at least Kmin of their K-nearest- neighbors in common; where K and Kmin are used-defined parameters. For each pair of points i and j is defined a link with an associate weight. The connectivity of a data point is computed as the sum of the weights associated to the outgoing links.

SNN algorithm (2) For every node (data point) calculate the connectivity; Identify representative points by choosing the point that have high connectivity ( > core_threshold); Identify noise points by choosing the points that have low connectivity ( < noise_threshold) and remove them; Remove all links between points that have weight smaller than a threshold (merge_threshold) Take connected components of points to form clusters, where every point in a cluster is either a representative point or is connected to a representative point.

SPARROW-SNN Sparrow-SNN combine the stochastic search of an adaptive flocking with SNN to discover clusters in spatial data. It uses a variant of the flocking algorithm: Before, agents can search for a goal of particular interest Then, the other flock’s members will be driven towards the goal in order to explore interesting area more carefully. We used Swarm, a software package for multi-agent simulation of complex systems, for the implementation of Sparrow-SNN.

SPARROW-SNN Pseudo-code of the algorithm

SPARROW-SNN N agents are generated randomly in the search space. When an agent falls on a data point not previously explored computes the connectivity. Using connectivity, agents take different colors: conn > core_threshold ->mycolor = red noise_threshold mycolor = green 0 mycolor = yellow conn = 0 ->mycolor = white Agents can indicate a representative point (red), noise (yellow), border point (green), or obstacle (white). Red and white agents will stop signaling to the others the interesting and desert regions.

SPARROW-SNN Yellow and green agents will move following the modified rules of the flock (with repulsion from white agents and attraction towards red agents. Besides, yellow agents move quickly (not interesting zones) whereas green agents move slowly. red agents (placed on a representative point) will run the merge procedure so that it will include, in the final cluster, the representative point discovered together to the points that share with it a significant (greater that Pmin) number of neighbors.

Experimental results (datasets)

Experimental results (clusters found)

Experimental results (random search vs Sparrow–SNN) a) GEORGE b) North-East

Experimental results (scalability)

Conclusions and Future Works Sparrow-SNN is able to discover cluster of arbitrary shape, size and density in spatial data. Performs well approximate clustering. is naturally distributed, fault tolerant and scalable. We are working on implementing a new version of Sparrow using Anthill, a peer-to-peer multi agent system based on JXTA.