Selected topics in Ant 2002 By Hanh Nguyen. Selected topics in Ant 2002 Homogeneous Ants for Web Document Similarity Modeling and Categorization Ant Colonies.

Slides:



Advertisements
Similar presentations
Computational Intelligence Winter Term 2011/12 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Advertisements

PARTITIONAL CLUSTERING
Incremental Clustering Previous clustering algorithms worked in “batch” mode: processed all points at essentially the same time. Some IR applications cluster.
G. Folino, A. Forestiero, G. Spezzano Swarming Agents for Discovering Clusters in Spatial Data Second International.
I501 – Introduction to Informatics Info rm atics and computing Lecture 11 – Fall 2009 From.
Artificial Bee Colony Algorithm
The Antnet Routing Algorithm - A Modified Version Firat Tekiner, Z. Ghassemlooy Optical Communications Research Group, The University of Northumbria, Newcastle.
Relational Learning with Gaussian Processes By Wei Chu, Vikas Sindhwani, Zoubin Ghahramani, S.Sathiya Keerthi (Columbia, Chicago, Cambridge, Yahoo!) Presented.
WebMiningResearch ASurvey Web Mining Research: A Survey Raymond Kosala and Hendrik Blockeel ACM SIGKDD, July 2000 Presented by Shan Huang, 4/24/2007.
Content-based Image Retrieval CE 264 Xiaoguang Feng March 14, 2002 Based on: J. Huang. Color-Spatial Image Indexing and Applications. Ph.D thesis, Cornell.
Machine Vision and Dig. Image Analysis 1 Prof. Heikki Kälviäinen C50A6100 Lectures 12: Object Recognition Professor Heikki Kälviäinen Machine Vision and.
WebMiningResearch ASurvey Web Mining Research: A Survey By Raymond Kosala & Hendrik Blockeel, Katholieke Universitat Leuven, July 2000 Presented 4/18/2002.
WebMiningResearchASurvey Web Mining Research: A Survey Raymond Kosala and Hendrik Blockeel ACM SIGKDD, July 2000 Presented by Shan Huang, 4/24/2007 Revised.
ApMl (All Purpose Machine Learning) Toolkit David W. Miller and Helen Howell Semantic Web Final Project Spring 2002 Department of Computer Science University.
Formation of an ant cemetery: swarm intelligence or statistical accident 報告者 : 王敬育.
Towards Adaptive, Resilient and Self-Organizing Peer-to-Peer System A.Montresor, H.Meling Based on[1][2]
Extracting Test Cases by Using Data Mining; Reducing the Cost of Testing Andrea Ciocca COMP 587.
1 Introduction to Computational Natural Language Learning Linguistics (Under: Topics in Natural Language Processing ) Computer Science (Under:
Introduction to Data Mining Engineering Group in ACL.
Ant Colony Optimization: an introduction
1 IE 607 Heuristic Optimization Ant Colony Optimization.
L/O/G/O Ant Colony Optimization M1 : Cecile Chu.
SWARM INTELLIGENCE IN DATA MINING Written by Crina Grosan, Ajith Abraham & Monica Chis Presented by Megan Rose Bryant.
Ants in the Pants! An Overview Real world insect examples Theory of Swarm Intelligence From Insects to Realistic A.I. Algorithms Examples of AI applications.
The Problem Finding information about people in huge text collections or on-line repositories on the Web is a common activity Person names, however, are.
An Effective Fuzzy Clustering Algorithm for Web Document Classification: A Case Study in Cultural Content Mining Nils Murrugarra.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Unsupervised pattern recognition models for mixed feature-type.
Multi-Agent Systems (MAS) Tom Holvoet Dept. Computer Science, KULeuven Research group on Distributed Systems and Computer Networks.
© Yilmaz “Agent-Directed Simulation – Course Outline” 1 Course Outline Dr. Levent Yilmaz M&SNet: Auburn M&S Laboratory Computer Science &
CS 346U Exploring Complexity in Science and Technology Instructor: Melanie Mitchell Textbook: M. Mitchell, Complexity: A Guided Tour (Oxford University.
Swarm Computing Applications in Software Engineering By Chaitanya.
Xiaoying Gao Computer Science Victoria University of Wellington Intelligent Agents COMP 423.
FRE 2672 TFG Self-Organization - 01/07/2004 Engineering Self-Organization in MAS Complex adaptive systems using situated MAS Salima Hassas LIRIS-CNRS Lyon.
Web Services and Application of Multi-Agent Paradigm for DL Yueyu Fu & Javed Mostafa School of Library and Information Science Indiana University, Bloomington.
Presenter: Bilal Gonen Simulation of Spatial Self-Organization in a Stepping Stone Environment.
Particle Swarm Optimization Speaker: Lin, Wei-Kai
Search Engine Marketing SEM = Search Engine Marketing SEO = Search Engine Optimization optimizing (altering/changing) your page in order to get a higher.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 New Unsupervised Clustering Algorithm for Large Datasets.
2005/12/021 Fast Image Retrieval Using Low Frequency DCT Coefficients Dept. of Computer Engineering Tatung University Presenter: Yo-Ping Huang ( 黃有評 )
Intelligent Database Systems Lab N.Y.U.S.T. I. M. Externally growing self-organizing maps and its application to database visualization and exploration.
Emergent Behavior in Biological Swarms Stephen Motter.
Topic Models Presented by Iulian Pruteanu Friday, July 28 th, 2006.
Technical Seminar Presentation Presented By:- Prasanna Kumar Misra(EI ) Under the guidance of Ms. Suchilipi Nepak Presented By Prasanna.
Optimized Nearest Neighbor Methods Cam Weighted Distance vs. Statistical Confidence Robert R. Puckett.
1 Swarm Intelligence on Graphs (Consensus Protocol) Advanced Computer Networks: Part 1.
IEEE CIM IEEE Computational Intelligence Magazine Editor-in-Chief: Hisao Ishibuchi ( ) June 18, 2014 Main Topic of Each Issue Feb 2014:Natural.
Outline Problem Background Theory Extending to NLP and Experiment
AntNet: A nature inspired routing algorithm
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Adaptive FIR Neural Model for Centroid Learning in Self-Organizing.
Comparative Reproduction Schemes for Evolving Gathering Collectives A.E. Eiben, G.S. Nitschke, M.C. Schut Computational Intelligence Group Department of.
Artificial Intelligence Techniques Internet Applications 4.
Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,
UNIVERSITY UTARA MALAYSIA COLLEGE OF ARTS & SCIENCES.
Cluster Analysis What is Cluster Analysis? Types of Data in Cluster Analysis A Categorization of Major Clustering Methods Partitioning Methods.
Particle Swarm Optimization (PSO) Algorithm. Swarming – The Definition aggregation of similar animals, generally cruising in the same directionaggregation.
Self-organizing algorithms Márk Jelasity. Decide Object control measure control loop Centralized Mindset: Control Loop ● problem solving, knowledge (GOFAI)
Cohesive Subgraph Computation over Large Graphs
Information Storage and Retrieval Fall Lecture 1: Introduction and History.
Lecture 1: Introduction and the Boolean Model Information Retrieval
Web Services and Application of Multi-Agent Paradigm for DL
Ant colony segmentation approach for volume delineation in PET.
Content-based Image Retrieval
Topic 3: Cluster Analysis
DISTRIBUTED CLUSTERING OF UBIQUITOUS DATA STREAMS
Self-Organization and Templates in Swarm Computing
Computational Intelligence
Prepared by: Mahmoud Rafeek Al-Farra
Nest Building and Self-Assembling
Web Mining Research: A Survey
Computational Intelligence
Presentation transcript:

Selected topics in Ant 2002 By Hanh Nguyen

Selected topics in Ant 2002 Homogeneous Ants for Web Document Similarity Modeling and Categorization Ant Colonies as Logistic Processes Optimizers Anti-pheromone as a Tool for Better Exploration of Search Space.

Homogeneous Ants for Web Document Similarity Modeling and Categorization

Outline Abstract Introduction Ant Colony Models for Data Clustering Homogeneous Multi-agent System for Document Clustering Experimental Result Concluding Remarks & Future Directions References

Abstract Apply the self-organizing and autonomous behavior of social insects for organizing of web document.

Introduction Why? The size of the internet has doubling its size every year. Estimated 2.1 billion as of July 2001 Organizing and categorizing document is not scalable to the growth of internet. Document clustering? Is the operation of grouping similar document to classes that can be used to obtain an analysis of the content. Ant clustering algorithm categorize web document to different interest domain.

Ant Colony Models for Data Clustering Data clustering? is the task that seek to identify groups of similar objects based on the value of their attributes. Messor sancta ants collect and pile dead corpses to form “cemeteries” (Deneubourg et al. ) f: fraction of items in the neighborhood of the agent k 1, k 2 : threshold constants

Ant Colony Models for Data Clustering The model later extend by Lume & Faieta to include distance function d, between data objects. c is a cell, N(c) is the number of adjacent cells of c, alpha is constant

Homogeneous Multi-agent System for Document Clustering Main components: colony of agents, feature vector of web document, 2D grid. Rule: agent move one step at a time to an adjacent cell. Only a single agent and/or a single item are allowed to occupy a cell at a time. Picking up or dropping item based on P p & P d N(c) = 8,o i is the item at cell i, g(o i ) determine the similarity of o i and other item of o j, where j E N(c) Density:

Homogeneous Multi-agent System for Document Clustering r is the number of common term in doc i and doc j m,n is the total number of term in doc i and doc j, respectively. F is the frequency Similarity measure

Homogeneous Multi-agent System for Document Clustering

Experimental Results Experimental data: 84 web pages from 4 different categories: Business, Computer, Health and Science. These web page have 17,776 distinct words. Use 30x30 toroidal grid 15 agents. t max is 300,000. k 1 and k 2 in [0.01, 0.2] increment of 0.05 for each run.

Experimental Results t = 0

Experimental Results t = 50,000

Experimental Results t = 200,000

Experimental Results t = 300,000

Experimental Result Table

Concluding Remarks and Future Directions Initial study on ant-based in clustering web documents. The experiments are able to product a near homogeneous clusters. Future work: a larger perceivable time dependent neighborhood for agent. Formulation of a stopping criterion based on homogeneity and spatial distribution of clusters. Introduction of pheromone traces.

References 1. Lawrence, S., Giles, C.L.: Accessibility of Information on the Web. Nature, 400. (1999) 2. Cyveillance: Sizing the Internet. A Cyveillance Study (2000) 3. Yahoo! Web Directory: 4. Baeza-Yates, R., Ribeiro-Yates, B.: Modern Information Retrieval. ACM, NY (1999) 5. Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, NY (1973) 6. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York, NY (1999) 7. Deneubourg, J. L., Goss, S., Franks, N.R., Sendova-Franks, A., Detrain, C., Chretien, L.: The Dynamics of Collective Sorting: Robot-like Ants and Ant-like Robots. Proc. Int. Conf. Sim. of Adap. Behavior: From Animals to Animats. MIT, MA (1990)

The End Question? Comment?