DOCSLIB.ORG

Agent Intelligence Through Data Mining

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Agent Intelligence Through Data Mining AGENT INTELLIGENCE THROUGH DATA MINING MULTIAGENT SYSTEMS, ARTIFICIAL SOCIETIES, AND SIMULATED ORGANIZATIONS International Book Series Series Editor: Gerhard Weiss, Technische Universität München Editorial Board: Kathleen M. Carley, Carnegie Mellon University, PA, USA Yves Demazeau, CNRS Laboratoire LEIBNIZ, France Ed Durfee, University of Michigan, USA Les Gasser, University of Illinois at Urbana-Champaign, IL, USA Nigel Gilbert, University of Surrey, United Kingdom Michael Huhns, University of South Carolina, SC, USA Nick Jennings, University of Southampton, UK Victor Lesser, University of Massachusetts, MA, USA Katia Sycara, Carnegie Mellon University, PA, USA Michael Wooldridge, University of Liverpool, United Kingdom Books in the Series: AGENT INTELLIGENCE THROUGH DATA MINING, Andreas Symeonidis, Pericles Mitkas, ISBN 0-387-24352-6 EXTENDING WEB SERVICES TECHNOLOGIES: The Use of Multi-Agent Approaches, edited by Lawrence Cavedon, Zakaria Maamar, David Martin, and Boualem Benatallah, ISBN 0-387-23343-1 AUTONOMY ORIENTED COMPUTING: From Problem Solving to Complex Systems Modeling, Jiming Liu, XiaoLong Jin, and Kwok Ching Tsui, ISBN1-4020-8121-9 METHODOLOGIES AND SOFTWARE ENGINEERING FOR AGENT SYSTEMS: The Agent-Oriented Software Engineering Handbook, edited by Federico Bergenti, Marie- Pierre Gleizes, Franco Zambonelli AN APPLICATION SCIENCE FOR MULTI-AGENT SYSTEMS, edited by Thomas A. Wagner, ISBN: 1-4020-7867-6 DISTRIBUTED SENSOR NETWORKS, edited by Victor Lesser, Charles L. Ortiz, Jr., Milind Tambe, ISBN: 1-4020-7499-9 AGENT SUPPORTED COOPERATIVE WORK, edited by Yiming Ye, Elizabeth Churchill, ISBN: 1-4020-7404-2 AGENT AUTONOMY, edited by Henry Hexmoor, Cristiano Castelfranchi, Rino Falcone, ISBN: 1-4020-7402-6 REPUTATION IN ARTIFICIAL SOCIETIES: Social Beliefs for Social Order, by Rosaria Conte, Mario Paolucci, ISBN: 1-4020-7186-8 GAME THEORY AND DECISION THEORY IN AGENT-BASED SYSTEMS, edited by Simon Parsons, Piotr Gmytrasiewicz, Michael Wooldridge, ISBN: 1-4020-7115-9 AGENT INTELLIGENCE THROUGH DATA MINING Andreas L, Symeonidis Pericles A. Mitkas Aristotle University ofThessaloniki Greece 4ut Springer Andreas L. Symeonidis Pericles A. Mitkas Postdoctoral Research Associate Associate Professor Electrical and Computer Engineering Dept. Electrical and Computer Engineering Dept. Aristotle University of Thessaloniki Aristotle University of Thessaloniki 54124/Thessaloniki, Greece 54124,Thessaloniki, Greece Library of Congress Cataloging-in-Publication Data A C.I.P. Catalogue record for this book is available from the Library of Congress. AGENT INTELLIGENCE THROUGH DATA MINING by Andreas L. Symeonidis and Pericles A. Mitkas Aristotle University of Thessaloniki,Greece Multiagent Systems, Artificial Societies, and Simulated Organizations Series Volume 14 ISBN-10: 0-387-24352-6 e-ISBN-10: 0-387-25757-8 ISBN-13: 978-0-387-24352-8 e-ISBN-13: 978-0-387-25757-0 Printed on acid-free paper. © 2005 Springer Science+Business Media, Inc. All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, Inc., 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now know or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks and similar terms, even if the are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed in the United States of America. 987654321 SPIN 11374831, 11421214 springeronline.com Andreas L. Symeonidis dedicates this book to his sister, Kyriaki, and to the "Hurri"cane of his life... Pericles A. Mitkas dedicates this book to Sophia, Alexander, and Danae. For all the good years... Contents Dedication v List of Figures xiii List of Tables xvii Foreword xix Preface xxi Acknowledgments xxv Part I Concepts and Techniques 1. INTRODUCTION 3 1 The Quest for Knowledge 3 2 Problem Description 4 3 Related Bibliography 5 4 Scope of the Book 6 5 Contents of the Book 8 6 How to Read this Book 9 2. DATA MINING AND KNOWLEDGE DISCOVERY: A BRIEF OVERVIEW 11 1 History and Motivation 11 1.1 The Emergence of Data Mining 11 1.2 So, what is Data Mining? 13 1.3 The KDD Process 13 1.4 Organizing Data Mining Techniques 15 2 Data Preprocessing 18 2.1 The Scope of Data Preprocessing 18 2.2 Data Cleaning 18 viii A GENT INTELLIGENCE THR 0 UGH DA TA MINING 2.3 Data Integration 19 2.4 Data Transformation 19 2.5 Data Reduction 20 2.6 Data Discretization 20 3 Classification and Prediction 21 3.1 Defining Classification 21 3.2 Bayesian Classification 21 3.3 Decision Trees 22 3.3.1 The ID3 algorithm 24 4 Clustering 26 4.1 Definitions 27 4.2 Clustering Techniques 27 4.3 Representative Clustering Algorithms 28 4.3.1 Partitioning Algorithms 28 4.3.2 Hierarchical Algorithms 29 4.3.3 Density-Based Algorithms 30 5 Association Rule Extraction 32 5.1 Definitions 32 5.2 Representative Algorithms 33 6 Evolutionary Data Mining Algorithms 35 6.1 The Basic Concepts of Genetic Algorithms 35 6.2 Genetic Algorithm Terminology 36 6.3 Genetic Algorithm Operands 37 6.4 The Genetic Algorithm Mechanism 38 6.5 Application of Genetic Algorithms 38 7 Chapter review 40 3. INTELLIGENT AGENTS AND MULTI-AGENT SYSTEMS 41 1 Intelligent Agents 41 1.1 Agent Definition 41 1.2 Agent Features and Working Definitions 42 1.3 Agent Classification 44 1.4 Agents and Objects 45 1.5 Agents and Expert Systems 47 1.6 Agent Programming Languages 47 2 Multi-Agent Systems 48 2.1 Multi-Agent System Characteristics 50 2.2 Agent Communication 51 2.3 Agent Communication Languages 53 Contents ix 2.3.1 KQML 53 2.3.2 KIF 54 2.3.3 FIPA ACL 54 2.4 Agent Communities 55 Part II Methodology 4. EXPLOITING DATA MINING ON MAS 59 1 Introduction 59 1.1 Logic and Limitations 60 1.2 Agent Training and Knowledge Diffusion 62 1.3 Three Levels of Knowledge Diffusion for MAS 63 2 MAS Development Tools 63 3 Agent Academy 66 3.1 A A Architecture 67 3.2 Developing Multi-Agent Applications 68 3.3 Creating Agent Ontologies 68 3.4 Creating Behavior Types 68 3.5 Creating Agent Types 69 3.6 Deploying a Multi Agent System 69 5. COUPLING DATA MINING WITH INTELLIGENT AGENTS 71 1 The Unified Methodology 72 1.1 Formal Model 72 1.1.1 Case 1: Training at the MAS application level 72 1.1.2 Case 2: Training at the MAS behavior level 72 1.1.3 Case 3: Training evolutionary agent communities 72 1.2 Common Primitives for MAS Development 73 1.3 Application Level: The Training Framework 76 1.4 Behavior Level: The Training Framework 77 1.5 Evolutionary Level: The Training Framework 80 2 Data Miner: A Tool for Training and Retraining Agents 82 2.1 Prerequisites for Using the Data Miner 82 2.2 Data Miner Overview 82 2.3 Selection of the Appropriate DM Technique 85 2.4 Training and Retraining with the Data Miner 86 x AGENT INTELLIGENCE THROUGH DATA MINING Part III Knowledge Diffusion: Three Representative Test Cases 6. DATA MINING ON THE APPLICATION LEVEL OF A MAS 93 1 Enterprise Resource Planning Systems 93 2 The Generalized Framework 95 2.1 IRF Architecture 97 2.1.1 Customer Order Agent type 98 2.1.2 Recommendation Agent type 99 2.1.3 Customer Profile Identification Agent type 99 2.1.4 Supplier Pattern Identification Agent type 100 2.1.5 Inventory Profile Identification Agent type 100 2.1.6 Enterprise Resource Planning Agent type 100 2.2 Installation and Runtime Workflows 101 2.3 System Intelligence 103 2.3.1 Benchmarking customer and suppliers 103 2.3.2 IPIA products profile 106 2.3.3 RA Intelligence 106 3 An IRF Demonstrator 109 4 Conclusions 112 7. MINING AGENT BEHAVIORS 115 1 Predicting Agent Behavior 115 1.1 The Prediction Mechanism 115 1.2 Applying «-Profile on MAS 119 1.3 Modeling Agent Actions in an Operation Cycle 121 1.4 Mapping Agent Actions to Vectors 122 1.5 Evaluating Efficiency 123 1.5.1 Profile efficiency evaluation 123 1.5.2 Prediction system efficiency evaluation 124 2 A Recommendation Engine Demonstrator 124 2.1 System Parameters 125 2.1.1 The fuzzy variable Time 125 2.1.2 The fuzzy variable Frequency 126 2.1.3 The output fuzzy variable Weight 127 2.2 The Rules of the FIS 127 2.3 Browsing through a Web Site 130 3 Experimental Results 131 4 Conclusions 133 Contents xi 3. MINING KNOWLEDGE FOR AGENT COMMUNITIES 135 1 Ecosystem Simulation 135 2 An Overview of Biotope 138 2.1 The Biotope Environment 138 2.2 The Biotope Agents 139 2.2.1 Agent sight 139 2.2.2 Agent movement 139 2.2.3 Agent reproduction 141 2.2.4 Agent communication - Knowledge exchange 141 2.3 Knowledge Extraction and Improvement 142 2.3.1 Classifiers 143 2.3.2 Classifier Evaluation mechanism 143 2.3.3 Genetic Algorithm 144 2.4 The Assessment Indicators 145 2.4.1 Environmental indicators 145 2.4.2 Agent performance indicators 146 3 The Implemented Prototype 148 3.1 Creating a New Simulation Scenario 149 4 Experimental Results 150 4.1 Exploiting the Potential of Agent Communication 151 4.1.1 Specifying the optimal communication rate 152 4.1.2 Agent efficiency and knowledge base size 152 4.1.3 Agent communication and unreliability 153 4.2 GAs in Unreliable Environments 155 4.3 Simulating Various Environments 158 5 Conclusions 160 Part IV Extensions..
Load more

Recommended publications
  • Evolutionary Data Mining Approach to Creating Digital Logic
    EVOLUTIONARY DATA MINING APPROACH TO CREATING DIGITAL LOGIC James F. Smith III, ThanhVu H. Nguyen Code 5741, Naval Research Laboratory, Washington, DC, 20375-5320, USA Keywords: Optimization problems in signal processing, signal reconstruction, system identification, time series and system modeling. Abstract: A data mining based procedure for automated reverse engineering has been developed. The data mining algorithm for reverse engineering uses a genetic program (GP) as a data mining function. A genetic program is an algorithm based on the theory of evolution that automatically evolves populations of computer programs or mathematical expressions, eventually selecting one that is optimal in the sense it maximizes a measure of effectiveness, referred to as a fitness function. The system to be reverse engineered is typically a sensor. Design documents for the sensor are not available and conditions prevent the sensor from being taken apart. The sensor is used to create a database of input signals and output measurements. Rules about the likely design properties of the sensor are collected from experts. The rules are used to create a fitness function for the genetic program. Genetic program based data mining is then conducted. This procedure incorporates not only the experts’ rules into the fitness function, but also the information in the database. The information extracted through this process is the internal design specifications of the sensor. Significant mathematical formalism and experimental results related to GP based data mining for reverse engineering will be provided. 1 INTRODUCTION The rules are used to create a fitness function for the genetic program. Genetic program based data An engineer must design a signal that will yield a mining is then conducted (Bigus 1996, Smith 2003a, particular type of output from a sensor device (SD).
    [Show full text]
  • A Genetic Algorithm Solution Approach Introd
    A new optimization model for market basket analysis with allocation considerations: A genetic algorithm solution approach Majeed HEYDARI University of Zanjan, Zanjan, Iran [email protected] Amir YOUSEFLI Imam Khomeini International University, Qazvin, Iran [email protected] Abstract. Nowadays market basket analysis is one of the interested research areas of the data mining that has received more attention by researchers. But, most of the related research focused on the traditional and heuristic algorithms with limited factors that are not the only influential factors of the basket market analysis. In this paper to efficient modeling and analysis of the market basket data, the optimization model is proposed with considering allocation parameter as one of the important and effectual factors of the selling rate. The genetic algorithm approach is applied to solve the formulated non-linear binary programming problem and a numerical example is used to illustrate the presented model. The provided results reveal that the obtained solutions seem to be more realistic and applicable. Keywords: market basket analysis, association rule, non-linear programming, genetic algorithm, optimization. Please cite the article as follows: Heydary, M. and Yousefli, A. (2017), “A new optimization model for market basket analysis with allocation considerations: A genetic algorithm solution approach”, Management & Marketing. Challenges for the Knowledge Society, Vol. 12, No. 1, pp. 1- 11. DOI: 10.1515/mmcks-2017-0001 Introduction Nowadays, data mining is widely used in several aspects of science such as manufacturing, marketing, CRM, retail trade etc. Data mining or knowledge discovery is a process for data analyzing to extract information from large databases.
    [Show full text]
  • Optimization-Based Evolutionary Data Mining Techniques for Structural Health Monitoring
    Journal of Civil Engineering and Construction 2020;9(1):14-23 https://doi.org/10.32732/jcec.2020.9.1.14 Optimization-Based Evolutionary Data Mining Techniques for Structural Health Monitoring Meisam Gordan, Zubaidah Binti Ismail, Hashim Abdul Razak, Khaled Ghaedi, Haider Hamad Ghayeb Department of Civil Engineering, University of Malaya, 50603, Kuala Lumpur, Malaysia E-mail: [email protected] Received: 27 July 2019; Accepted: 24 August 2019; Available online: 20 November 2019 Abstract: In recent years, data mining technology has been employed to solve various Structural Health Monitoring (SHM) problems as a comprehensive strategy because of its computational capability. Optimization is one the most important functions in Data mining. In an engineering optimization problem, it is not easy to find an exact solution. In this regard, evolutionary techniques have been applied as a part of procedure of achieving the exact solution. Therefore, various metaheuristic algorithms have been developed to solve a variety of engineering optimization problems in SHM. This study presents the most applicable as well as effective evolutionary techniques used in structural damage identification. To this end, a brief overview of metaheuristic techniques is discussed in this paper. Then the most applicable optimization-based algorithms in structural damage identification are presented, i.e. Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Imperialist Competitive Algorithm (ICA) and Ant Colony Optimization (ACO). Some related examples are also detailed in order to indicate the efficiency of these algorithms. Keywords: Structural damage detection; Data mining; Metaheuristic algorithms; Optimization. 1. Introduction In-service aerospace, mechanical, and civil structures are damage-prone during their service life.
    [Show full text]
  • Multi Objective Optimization of Classification Rules Using Cultural Algorithms
    Available online at www.sciencedirect.com Procedia Engineering Procedia Engineering 00 (2011) 000–000 Procedia Engineering 30 (2012) 457 – 465 www.elsevier.com/locate/procedia International Conference on Communication Technology and System Design 2011 Multi Objective Optimization of classification rules using Cultural Algorithms Sujatha Srinivasana, Sivakumar Ramakrishnana, a* aDept. of Computer Science, AVVM Sri Pushpam College, Poondi, Tanjore-613503, Tamil Nadu, India Abstract Classification rule mining is the most sought out by users since they represent highly comprehensible form of knowledge. The rules are evaluated based on objective and subjective metrics. The user must be able to specify the properties of the rules. The rules discovered must have some of these properties to render them useful. These properties may be conflicting. Hence discovery of rules with specific properties is a multi objective optimization problem. Cultural Algorithm (CA) which derives from social structures, and which incorporates evolutionary systems and agents, and uses five knowledge sources (KS’s) for the evolution process better suits the need for solving multi objective optimization problem. In the current study a cultural algorithm for classification rule mining is proposed for multi objective optimization of rules. © 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of ICCTSD 2011 Keywords: Multi-objective-optimization; Classification; Cultural Algorithm; Data mining. 1. Introduction Classification rule mining is a class of problems which is the most sought out by decision makers since they produce comprehensible form of knowledge. The rules produced by the rule mining approach are evaluated using various metrics which are called the properties of the rule.
    [Show full text]
  • Efficient Evolutionary Data Mining Algorithms Applied to the Insurance Fraud Prediction
    International Journal of Machine Learning and Computing, Vol. 2, No. 3, June 2012 Efficient Evolutionary Data Mining Algorithms Applied to the Insurance Fraud Prediction Jenn-Long Liu, Chien-Liang Chen, and Hsing-Hui Yang instances of insurance cases for data mining. The 5000 Abstract—This study proposes two kinds of Evolutionary instances are divided into 4000 instances to be the training set Data Mining (EvoDM) algorithms to the insurance fraud and 1000 instances to be the test set. Furthermore, this work prediction. One is GA-Kmeans by combining K-means applies K-means, GA-Kmeans and MPSO-Kmeans algorithm with genetic algorithm (GA). The other is algorithms to evaluate the fraud or not from the training set MPSO-Kmeans by combining K-means algorithm with Momentum-type Particle Swarm Optimization (MPSO). The and also evaluate the accuracy of fraud prediction for the test dataset used in this study is composed of 6 attributes with 5000 set. instances for car insurance claim. These 5000 instances are divided into 4000 training data and 1000 test data. Two II. CRISP-DM different initial cluster centers for each attribute are set by means of (a) selecting the centers randomly from the training CRISP-DM (Cross Industry Standard Process for Data set and (b) averaging all data of training set, respectively. Mining) is a data mining process model that describes Thereafter, the proposed GA-Kmeans and MPSO-Kmeans are commonly used approaches for expert data miners use to employed to determine the optimal weights and final cluster solve problems. CRISP-DM was conceived in late 1996 by centers for attributes, and the accuracy of prediction for test set SPSS (then ISL), NCR and DaimlerChrysler (then is computed based on the optimal weights and final cluster Daimler-Benz).
    [Show full text]
  • Evolutionary Data Mining for Link Analysis: Preliminary Experiments on a Social Network Test Bed
    Evolutionary Data Mining for Link Analysis: Preliminary Experiments on a Social Network Test Bed William H. Hsu Andrew L. King Martin S. R. Paradesi Tejaswi Pydimarri Tim Weninger Department of Computing and Information Sciences, Kansas State University 234 Nichols Hall, Manhattan, KS 66506 (785) 532-6350 {bhsu | aking | pmsr | tejaswi | weninger}@ksu.edu ABSTRACT between communities and users they denote accepted members In this paper, we address the problem of graph feature extraction and moderator privileges. Specific recommendation targets for and selection for link analysis in weblogs and similar social weblogs include links (new friends and subscriberships), security networks. First, we present an approach based on collaborative levels (link strength), requests for reciprocal links (trust, recommendation using the link structure of a social network and membership and moderatorship applications), and definition of content-based recommendation using mutual declared interests. security levels (filters). There are analogous applicatons of this Next, we describe the application of this approach to a small functionality in social networks such as citation and collaboration representative subset of a large real-world social network: the networks. user/community network of the blog service LiveJournal. We We investigate the problem of link recommendation in such then discuss the ground features available in LiveJournal’s public weblog-based social networks and describe an annotated graph- user information pages and describe some graph algorithms for based representation for such networks. Our approach uses graph analysis of the social network along with a feature set for feature analysis to recommend links (u, v) given structural classifying users as friends or non-friends.
    [Show full text]
  • Novel Evolutionary Algorithms for Supervised Classification Problems: an Experimental Study
    Evolutionary Intelligence manuscript No. (will be inserted by the editor) Novel Evolutionary Algorithms for Supervised Classification Problems: An Experimental Study Pu Wang · Thomas Weise · Raymond Chiong Received: date / Accepted: date This is a preview version of paper [64] (see page 24 for the reference). It is posted here for your personal use and not for redistribution. The final publication and definite version is available from Springer (who hold the copyright) at http://link.springer.com/. See also http://dx.doi.org/10.1007/s12065-010-0047-7. Abstract Evolutionary Algorithms (EAs) are population-based, stochastic search al- gorithms that mimic natural evolution. Over the years, EAs have been successfully applied to many classification problems. In this paper, we present three novel evolu- tionary approaches and analyze their performances for synthesizing classifiers with EAs in supervised data mining scenarios. The first approach is based on encoding rule sets with bit string genomes, while the second one utilizes Genetic Programming (GP) to create decision trees with arbitrary expressions attached to the nodes. The novelty of these two approaches lies in the use of solutions on the Pareto front as an ensemble. The third approach, EDDIE-101, is also based on GP but uses a new, advanced fitness measure and some novel genetic operators. We compare these approaches to a number of well-known data mining methods, including C4.5 and Random-Forest, and show that the performances of our evolved classifiers can be very competitive as far as the solution quality is concerned. In addition, the proposed approaches work well across a wide range of configurations, and EDDIE-101 particularly has been highly efficient.
    [Show full text]
  • Comprehensive Taxonomies of Nature- and Bio-Inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis and Recommendations
    Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations Daniel Molina*1, Javier Poyatos1, Javier Del Ser2,3,4, Salvador García1, Amir Hussain5, and Francisco Herrera1,6 1 Department of Computer Science, DaSCI Andalusian Institute of Data Science and Computation Intelligence, University of Granada, Spain, {[email protected], [email protected], [email protected], [email protected]} 2 TECNALIA, Spain, [email protected] 3 Dept. of Communications Engineering, University of the Basque Country (UPV/EHU), Spain 4 Basque Center for Applied Mathematics (BCAM), Spain 5 Edinburgh Napier University, United Kingdom, [email protected] 6 Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia Abstract Introduction: In recent years, a great variety of nature- and bio-inspired algorithms has been reported in the literature. This algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. Method: This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary arXiv:2002.08136v3 [cs.AI] 30 Apr 2021 of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper.
    [Show full text]
  • Genetic Algorithms and Evolutionary Computation
    126 IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.12, December 2010 Genetic Algorithms and Evolutionary Computation Ms.Nagori Meghna, Faculty of EngineeringGovernment EnggCollege Aurangabad, -431432, India Ms. KaleJyoti Faculty of Engineering MGM’c Engg College Nanded, -411402, India Abstract from the wild type), and dairy cows (with immense udders Generally speaking, genetic algorithms are simulations of far larger than would be required just for nourishing evolution, of what kind ever. In most cases, however, genetic offspring).Critics might charge that creationists can algorithms are nothing else than probabilistic optimization explain these things without recourse to evolution. For methods which are based on the principles of evolution. Using example, creationists often explain the development of simulation and Genetic Algorithms to improve cluster tool resistance to antibiotic agents in bacteria, or the changes performance, Mooring Pattern Optimization using Genetic wrought in domesticated animals by artificial selection, by Algorithms. This paper is designed to cover a few important application aspects of genetic algorithm under a single umbrella. presuming that God decided to create organisms in fixed Key words: groups, called "kinds" or baramin. Though natural Genetic Algorithm microevolution or human-guided artificial selection can bring about different varieties within the originally created "dog-kind," or "cow-kind," or "bacteria-kind" (!), Introduction no amount of time or genetic change can transform one "kind" into another. However, exactly how the creationists determine what a "kind" is, or what mechanism prevents Creationists occasionally charge that evolution is useless living things from evolving beyond its boundaries, is as a scientific theory because it produces no practical invariably never explained.
    [Show full text]
  • Conference Program
    Genn etic and Evolutionary Computation Conference (GECCO-2004) CONFERENCE PROGRAM June 26 – 30, 2004 Red Lion Hotel on Fifth Avenue Seattle, Washington, USA A Recombination of the Ninth Annual Genetic Programming Conference and the Thirteenth International Conference on Genetic Algorithms International Society for Genetic and Evolutionary Computation, Inc. In Association with the American Association for Artificial Intelligence Table of Contents GECCO Organizers ................................................................................................................................................... 2 Program Committee................................................................................................................................................... 3 Best Paper Awards..................................................................................................................................................... 4 About the Evolutionary Computation in Industry Track ........................................................................................... 5 Hotel Floor Plan......................................................................................................................................................... 5 Saturday Workshops and Tutorials............................................................................................................................ 6 Sunday Workshops, Tutorials and Human-competitive Results ..............................................................................
    [Show full text]
  • Improving Selection Methods for Evolutionary Algorithms by Clustering
    Improving Selection Methods for Evolutionary Algorithms by Clustering Kaikuo Xu1, ChangjieTang1, Yintian Liu1, Chuan Li1, Jiang Wu1, Jun Zhu2, Li Dai2 1School of Computer Science, Sichuan University, Chengdu, 610065, China 2National Center for Birth Defects Monitoring, Chengdu, 610065, China {xukaikuo, tangchangjie}@cs.scu.edu.cn Abstract characteristics of the population, hence the performance is still far from practice requirement. This study applies clustering in population selection to In this work, we apply clustering to selection improve the efficiency of evolutionary algorithms. The methods to better balance these two primary factors. (a) main contributions include: (a) Proposes a novel This selection framework is a combination of clustering selection framework that uses the number of clusters for a [7, 8] and classic selection schemes [6]. It first clusters the population as the measurement the population diversity. population according to the fitness distribution, then (b) Proposes clustering-ranking selection, an instance of carries out selection on the clusters using the classic this framework, and discusses its mathematical principle selection methods, at last selects individuals from the by PD-SP equation. (c) Gives experiments over CLPSO selected clusters according to uniform distribution; (b) (Comprehensive Learning Particle Swarm Optimization). Ranking selection is chosen to form an instance of the Experiment result shows that the proposed selection framework. The mathematical analysis shows that since method outperforms canonical exponential ranking on all the results of the clustering vary with the evolutional the sixteen-benchmark functions for both 10-D and 30-D progress, the selective pressure and population diversity problems except a function for 30-D problem.
    [Show full text]
  • Exploration of Customer Churn Routes Using Machine Learning Probabilistic Models
    UNIVERSITAT POLITECNICA` DE CATALUNYA Exploration of Customer Churn Routes Using Machine Learning Probabilistic Models DOCTORAL THESIS Author: David L. Garc´ıa Advisors: Dra. Angela` Nebot and Dr. Alfredo Vellido Soft Computing Research Group Departament de Llenguatges i Sistemes Informatics` Universitat Politecnica` de Catalunya. BarcelonaTech Barcelona, 10th April 2014 A bird doesn’t sing because it has an answer, it sings because it has a song. Maya Angelou AMonica,´ Olivia, Pol i Jana 1 Acknowledgments Siempre he pensado que las cosas, en la vida, no ocurren por casualidad; son el conjunto de pequenas˜ (y grandes) aportaciones, casualidades, ideas, retos, azar, amor, exigencia y apoyo, animo´ y desanimo,´ es- fuerzo, inspiracion,´ reflexiones y cr´ıticas y, en definitiva, de todo aquello que nos configura como personas. Y la presente Tesis Doctoral no es una excepcion.´ Sin la aportacion´ en pequenas˜ dosis de estos ingredientes por parte de muchas personas esta Tesis no hubiera visto nunca la luz. A todos ellos mi publica´ gratitud. A los Dres. Angela` Nebot y Alfredo Vellido, en primer lugar por reconocer algun´ tipo de ’valor’ difer- encial en un perfil como el m´ıo y aceptarme en el Soft Computing Group como estudiante de doctorado. Y en segundo lugar, y mas´ importante, por ser el alma de este trabajo. Si os fijais´ observareis´ su presencia e ideas a lo largo de la Tesis Doctoral. Para ellos mi gratitud y admiracion.´ A mis clientes y colegas en el mundo empresarial, con los que he compartido infinitas horas y problemas y cuya exigencia ha puesto a prueba, cada d´ıa, el sentido y utilidad practica´ de las ideas y metodolog´ıas aqu´ı presentadas.
    [Show full text]