Illinois Genetic Algorithms Laboratory Department of General Engineering University of Illinois at Urbana-Champaign Urbana, IL 61801. DISCUS: Moving from.

Slides:



Advertisements
Similar presentations
IT Supported Collaborative Creative Work Andy Williams GE393 – DEG April 19, 2004 Andy Williams GE393 – DEG April 19, 2004.
Advertisements

Academic Cultures Moira Peelo, Lancaster University.
Educational Technology
Kensington Oracle Edition: Open Discovery Workflow Meets Oracle 10g Professor Yike Guo.
The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR OBJECTIVE: Accelerate.
Norman D. Peterson Director, Government Relations September 9, 2013
Core Competencies Student Focus Group, Nov. 20, 2008.
Project Proposal.
Workshop on HPC in India Grid Middleware for High Performance Computing Sathish Vadhiyar Grid Applications Research Lab (GARL) Supercomputer Education.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Department of Engineering, Control & Instrumentation Research Group 22 – Mar – 2006 Optimisation Based Clearance of Nonlinear Flight Control Laws Prathyush.
Genetic Algorithms Learning Machines for knowledge discovery.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Computer Science Prof. Bill Pugh Dept. of Computer Science.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Introduction to Management Information Systems Chapter 2 Purpose of Information Systems HTM 304 Fall 07.
Learning Sciences and Engineering Professional Master’s Program Ken Koedinger Vincent Aleven Albert Corbett Carolyn Rosé Justine Cassell.
TEXT MINING IN BIOMEDICAL RESEARCH QI LI 03/28/14.
Y. Rong June 2008 Modified in Feb  Industrial leaders  Initiation of a project (any project)  Innovative way to do: NABC ◦ Need analysis ◦ Approach.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Algorithms: A Tutorial
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
CS598CXZ Course Summary ChengXiang Zhai Department of Computer Science University of Illinois, Urbana-Champaign.
GE105: Introduction to Engineering Design Course Information College of Engineering King Saud University Feb 1, 2012.
Subject: Art Grade Level: 4th What is art? Are you an artist? Where do you see art? Who are some well known artist?
Page 1 Dan Roth Department of Computer Science University of Illinois at Urbana-Champaign.
Genetic Algorithm.
CHAPTER 2 INFORMATION SYSTEMS FOR COMPETITIVE ADVANTAGE
High Performance I/O and Data Management System Group Seminar Xiaosong Ma Department of Computer Science North Carolina State University September 12,
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Estimation of Distribution Algorithms (EDA)
Duane Searsmith Automated Learning Group National Center for Supercomputing Applications University of Illinois Office: (217)
Overview: Text delivery in introductory college and university physics classes are dominated by massive, encyclopedic textbooks that take immense individual.
Peter Bajcsy, Rob Kooper, Luigi Marini, Barbara Minsker and Jim Myers National Center for Supercomputing Applications (NCSA) University of Illinois at.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
The Design of Innovation is coming July 2002 a new book by David E. Goldberg Department of General Engineering University of Illinois at Urbana-Champaign.
How to apply Genetic Algorithms Successfully Prabhas Chongstitvatana Chulalongkorn University 4 February 2013.
Virtual Classroom Economics of Engineering Design Virginia Tech University of Massachusetts General Electric Company National Science Foundation.
G ENETIC P ROGRAMMING Ranga Rodrigo March 17,
National Center for Supercomputing Applications Barbara S. Minsker, Ph.D. Associate Professor National Center for Supercomputing Applications and Department.
Equipping ourselves for the 21 st century Andreina España.
SE 361 Lecture-03. Science is defined as: a department of systematized knowledge as an object of study; knowledge or a system of knowledge covering.
Evolving the goal priorities of autonomous agents Adam Campbell* Advisor: Dr. Annie S. Wu* Collaborator: Dr. Randall Shumaker** School of Electrical Engineering.
Introduction to Evolutionary Computation Prabhas Chongstitvatana Chulalongkorn University WUNCA, Mahidol, 25 January 2011.
Solving Function Optimization Problems with Genetic Algorithms September 26, 2001 Cho, Dong-Yeon , Tel:
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Overview Last two weeks we looked at evolutionary algorithms.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Modelling & Simulation of Semiconductor Devices Lecture 1 & 2 Introduction to Modelling & Simulation.
Genetic Algorithm(GA)
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Towards Understanding the User Interface Designer's Environment: An Empirical Approach Peter Mortimer, , Munich.
Technologies curriculum
Optimization Of Robot Motion Planning Using Genetic Algorithm
GECCO 2017 Jheng-Ying Yu Taiwan Evolutionary Intelligence Laboratory 2017/09/18 Group Meeting Presentation.
Discrete ABC Based on Similarity for GCP
Evolving the goal priorities of autonomous agents
Artificial Intelligence Project 2 Genetic Algorithms
Introduction to TIMAN: Text Information Managemetn & Analysis
Genetic Algorithms: A Tutorial
CHAPTER 2 INFORMATION SYSTEMS FOR COMPETITIVE ADVANTAGE
Traveling Salesman Problem by Genetic Algorithm
Some Speculations on Facilitating Creative Idea Generation in
Genetic Algorithms: A Tutorial
Presentation transcript:

Illinois Genetic Algorithms Laboratory Department of General Engineering University of Illinois at Urbana-Champaign Urbana, IL DISCUS: Moving from Decision Support Systems to Innovation Support Systems David E. Goldberg, Michael Welge, & Xavier Llora NCSA/ALG + IlliGAL University of Illinois at Urbana-Champaign

Innovation This & Innovation That The business world is abuzz with “innovation.” Popular books tell companies how to get it. But little scientific understanding of what it is. UIUC research changing that.

Decision Support & Knowledge Management versus Innovation Support Decision support systems help evaluate enumerated alternatives. Knowledge management helps manage that which is known. Is it possible to create new class of innovation support system to systematically permit organizations to use IT to support pervasive and persistent innovation?

Collaboration + Key Ideas = Opportunity Previous collaboration of ALG + IlliGAL – Applications-ready GA theory – MOGAs for D2K & the real world – Interactive genetic algorithms Confluence of key ideas – Interactive GAs – Human-based GA (Kosorukoff & Goldberg, 2002) – Chance discovery & data-text mining DISCUS: Distributed Innovation and Scalable Collaboration in Uncertain Settings

Overview 3 elements research from IlliGAL 4 trips to the South Farms 2 trips to Japan The innovation connection The key problem: interactive superficiality KeyGraphs as aid to reflection Key elements of DISCUS

Three Elements from TB IlliGAL has studied principled – Genetic algorithm design theory – Genetic algorithm competence – Genetic algorithm efficiency Design theory permits analysis w/o tears. Competence = solve hard problems, quickly, reliably, and accurately  O(l 2 ). Efficiency takes tractable subquadratic solutions to practicality.

Four Trips to the South Farms Collaboration had blossomed with ALG & Prof. Minsker on – Carrying principled design theory to practice – Multiobjective selection to D2K & practice – GBML and HBGAs to D2K – Interactive GAs Keys for the current project: – HBGAs – Interactive GAs

Interactive & Human-Based Genetic Algorithms Interactive GAs replace machine eval with human eval Human-based GAs replace ops & eval with human: Figure : Actual photo of simulated criminal (above). Evolved image from witness using Faceprints (below).

Two Trips to Japan Visited Tsukuba University, Graduate School of Systems Management, December 2001 – January Met KeyGraph Inventor & Chance Discovery Proponent, Yukio Osawa. Did Tutorial with Dr. Osawa August Finally understood importance of topic & relation to GAs.

Modes of Innovation GA as model of innovation – Kaizen = selection + mutation – Discontinuous change = selection + crossover Chance discovery – Low probability events linked to matters of importance Keygraphs as one computational embodiment of chance discovery.

Innovation This & Innovation That The business world is abuzz with “innovation.” Popular books tell companies how to get it. But little scientific understanding of what it is.

Selection+Recombination = Innovation Combine notions to form ideas. “It takes two to invent anything. The one makes up combinations; the other chooses, recognizes what he wishes and what is important to him in the mass of the things which the former has imparted to him.” P. Valéry

Scalable Solutions on Hard Problems Time to first global averaged over five runs. Subquadratic versus quintic. Compares favorably to hillclimbing, too (Muhlenbein, 1992).

KeyGraph Example: Japanese Breakfast Figure: KeyGraph (Ohsawa, 2002) shows two clusters of food preferences for Japanese breakfast eaters. The chance discovery of rare use of vitamins was viewed as a marketing opportunity by food companies.

Key Problem & Notion Human-based GAs interesting, but suffer from interactive superficiality. KeyGraphs have been used to gain insight into text data, but usually batch mode of processing. Combine interactivity of HBGAs and insight promotion of KeyGraphs. Boost everything with competent efficient GAs and IEC at population outskirts.

Summary 3 imports from IlliGAL 4 trips to South Farms 2 trips to Japan The innovation connection Key problem: interactive superficiality Possible solution: interactive collaboration with reflection boosted by KeyGraphs Larger framework with competent & interactive GEC.

More Information Visit IlliGAL web site. Recent book: Goldberg, D. E. (2002). The Design of Innovation. Boston, MA: Kluwer Academic. Attend GECCO-2003, Chicago, July 12-16, 2003,

People Involved With DISCUS llinois Genetic Algorithms Lab - Department of General Engineering - University of Illinois at Urbana Champaign (IlliGAL-UIUC) – David E. Goldberg, Xavier Llorà, Kei Ohnishi, Tian Li Yu, Martin Butz, Antonio Gonzales Automated Learning Group - National Center for Supercomputing Applications (ALG-NCSA) – Michael Welge, Loretta Auvil, Duane Searsmith, Bei Yu Knowledge and Learning System Group - National Center for Supercomputing Applications – Tim Wentling, Andrew Wadsworth, Luigi Marini, Raj Barnerjee Data Mining and Visualization Division - National Center for Supercomputing Applications – Alan Craig Deparment of General Engineering - National Center for Supercomputing Applications – Ali Yassine, Miao Zhuang Minsker Research Group - Department of Civil and Environmental Engineering - University of Illinois at Urbana-Champaign – Barbara Minsker, Abhishek Singh, Meghna Babbar Kyushu Institute of Design - Department of Art and Information Design – Hideyuki Takagi Graduate School of Systems Management - University of Tsukuba – Yukio Ohsawa VIAS (the Visualization Information Archival/Retrieval Service)