Overview of IGA Application and Combating User Fatigue Jie-Wei Wu 2013/3/12.

Slides:



Advertisements
Similar presentations
© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
Advertisements

Statistical Machine Learning- The Basic Approach and Current Research Challenges Shai Ben-David CS497 February, 2007.
Interactive Evolutionary Computation Review of Applications Praminda Caleb-Solly Intelligent Computer Systems Centre University of the West of England.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
G5BAIM Artificial Intelligence Methods
Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Ali Husseinzadeh Kashan Spring 2010
Optimal Design Laboratory | University of Michigan, Ann Arbor 2011 Design Preference Elicitation Using Efficient Global Optimization Yi Ren Panos Y. Papalambros.
Genetic Algorithms as a Tool for General Optimization Angel Kuri 2001.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
Support Vector Machines (SVMs) Chapter 5 (Duda et al.)
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Estimation of Distribution Algorithms Ata Kaban School of Computer Science The University of Birmingham.
Evolutionary Computational Intelligence Lecture 10a: Surrogate Assisted Ferrante Neri University of Jyväskylä.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Object Recognition Using Genetic Algorithms CS773C Advanced Machine Intelligence Applications Spring 2008: Object Recognition.
Basic Data Mining Techniques Chapter Decision Trees.
1 Integrating User Feedback Log into Relevance Feedback by Coupled SVM for Content-Based Image Retrieval 9-April, 2005 Steven C. H. Hoi *, Michael R. Lyu.
Topic-Sensitive PageRank Taher H. Haveliwala. PageRank Importance is propagated A global ranking vector is pre-computed.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
COVERTNESS CENTRALITY IN NETWORKS Michael Ovelgönne UMIACS University of Maryland 1 Chanhyun Kang, Anshul Sawant Computer Science Dept.
Genetic Algorithm.
Efficient Model Selection for Support Vector Machines
林偉楷 Taiwan Evolutionary Intelligence Laboratory.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Schemata Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Why Bother with Theory? Might provide performance.
UOS 1 Ontology Based Personalized Search Zhang Tao The University of Seoul.
2004, 9/1 1 Optimal Content-Based Video Decomposition for Interactive Video Navigation Anastasios D. Doulamis, Member, IEEE and Nikolaos D. Doulamis, Member,
A two-stage approach for multi- objective decision making with applications to system reliability optimization Zhaojun Li, Haitao Liao, David W. Coit Reliability.
Psychological Preference-based Optimization Framework: An evolutionary computation approach for constrained problems involving human preference You, Ying-Shiuan.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
1 Interactive Evolutionary Computation: A Framework and Applications November 10, 2009 Sung-Bae Cho Dept. of Computer Science Yonsei University.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Guaranteed Convergence and Distribution in Evolutionary Multi- Objective Algorithms (EMOA’s) via Achivement Scalarizing Functions By Karthik.
Fuzzy Genetic Algorithm
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Doshisha Univ., Kyoto, Japan CEC2003 Adaptive Temperature Schedule Determined by Genetic Algorithm for Parallel Simulated Annealing Doshisha University,
How to apply Genetic Algorithms Successfully Prabhas Chongstitvatana Chulalongkorn University 4 February 2013.
Greedy is not Enough: An Efficient Batch Mode Active Learning Algorithm Chen, Yi-wen( 陳憶文 ) Graduate Institute of Computer Science & Information Engineering.
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem Sang-Moon Soak Speaker: 洪嘉涓、陳麗徽、李振宇、黃怡靜.
Introduction to Evolutionary Computation Prabhas Chongstitvatana Chulalongkorn University WUNCA, Mahidol, 25 January 2011.
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
Interactive Evolution in Automated Knowledge Discovery Tomáš Řehořek March 2011.
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors by Dennis DeCoste and Dominic Mazzoni International.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
Sporadic model building for efficiency enhancement of the hierarchical BOA Genetic Programming and Evolvable Machines (2008) 9: Martin Pelikan, Kumara.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Dr. Chen, Data Mining  A/W & Dr. Chen, Data Mining Chapter 3 Basic Data Mining Techniques Jason C. H. Chen, Ph.D. Professor of MIS School of Business.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Tree and Forest Classification and Regression Tree Bagging of trees Boosting trees Random Forest.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Discrete ABC Based on Similarity for GCP
Bulgarian Academy of Sciences
C.-S. Shieh, EC, KUAS, Taiwan
Advanced Artificial Intelligence Evolutionary Search Algorithm
SMEM Algorithm for Mixture Models
Chen-Yu Lee, Jia-Fong Yeh, and Tsung-Che Chiang
Support Vector Machines
A Gentle introduction Richard P. Simpson
Presentation transcript:

Overview of IGA Application and Combating User Fatigue Jie-Wei Wu 2013/3/12

Agenda Different Applications Using IGA – S.-B. Cho and J.-Y. Lee, “A human-oriented image retrieval system using interactive genetic algorithm,” IEEE Trans. Syst., Man, Cybern. A, vol. 32, pp. 452–458, May – Kim, H.-S. and Cho, S.-B. (2000), “Application of interactive generic algorithm to fashion design”, Engineering Applications of Artificial Intelligence, Vol. 13, pp

Agenda Llorà, X., Sastry, K., Goldberg, D. E., Gupta, A., and Lakshmi, L. (2005). Combating user fatigue in iGAs: Partial ordering, support vector ma-chines, and synthetic fitness. Proceedings of the Genetic and Evolutionary Computation Conference, pages

Agenda Different Applications Using IGA – Kim, H.-S. and Cho, S.-B. (2000), “Application of interactive generic algorithm to fashion design”, Engineering Applications of Artificial Intelligence, Vol. 13, pp – S.-B. Cho and J.-Y. Lee, “A human-oriented image retrieval system using interactive genetic algorithm,” IEEE Trans. Syst., Man, Cybern. A, vol. 32, pp. 452–458, May 1998.

Motivation As most consumers are not professional at design, however, a sophisticated computer- aided design system might be helpful to choose and order what they want.

Experimental results Population size is 8. The number of generation is limited to 10. One-point XO One elitist individual in each generation Convergence test and subject test

Convergence Test 10 subjects are requested to find cool-looking design and splendid design using the system. The meaning of ‘splendid’ might be more complex and various than that of ‘cool- looking.’

Subject Test Randomly selected 500 sample designs from entire search space, and requested 3 subjects to evaluate the sample designs with two categories, coolness and splendor. 10 most cool-looking designs and another 10 most splendid ones are selected as standards of evaluation.

Subject Test Request 10 subjects to find cool-looking design and splendid design using the system. Each searching is limited to 10 generations.

Subject Test This score has 7 degrees (from -3 to 3).

Conclusion of This Paper An IGA-based fashion design aid system for non-professionals. A more realistic and reasonable design in OpenGL design model. Future : the search space should be enlarged.(original 1,880,064)

Different Applications Using IGA – Kim, H.-S. and Cho, S.-B. (2000), “Application of interactive generic algorithm to fashion design”, Engineering Applications of Artificial Intelligence, Vol. 13, pp – S.-B. Cho and J.-Y. Lee, “A human-oriented image retrieval system using interactive genetic algorithm,” IEEE Trans. Syst., Man, Cybern. A, vol. 32, pp. 452–458, May 1998.

Motivation Most of the conventional methods lack of the capability to utilize human intuition and emotion appropriately in the process of retrieval. It is difficult to retrieve a satisfactory result when the user wants an image that cannot be explicitly specified because it deals with emotion.

Discrete Wavelet Transform Construct a matrix of coefficient values. Haar Wavelet Transform Only the largest 50 coefficients in RGB channels.

GA Operators Population size is 12. Horizontal and vertical crossovers

Search The similarity between potential target image and candidate image is calculated. 12 images of higher magnitude value are provided as a result of the search.

Experimental Results Convergence Test Efficiency Test Psychological Test

Convergence Test “We can see that there are more images of gloomy mood in the eighth generation than those in the beginning.” ?

Efficiency Test Request 10 graduate students to search gloomy and splendid images and ask how similar the result image is to what they have in mind.

Psychological Test

Conclusion of This Paper An approach that searches an image with human preference and emotion using GA. To search not only an explicitly expressed image, but also an abstract image such as “cheerful impression image,” “gloomy impression image,” and so on.

Combating User Fatigue in iGAs: Partial ordering, Support Vector Machines, and Synthetic Fitness Llorà, X., Sastry, K., Goldberg, D. E., Gupta, A., and Lakshmi, L. (2005). Proceedings of the Genetic and Evolutionary Computation Conference, pages

Motivation One of the daunting challenges of interactive genetic algorithms (iGAs) is user fatigue which leads to sub-optimal solutions. Combating the user fatigue problem of iGAs: – The lack of a computable fitness – How synthetic fitness models based on user evaluation may be built.

Components of Proposed Method Partial Ordering: The qualitative decisions made by the user about relative solution quality is used to generate partial ordering of solutions Induced Complete Order: The concepts of non- domination and domination count from multi-objective evolutionary algorithms to induce a complete order of the solutions in the population based on their partial ordering Surrogate Function via SVM: The induced order is used to assign ranks to the solutions and use them in a support vector machine (SVM) to create a surrogate fitness function that effectively models user fitness.

Elements IGAs Need to Address Clear goal definition Impact of problem visualization Lack of real fitness Fatigue Persistence of user criteria

Synthetic Fitness Properties – Fitness extrapolation: it requires that the synthetic fitness provide meaningful inferences beyond the boundaries of the current partial order provided by the user. – Order maintenance : it guarantees that a synthetic fitness is accurate if it maintains the partial ordering given by the user decisions.

Surrogate Models Models need to satisfy the above requirements. ε-SVM using a linear kernel

ε-SVM Using a linear kernel easily satisfies the fitness extrapolation and order maintenance propertiesImpact of problem visualization. Hyper-plane adjustment Even with a high-regression error, a ε-SVM guarantees the proper ordering of solutions under a tournament selection scheme.

Synthesis The surrogate models make a basic assumption: the partial order of user evaluations can be translated into a global numeric value.

Synthesis

δ(v) as the number of different nodes present on the paths departing from vertex v. φ(v) is defined as the number of different nodes present on the paths arriving to v.

Synthesis Estimated ranking may be used to train a ε- SVM.

Active Interactive Genetic Algorithms The compact GA is a suitable option to optimize the synthetic fitness Initialization: random individuals, probabilities are initially set to 0.5 Model sampling: generate two candidate solutions by sampling the probability vector. The model sampling procedure is equivalent to uniform crossover in simple GAs.

Active Interactive Genetic Algorithms Selection: tournament selection Probabilistic model updating

Active Interactive Genetic Algorithms

Population-Sizing Model and Convergence- Time Model: approximate form of the cGA is operationally equivalent to the order-one behavior of simple genetic algorithm with steady state selection and uniform crossover.

Experimental Results and Analysis Population-Sizing Model: approximate form of the gambler’s ruin population-sizing model Convergence-Time Model: approximate form of Miller and Goldberg’s convergence-time model

Experimental Results and Analysis The number of function evaluations required for successful convergence, of GAs as follows:

Experimental Results and Analysis IGA requires a population size that grows linearly. It’s the result of using a ε-SVM.

Experimental Results and Analysis The active IGA population is also constrained by the three tournament structure. The population size is forced to grow

Experimental Results and Analysis The theoretical convergence time of the active iGA with the proper population sizing, should be constant.

Experimental Results and Analysis A simple low-cost high-error synthetic fitness function we were able to achieve speedups ranging from 3 up to 7 times.

Conclusion of this Paper Propose a heuristic to synthesize a model of the user fitness combining partial ordering concepts, multiobjective optimization ideas, and support vector machines. Model provided by a ε-SVM is able to satisfy the two properties a synthetic fitness need to satisfy—fitness extrapolation, and order maintenance.

Conclusion of this Paper The existence of a synthetic fitness allow us to actively use such model to combat user fatigue. The injection of such candidate solutions into the user evaluation process effectively reduce the number of evaluations required on the user side till convergence.

Conclusion In application, how to encode needs to be properly designed. The evaluation should be persuasive. The small population size and the user fatigue could just be a trade-off?

Ker...