Comparison of GA-Based Algorithms: A Viewpoint of Learning Scheme
|
|
- Brianne Taylor
- 5 years ago
- Views:
Transcription
1 2017 2nd International Conference on Communications, Information Management and Network Security (CIMNS 2017) ISBN: Comparison of GA-Based Algorithms: A Viewpoint of Learning Scheme Guo-sheng HAO *, Qiu-yi Shi, Gai-ge WANG, Zhao-jun ZHANG and De-xuan ZOU School of Computer Science & Technology, Jiangsu Normal University, Xuzhou, , China *Corresponding author Keywords: Genetic algorithm, Learning mechanism, Evolutionary operators, Learning rules. Abstract. Learning is at the core of intelligence. How does learning work in nature-inspired optimization algorithms? This paper tries to answer this question by analyzing the learning mechanisms in Genetic Algorithm (GA) based Algorithms (GAAs). First, we give a learning scheme, which includes four basic elements including learning subject, learning object, learning result and learning rules. Different GAA has different learning mechanisms. Each GAA generates new solutions by learning to explore/exploit promising sub-space. The learning mechanism of three kinds of GAA, including GA, evolutionary strategy and differential evolution, are studied. We study the learning mechanism from the viewpoint of evolutionary operators, including selection, crossover (or recombination) and mutation. This study enables us to get more insights of GAAs. Introduction For many decades, researchers have been developing ever more sophisticated nature-inspired metaheuristic algorithms (NIOAs)[1] for solving hard optimization problems. Among NIOAs, Genetic Algorithm (GA) [2] was firstly introduced. Since then, various other optimization algorithms have been proposed such as Evolutionary Programming (EP) [3], Evolutionary Strategy (ES) [4] (which are know as GA based algorithm, GAAs), and so on. Different NIOAs are inspired by different natural phenomena and may have different learning strategies or mechanisms to update their population. Yang pointed out that PSO and HS were the cases of BA, and the links among different NIOAs is intensification and diversification [5]. But the details of the similarities were not studied. There are, of course, many learning methods or many ways to generate new solutions. Regardless of the specific ways, it is generally agreed that NIOAs utilize operators to carry out learning or generate new solutions. Almost all NIOAs can correspond to the flowchart shown in Figure 1 (a), where different NIOAs can be compared briefly from the viewpoint of new solution generation, which is the result of learning mechanism. Learning Scheme in Nature-inspired Optimization Algorithm The learning schema in NIOAs are studied by answering the five questions. What is the Learning Scheme? We study it from 3 aspects: who learns, from whom to learn and how to learn, and we study it from 4 elements in the learning scheme: learning subject X S, learning object X O, learning result X new, and learning rule denoted as function L( ). Figure 1 (b) demonstrates the maximum optimization case. The learning subjects are B and D; the learning objects are F, G and H; the learning results are A, C and E. Based on these specifications, two kinds of learning: learning by oneself and learning from others, can be formulated. For the first case, there is, where could be a random or constant step for X S to exploit. For the second case, the learning scheme is. By leaning, an solution incorporate the experience of both its own and its learning object(s) [6] and the promising solutions is expected to satisfy. What are the Resources to Be Learned? There are two kinds of information resources for learning: evolution history information (EHI) and evolution state. We define: 288
2 ,, where t is the iteration number. In machine learning, labeled data are one of the most important resources for learning, and they are also well known as the training data. As intelligent algorithms, NIOAs also make well use of the labeled data, and EHI act as this role. How does the Learning Mechanism Works? The learning in NIOAs is embedded in the update of population, which can be considered as the learning process. We explain how to learn in Figure 1 (c), in which the search space is denoted as S. Both {X S } and {X O } are subset of I H (t). By learning, the algorithms will determine the promising solutions {X new }. We also call the nature-inspired operators as learning operators, which act as the role to explore or exploit new space. Begin Initialize Y End Differences among OAs Terminate? N Evaluate fitness Generate new solutions step 1... Generate new solutions step n (a) General flowchart of optimization algorithms. (b) New solutions generation based on learning from others. Figure 1. General flowchart and new solution generation. (c) New solutions generation based on evolution history information. How Many Learning Type Are There? Almost all the learnings are carried out on two levels: solution level and components level. We classify learning operators according to the number of solutions, the number of components, new solution space and new components space. These learning operators are labeled as L 1 to L 6 that are shown in Table 1. Table 1. Type of Learning Operators. LABEL Number of Solutions Number of Components New solution space New components space L 1 =1 =0 L 2 =1 =1 L 3 =1 >1 L 4 >1 =0 L 5 >1 =1 L 6 >1 >1 How to Measure Learning Results? If the learning result or results has the same peak with learning subjects (or learning objects, if applicable), we take it as granted that the learning is exploitation. If the learning result or results has the different peak with learning subjects (or learning objects, if applicable), we take it as granted that the learning is exploration. The distance between the learning result and the learning subject cannot be a measurement for the learning result, especially for cheat problems. Similarly, other measurements that were mentioned in [8] such as difference, entropy, probability or ancestry are also not suitable for the learning result measurement. Learning Mechanism in GA-based Nature-inspired Optimization Algorithms Denote the number of dimension (variants) as d, and D i as the scope of i -th dimension. Variables in a d-dimensional search space are presented as vectors. Genetic Algorithms A canonical GA mainly has three genetic operators: selection, crossover and mutation. From the learning viewpoint, these three operators are corresponding to three learning steps. 289
3 Selection Operator. Selection is a learning operator, because it adjusts the structure of the population. The role of selection is to determine the learning objects from whom other solutions should learn in the successive learning operators. The learning subject and object in selection operator is. The expression of learning rule L( ) is,. We can see that is the linear combination of solutions in P. From Figure 2, we can see that both in multi-modal and in single-modal case, the effect of selection is exploitation. (a) Exploitation effect (b) Exploitation effect Figure 2. An example of a 2-dimensional case of selection operator in GA. Crossover Operator. The second learning step in GA is crossover operator, which is for sharing information among solutions that combines the good features of two or more parents, to create potentially better offspring. For example, two solutions and are selected as the crossover solutions and suppose that the crossover position is selected at k (1 k<d). Then the learning subject and object are. Let,,,, then the offspring of crossover are:,. We can label the result as:. The expression of learning rule L( ) is,, where i=1, 2,, d. Crossover has the ability of exploration and exploitation. Figure 3 depicts the one-point crossover on the two-dimension variables case, from which we can see the exploration or exploitation. (a) One point crossover (b) Exploration effect (c) Exploitation effect Figure 3. An example of a 2-dimensional case for one crossover operator in GA. Mutation Operator. Mutation operator randomly changes the values of some allele in the chromosome. Suppose that the mutation locus is k(1 k d). Then the learning mechanism is,, where. Let,,,, then there is:. And the learning rule L( ) can be expressed as. Figure 4 (a)-(c) depicts the one-point mutation and (d) depicts the two-point mutation on the two-dimension variables. We can see that mutation has both of the exploration and exploitation ability. It is easy to understand that GA can access any solutions by a d-point mutation. 290
4 (a) Learning elements (b) Exploration effect (c) Exploitation effect (d) Learning with two-point Evolutionary Strategy Figure 4. Space exploration/exploitation of one-point mutation for 2-dimensional case. Evolutionary strategy (ES) carry out competition between parent and offspring. ( ) ES has parent and offspring and is general in real application and (1+1) ES is the simplest style. There are also three learning steps in ES and they are selection, recombination and mutation. Recombination Operator. There are mainly three kinds of recombination operators: discrete recombination, intermediate recombination and weighted recombination. For all these three kinds of recombination operators, the learning subject and object are:,, where ρ is the number of parents, is consisted of solutions after selection. For the first case, the expression of learning rule L( ) is:. In intermediate recombination, a component will learn from all the parents, and the learning rule L( ) takes a weighted average of all ρ parents as:. The space exploration of this recombination can be shown in Figure 10 (a)~(c) for ρ=2 and Figure 10 (d) for ρ=3 respectively, where the new solution is at the centre of the mass of learning subject and objects with mass value as 1. The third recombination is also a weighted recombination. For a maximum optimization, the learning rule L( ) is. It is easy to know that the new solution is nearer to the fit solutions than to other solutions, which is shown as in Figure 5 (e). (a) Learning elements (b) Exploration effect (c) Exploration effect (d) Learning with intermediate recombination operator with three parents Figure 5. An example of a 2-dimensional case for recombination operator in ES. (e) Learning with proportional recombination Mutation Operator. The mutation operator introduces variations by adding perturbation to a solution. For multi variants, the perturbation can be multivariate normal distribution,, with zero mean and covariance matrix. The learning subject and object are:,. The expression of learning rule L( ) is:. And there is:. By the perturbation, X new_3 can access any solutions in the search space as shown in Figure 6. x (1) x x (2) f(x) Figure 6. New solution generated by mutation with normal distribution operator in ES. 291
5 Differential Evolution Differential evolution (DE) employs mutation and crossover operations to produce a trial solution. Then a selection operation is used to choose solutions for the next generation. Mutation Operator. In DE, mutation is linear combination of solutions and the learning subject and object are:,, where X j and X k are randomly chosen solutions from the population. The learning rule L( ) is:, where is a scale factor within the range [0, 2], usually. is also referred to as perturbation to X i. There are many variants based on the basic learning rule, such as: 1) Leaning directly based on the best solution X best, instead of itself and the learning rule L( ) is: ; 2) Learning from more solutions instead of just two solutions as:, where X j, X k, X m and X n are randomly selected from the population. 3) Learning from the best solution X best :. Similarly, based on Figure 7, we can analyse the exploration and exploitation effect, we omit it here. (a) Learning elements (b) Exploration effect (c) Exploitation effect Figure 7. An example of a 2-dimensional case and the process for mutation operator in DE with. Crossover Operator. The number of crossover-point in DE is equal to the number of components of a solution. The learning mechanism of crossover is,, where p c is the crossover probability. Selection Operator. In DE, selection is carried out after mutation and crossover and it is carried out based on competing between parents and offspring. The learning mechanism is:, Conclusion This paper studies the learning mechanism in GAAs algorithms and give the nature of the evolutionary operators in GAAs. The comparison enables theory researchers to get the similarity and differences among GAAs, and also help the application researchers understand the integration of different GAAs together. Acknowledgement This work was partially supported by the National Science Foundation of China under Grants No , , References [1] K. Smith-Miles, and L. Lopes, Measuring instance difficulty for combinatorial optimization problems, Computers & Operations Research, 39(2012) [2] J. H. Holland, Adaptation in natural and artificial systems, Ann Arbor: University of Michigan Press,
6 [3] L. J. Fogel, A. J. Owens, and M. J. Walsh, Artificial intelligence through simulated evolution, New York: Wiley, [4] I. Rechenberg, Evolution strategy: nature s way of optimization, Optimization: Methods and Applications, Possibilities and Limitations, Lecture Notes in Engineering H. W. Bergmann, ed., pp : Springer Berlin Heidelberg, [5] X.-S. Yang, Nature-inspired metaheuristic algorithms: Luniver press, [6] R. Eberhart, and Y. Shi, Comparison between genetic algorithms and particle swarm optimization, Evolutionary Programming VII, Lecture Notes in Computer Science V. W. Porto, N. Saravanan, D. Waagen and A. E. Eiben, eds., pp : Springer Berlin Heidelberg, [7] S. S. Sundar, S. Knobloch-Westerwick, and M. R. Hastall, News cues: information scent and cognitive heuristics, Journal of the American Society for Information Science and Technology, 58(2007) [8] M. ČrepinŠik, S.-H. Liu, and M. Mernik, Exploration and Exploitation in Evolutionary Algorithms: A Survey, ACM Computing Surveys, 45(2013)
Laboratorio di Intelligenza Artificiale e Robotica
Laboratorio di Intelligenza Artificiale e Robotica A.A. 2008-2009 Outline 2 Machine Learning Unsupervised Learning Supervised Learning Reinforcement Learning Genetic Algorithms Genetics-Based Machine Learning
More informationLaboratorio di Intelligenza Artificiale e Robotica
Laboratorio di Intelligenza Artificiale e Robotica A.A. 2008-2009 Outline 2 Machine Learning Unsupervised Learning Supervised Learning Reinforcement Learning Genetic Algorithms Genetics-Based Machine Learning
More informationA SURVEY OF FUZZY COGNITIVE MAP LEARNING METHODS
A SURVEY OF FUZZY COGNITIVE MAP LEARNING METHODS Wociech Stach, Lukasz Kurgan, and Witold Pedrycz Department of Electrical and Computer Engineering University of Alberta Edmonton, Alberta T6G 2V4, Canada
More informationResearch Article Hybrid Multistarting GA-Tabu Search Method for the Placement of BtB Converters for Korean Metropolitan Ring Grid
Mathematical Problems in Engineering Volume 2016, Article ID 1546753, 9 pages http://dx.doi.org/10.1155/2016/1546753 Research Article Hybrid Multistarting GA-Tabu Search Method for the Placement of BtB
More informationDIANA: A computer-supported heterogeneous grouping system for teachers to conduct successful small learning groups
Computers in Human Behavior Computers in Human Behavior 23 (2007) 1997 2010 www.elsevier.com/locate/comphumbeh DIANA: A computer-supported heterogeneous grouping system for teachers to conduct successful
More informationAxiom 2013 Team Description Paper
Axiom 2013 Team Description Paper Mohammad Ghazanfari, S Omid Shirkhorshidi, Farbod Samsamipour, Hossein Rahmatizadeh Zagheli, Mohammad Mahdavi, Payam Mohajeri, S Abbas Alamolhoda Robotics Scientific Association
More informationKnowledge-Based - Systems
Knowledge-Based - Systems ; Rajendra Arvind Akerkar Chairman, Technomathematics Research Foundation and Senior Researcher, Western Norway Research institute Priti Srinivas Sajja Sardar Patel University
More informationLecture 1: Machine Learning Basics
1/69 Lecture 1: Machine Learning Basics Ali Harakeh University of Waterloo WAVE Lab ali.harakeh@uwaterloo.ca May 1, 2017 2/69 Overview 1 Learning Algorithms 2 Capacity, Overfitting, and Underfitting 3
More informationThe dilemma of Saussurean communication
ELSEVIER BioSystems 37 (1996) 31-38 The dilemma of Saussurean communication Michael Oliphant Deparlment of Cognitive Science, University of California, San Diego, CA, USA Abstract A Saussurean communication
More informationLearning Methods for Fuzzy Systems
Learning Methods for Fuzzy Systems Rudolf Kruse and Andreas Nürnberger Department of Computer Science, University of Magdeburg Universitätsplatz, D-396 Magdeburg, Germany Phone : +49.39.67.876, Fax : +49.39.67.8
More informationEvolution of Symbolisation in Chimpanzees and Neural Nets
Evolution of Symbolisation in Chimpanzees and Neural Nets Angelo Cangelosi Centre for Neural and Adaptive Systems University of Plymouth (UK) a.cangelosi@plymouth.ac.uk Introduction Animal communication
More informationProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis Thomas Hofmann Presentation by Ioannis Pavlopoulos & Andreas Damianou for the course of Data Mining & Exploration 1 Outline Latent Semantic Analysis o Need o Overview
More informationReinforcement Learning by Comparing Immediate Reward
Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate
More informationCONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS
CONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS Pirjo Moen Department of Computer Science P.O. Box 68 FI-00014 University of Helsinki pirjo.moen@cs.helsinki.fi http://www.cs.helsinki.fi/pirjo.moen
More informationWhat s in a Step? Toward General, Abstract Representations of Tutoring System Log Data
What s in a Step? Toward General, Abstract Representations of Tutoring System Log Data Kurt VanLehn 1, Kenneth R. Koedinger 2, Alida Skogsholm 2, Adaeze Nwaigwe 2, Robert G.M. Hausmann 1, Anders Weinstein
More informationOPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS
OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS Václav Kocian, Eva Volná, Michal Janošek, Martin Kotyrba University of Ostrava Department of Informatics and Computers Dvořákova 7,
More informationRule Learning With Negation: Issues Regarding Effectiveness
Rule Learning With Negation: Issues Regarding Effectiveness S. Chua, F. Coenen, G. Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX Liverpool, United
More informationClassification Using ANN: A Review
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 7 (2017), pp. 1811-1820 Research India Publications http://www.ripublication.com Classification Using ANN:
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationSeminar - Organic Computing
Seminar - Organic Computing Self-Organisation of OC-Systems Markus Franke 25.01.2006 Typeset by FoilTEX Timetable 1. Overview 2. Characteristics of SO-Systems 3. Concern with Nature 4. Design-Concepts
More informationCS Machine Learning
CS 478 - Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing
More informationAbstractions and the Brain
Abstractions and the Brain Brian D. Josephson Department of Physics, University of Cambridge Cavendish Lab. Madingley Road Cambridge, UK. CB3 OHE bdj10@cam.ac.uk http://www.tcm.phy.cam.ac.uk/~bdj10 ABSTRACT
More informationSystem Implementation for SemEval-2017 Task 4 Subtask A Based on Interpolated Deep Neural Networks
System Implementation for SemEval-2017 Task 4 Subtask A Based on Interpolated Deep Neural Networks 1 Tzu-Hsuan Yang, 2 Tzu-Hsuan Tseng, and 3 Chia-Ping Chen Department of Computer Science and Engineering
More informationA Comparison of Annealing Techniques for Academic Course Scheduling
A Comparison of Annealing Techniques for Academic Course Scheduling M. A. Saleh Elmohamed 1, Paul Coddington 2, and Geoffrey Fox 1 1 Northeast Parallel Architectures Center Syracuse University, Syracuse,
More information(Sub)Gradient Descent
(Sub)Gradient Descent CMSC 422 MARINE CARPUAT marine@cs.umd.edu Figures credit: Piyush Rai Logistics Midterm is on Thursday 3/24 during class time closed book/internet/etc, one page of notes. will include
More informationA Reinforcement Learning Variant for Control Scheduling
A Reinforcement Learning Variant for Control Scheduling Aloke Guha Honeywell Sensor and System Development Center 3660 Technology Drive Minneapolis MN 55417 Abstract We present an algorithm based on reinforcement
More informationTransfer Learning Action Models by Measuring the Similarity of Different Domains
Transfer Learning Action Models by Measuring the Similarity of Different Domains Hankui Zhuo 1, Qiang Yang 2, and Lei Li 1 1 Software Research Institute, Sun Yat-sen University, Guangzhou, China. zhuohank@gmail.com,lnslilei@mail.sysu.edu.cn
More informationLinking Task: Identifying authors and book titles in verbose queries
Linking Task: Identifying authors and book titles in verbose queries Anaïs Ollagnier, Sébastien Fournier, and Patrice Bellot Aix-Marseille University, CNRS, ENSAM, University of Toulon, LSIS UMR 7296,
More informationSARDNET: A Self-Organizing Feature Map for Sequences
SARDNET: A Self-Organizing Feature Map for Sequences Daniel L. James and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 dljames,risto~cs.utexas.edu
More informationProposal of Pattern Recognition as a necessary and sufficient principle to Cognitive Science
Proposal of Pattern Recognition as a necessary and sufficient principle to Cognitive Science Gilberto de Paiva Sao Paulo Brazil (May 2011) gilbertodpaiva@gmail.com Abstract. Despite the prevalence of the
More informationCROSS-LANGUAGE INFORMATION RETRIEVAL USING PARAFAC2
1 CROSS-LANGUAGE INFORMATION RETRIEVAL USING PARAFAC2 Peter A. Chew, Brett W. Bader, Ahmed Abdelali Proceedings of the 13 th SIGKDD, 2007 Tiago Luís Outline 2 Cross-Language IR (CLIR) Latent Semantic Analysis
More informationAssignment 1: Predicting Amazon Review Ratings
Assignment 1: Predicting Amazon Review Ratings 1 Dataset Analysis Richard Park r2park@acsmail.ucsd.edu February 23, 2015 The dataset selected for this assignment comes from the set of Amazon reviews for
More informationAustralian Journal of Basic and Applied Sciences
AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com Feature Selection Technique Using Principal Component Analysis For Improving Fuzzy C-Mean
More informationDeveloping True/False Test Sheet Generating System with Diagnosing Basic Cognitive Ability
Developing True/False Test Sheet Generating System with Diagnosing Basic Cognitive Ability Shih-Bin Chen Dept. of Information and Computer Engineering, Chung-Yuan Christian University Chung-Li, Taiwan
More informationOrdered Incremental Training with Genetic Algorithms
Ordered Incremental Training with Genetic Algorithms Fangming Zhu, Sheng-Uei Guan* Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore
More informationImplementation of Genetic Algorithm to Solve Travelling Salesman Problem with Time Window (TSP-TW) for Scheduling Tourist Destinations in Malang City
Journal of Information Technology and Computer Science Volume 2, Number 1, 2017, pp. 1-10 Journal Homepage: www.jitecs.ub.ac.id Implementation of Genetic Algorithm to Solve Travelling Salesman Problem
More informationDiscriminative Learning of Beam-Search Heuristics for Planning
Discriminative Learning of Beam-Search Heuristics for Planning Yuehua Xu School of EECS Oregon State University Corvallis,OR 97331 xuyu@eecs.oregonstate.edu Alan Fern School of EECS Oregon State University
More informationGenerative models and adversarial training
Day 4 Lecture 1 Generative models and adversarial training Kevin McGuinness kevin.mcguinness@dcu.ie Research Fellow Insight Centre for Data Analytics Dublin City University What is a generative model?
More informationCooperative evolutive concept learning: an empirical study
Cooperative evolutive concept learning: an empirical study Filippo Neri University of Piemonte Orientale Dipartimento di Scienze e Tecnologie Avanzate Piazza Ambrosoli 5, 15100 Alessandria AL, Italy Abstract
More informationRule discovery in Web-based educational systems using Grammar-Based Genetic Programming
Data Mining VI 205 Rule discovery in Web-based educational systems using Grammar-Based Genetic Programming C. Romero, S. Ventura, C. Hervás & P. González Universidad de Córdoba, Campus Universitario de
More informationUniversity of Groningen. Systemen, planning, netwerken Bosman, Aart
University of Groningen Systemen, planning, netwerken Bosman, Aart IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document
More informationAgent-Based Software Engineering
Agent-Based Software Engineering Learning Guide Information for Students 1. Description Grade Module Máster Universitario en Ingeniería de Software - European Master on Software Engineering Advanced Software
More informationP. Belsis, C. Sgouropoulou, K. Sfikas, G. Pantziou, C. Skourlas, J. Varnas
Exploiting Distance Learning Methods and Multimediaenhanced instructional content to support IT Curricula in Greek Technological Educational Institutes P. Belsis, C. Sgouropoulou, K. Sfikas, G. Pantziou,
More informationExperiments with SMS Translation and Stochastic Gradient Descent in Spanish Text Author Profiling
Experiments with SMS Translation and Stochastic Gradient Descent in Spanish Text Author Profiling Notebook for PAN at CLEF 2013 Andrés Alfonso Caurcel Díaz 1 and José María Gómez Hidalgo 2 1 Universidad
More informationCOMPUTER-ASSISTED INDEPENDENT STUDY IN MULTIVARIATE CALCULUS
COMPUTER-ASSISTED INDEPENDENT STUDY IN MULTIVARIATE CALCULUS L. Descalço 1, Paula Carvalho 1, J.P. Cruz 1, Paula Oliveira 1, Dina Seabra 2 1 Departamento de Matemática, Universidade de Aveiro (PORTUGAL)
More informationPOS tagging of Chinese Buddhist texts using Recurrent Neural Networks
POS tagging of Chinese Buddhist texts using Recurrent Neural Networks Longlu Qin Department of East Asian Languages and Cultures longlu@stanford.edu Abstract Chinese POS tagging, as one of the most important
More informationRule Learning with Negation: Issues Regarding Effectiveness
Rule Learning with Negation: Issues Regarding Effectiveness Stephanie Chua, Frans Coenen, and Grant Malcolm University of Liverpool Department of Computer Science, Ashton Building, Ashton Street, L69 3BX
More informationProblems of the Arabic OCR: New Attitudes
Problems of the Arabic OCR: New Attitudes Prof. O.Redkin, Dr. O.Bernikova Department of Asian and African Studies, St. Petersburg State University, St Petersburg, Russia Abstract - This paper reviews existing
More informationSelf Study Report Computer Science
Computer Science undergraduate students have access to undergraduate teaching, and general computing facilities in three buildings. Two large classrooms are housed in the Davis Centre, which hold about
More informationDisambiguation of Thai Personal Name from Online News Articles
Disambiguation of Thai Personal Name from Online News Articles Phaisarn Sutheebanjard Graduate School of Information Technology Siam University Bangkok, Thailand mr.phaisarn@gmail.com Abstract Since online
More informationAutomating the E-learning Personalization
Automating the E-learning Personalization Fathi Essalmi 1, Leila Jemni Ben Ayed 1, Mohamed Jemni 1, Kinshuk 2, and Sabine Graf 2 1 The Research Laboratory of Technologies of Information and Communication
More informationThe 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X
The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, 2013 10.12753/2066-026X-13-154 DATA MINING SOLUTIONS FOR DETERMINING STUDENT'S PROFILE Adela BÂRA,
More informationUnderstanding and Interpreting the NRC s Data-Based Assessment of Research-Doctorate Programs in the United States (2010)
Understanding and Interpreting the NRC s Data-Based Assessment of Research-Doctorate Programs in the United States (2010) Jaxk Reeves, SCC Director Kim Love-Myers, SCC Associate Director Presented at UGA
More informationWhile you are waiting... socrative.com, room number SIMLANG2016
While you are waiting... socrative.com, room number SIMLANG2016 Simulating Language Lecture 4: When will optimal signalling evolve? Simon Kirby simon@ling.ed.ac.uk T H E U N I V E R S I T Y O H F R G E
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationLearning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models
Learning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models Stephan Gouws and GJ van Rooyen MIH Medialab, Stellenbosch University SOUTH AFRICA {stephan,gvrooyen}@ml.sun.ac.za
More informationSpeeding Up Reinforcement Learning with Behavior Transfer
Speeding Up Reinforcement Learning with Behavior Transfer Matthew E. Taylor and Peter Stone Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188 {mtaylor, pstone}@cs.utexas.edu
More informationarxiv: v1 [cs.lg] 3 May 2013
Feature Selection Based on Term Frequency and T-Test for Text Categorization Deqing Wang dqwang@nlsde.buaa.edu.cn Hui Zhang hzhang@nlsde.buaa.edu.cn Rui Liu, Weifeng Lv {liurui,lwf}@nlsde.buaa.edu.cn arxiv:1305.0638v1
More informationGuide to Teaching Computer Science
Guide to Teaching Computer Science Orit Hazzan Tami Lapidot Noa Ragonis Guide to Teaching Computer Science An Activity-Based Approach Dr. Orit Hazzan Associate Professor Technion - Israel Institute of
More informationA Case Study: News Classification Based on Term Frequency
A Case Study: News Classification Based on Term Frequency Petr Kroha Faculty of Computer Science University of Technology 09107 Chemnitz Germany kroha@informatik.tu-chemnitz.de Ricardo Baeza-Yates Center
More informationLanguage properties and Grammar of Parallel and Series Parallel Languages
arxiv:1711.01799v1 [cs.fl] 6 Nov 2017 Language properties and Grammar of Parallel and Series Parallel Languages Mohana.N 1, Kalyani Desikan 2 and V.Rajkumar Dare 3 1 Division of Mathematics, School of
More informationPython Machine Learning
Python Machine Learning Unlock deeper insights into machine learning with this vital guide to cuttingedge predictive analytics Sebastian Raschka [ PUBLISHING 1 open source I community experience distilled
More informationMachine Learning from Garden Path Sentences: The Application of Computational Linguistics
Machine Learning from Garden Path Sentences: The Application of Computational Linguistics http://dx.doi.org/10.3991/ijet.v9i6.4109 J.L. Du 1, P.F. Yu 1 and M.L. Li 2 1 Guangdong University of Foreign Studies,
More informationarxiv: v1 [math.at] 10 Jan 2016
THE ALGEBRAIC ATIYAH-HIRZEBRUCH SPECTRAL SEQUENCE OF REAL PROJECTIVE SPECTRA arxiv:1601.02185v1 [math.at] 10 Jan 2016 GUOZHEN WANG AND ZHOULI XU Abstract. In this note, we use Curtis s algorithm and the
More informationErkki Mäkinen State change languages as homomorphic images of Szilard languages
Erkki Mäkinen State change languages as homomorphic images of Szilard languages UNIVERSITY OF TAMPERE SCHOOL OF INFORMATION SCIENCES REPORTS IN INFORMATION SCIENCES 48 TAMPERE 2016 UNIVERSITY OF TAMPERE
More informationMTH 215: Introduction to Linear Algebra
MTH 215: Introduction to Linear Algebra Fall 2017 University of Rhode Island, Department of Mathematics INSTRUCTOR: Jonathan A. Chávez Casillas E-MAIL: jchavezc@uri.edu LECTURE TIMES: Tuesday and Thursday,
More informationQuickStroke: An Incremental On-line Chinese Handwriting Recognition System
QuickStroke: An Incremental On-line Chinese Handwriting Recognition System Nada P. Matić John C. Platt Λ Tony Wang y Synaptics, Inc. 2381 Bering Drive San Jose, CA 95131, USA Abstract This paper presents
More informationTABLE OF CONTENTS TABLE OF CONTENTS COVER PAGE HALAMAN PENGESAHAN PERNYATAAN NASKAH SOAL TUGAS AKHIR ACKNOWLEDGEMENT FOREWORD
TABLE OF CONTENTS TABLE OF CONTENTS COVER PAGE HALAMAN PENGESAHAN PERNYATAAN NASKAH SOAL TUGAS AKHIR ACKNOWLEDGEMENT FOREWORD TABLE OF CONTENTS LIST OF FIGURES LIST OF TABLES LIST OF APPENDICES LIST OF
More informationA Comparison of Two Text Representations for Sentiment Analysis
010 International Conference on Computer Application and System Modeling (ICCASM 010) A Comparison of Two Text Representations for Sentiment Analysis Jianxiong Wang School of Computer Science & Educational
More informationClass-Discriminative Weighted Distortion Measure for VQ-Based Speaker Identification
Class-Discriminative Weighted Distortion Measure for VQ-Based Speaker Identification Tomi Kinnunen and Ismo Kärkkäinen University of Joensuu, Department of Computer Science, P.O. Box 111, 80101 JOENSUU,
More informationCOMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR
COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR ROLAND HAUSSER Institut für Deutsche Philologie Ludwig-Maximilians Universität München München, West Germany 1. CHOICE OF A PRIMITIVE OPERATION The
More informationUniversity of Victoria School of Exercise Science, Physical and Health Education EPHE 245 MOTOR LEARNING. Calendar Description Units: 1.
University of Victoria School of Exercise Science, Physical and Health Education EPHE 245 MOTOR LEARNING Calendar Description Units: 1.5 Hours: 3-2 Neural and cognitive processes underlying human skilled
More informationEvaluation of Usage Patterns for Web-based Educational Systems using Web Mining
Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining Dave Donnellan, School of Computer Applications Dublin City University Dublin 9 Ireland daviddonnellan@eircom.net Claus Pahl
More informationEvaluation of Usage Patterns for Web-based Educational Systems using Web Mining
Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining Dave Donnellan, School of Computer Applications Dublin City University Dublin 9 Ireland daviddonnellan@eircom.net Claus Pahl
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Ch 2 Test Remediation Work Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Provide an appropriate response. 1) High temperatures in a certain
More informationLearning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for
Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for Email Marilyn A. Walker Jeanne C. Fromer Shrikanth Narayanan walker@research.att.com jeannie@ai.mit.edu shri@research.att.com
More informationIdentification of Opinion Leaders Using Text Mining Technique in Virtual Community
Identification of Opinion Leaders Using Text Mining Technique in Virtual Community Chihli Hung Department of Information Management Chung Yuan Christian University Taiwan 32023, R.O.C. chihli@cycu.edu.tw
More informationApplication of Visualization Technology in Professional Teaching
Application of Visualization Technology in Professional Teaching LI Baofu, SONG Jiayong School of Energy Science and Engineering Henan Polytechnic University, P. R. China, 454000 libf@hpu.edu.cn Abstract:
More informationMachine Learning and Data Mining. Ensembles of Learners. Prof. Alexander Ihler
Machine Learning and Data Mining Ensembles of Learners Prof. Alexander Ihler Ensemble methods Why learn one classifier when you can learn many? Ensemble: combine many predictors (Weighted) combina
More informationHow do adults reason about their opponent? Typologies of players in a turn-taking game
How do adults reason about their opponent? Typologies of players in a turn-taking game Tamoghna Halder (thaldera@gmail.com) Indian Statistical Institute, Kolkata, India Khyati Sharma (khyati.sharma27@gmail.com)
More informationSolving Combinatorial Optimization Problems Using Genetic Algorithms and Ant Colony Optimization
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 8-2012 Solving Combinatorial Optimization Problems Using Genetic Algorithms and
More informationOCR for Arabic using SIFT Descriptors With Online Failure Prediction
OCR for Arabic using SIFT Descriptors With Online Failure Prediction Andrey Stolyarenko, Nachum Dershowitz The Blavatnik School of Computer Science Tel Aviv University Tel Aviv, Israel Email: stloyare@tau.ac.il,
More informationSwitchboard Language Model Improvement with Conversational Data from Gigaword
Katholieke Universiteit Leuven Faculty of Engineering Master in Artificial Intelligence (MAI) Speech and Language Technology (SLT) Switchboard Language Model Improvement with Conversational Data from Gigaword
More informationAMULTIAGENT system [1] can be defined as a group of
156 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART C: APPLICATIONS AND REVIEWS, VOL. 38, NO. 2, MARCH 2008 A Comprehensive Survey of Multiagent Reinforcement Learning Lucian Buşoniu, Robert Babuška,
More informationMaximizing Learning Through Course Alignment and Experience with Different Types of Knowledge
Innov High Educ (2009) 34:93 103 DOI 10.1007/s10755-009-9095-2 Maximizing Learning Through Course Alignment and Experience with Different Types of Knowledge Phyllis Blumberg Published online: 3 February
More informationIntroduction to Simulation
Introduction to Simulation Spring 2010 Dr. Louis Luangkesorn University of Pittsburgh January 19, 2010 Dr. Louis Luangkesorn ( University of Pittsburgh ) Introduction to Simulation January 19, 2010 1 /
More informationArtificial Neural Networks written examination
1 (8) Institutionen för informationsteknologi Olle Gällmo Universitetsadjunkt Adress: Lägerhyddsvägen 2 Box 337 751 05 Uppsala Artificial Neural Networks written examination Monday, May 15, 2006 9 00-14
More informationApplication of Multimedia Technology in Vocabulary Learning for Engineering Students
Application of Multimedia Technology in Vocabulary Learning for Engineering Students https://doi.org/10.3991/ijet.v12i01.6153 Xue Shi Luoyang Institute of Science and Technology, Luoyang, China xuewonder@aliyun.com
More informationAn OO Framework for building Intelligence and Learning properties in Software Agents
An OO Framework for building Intelligence and Learning properties in Software Agents José A. R. P. Sardinha, Ruy L. Milidiú, Carlos J. P. Lucena, Patrick Paranhos Abstract Software agents are defined as
More informationThe Strong Minimalist Thesis and Bounded Optimality
The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this
More informationReducing Features to Improve Bug Prediction
Reducing Features to Improve Bug Prediction Shivkumar Shivaji, E. James Whitehead, Jr., Ram Akella University of California Santa Cruz {shiv,ejw,ram}@soe.ucsc.edu Sunghun Kim Hong Kong University of Science
More informationData Integration through Clustering and Finding Statistical Relations - Validation of Approach
Data Integration through Clustering and Finding Statistical Relations - Validation of Approach Marek Jaszuk, Teresa Mroczek, and Barbara Fryc University of Information Technology and Management, ul. Sucharskiego
More informationClassifying combinations: Do students distinguish between different types of combination problems?
Classifying combinations: Do students distinguish between different types of combination problems? Elise Lockwood Oregon State University Nicholas H. Wasserman Teachers College, Columbia University William
More informationCSL465/603 - Machine Learning
CSL465/603 - Machine Learning Fall 2016 Narayanan C Krishnan ckn@iitrpr.ac.in Introduction CSL465/603 - Machine Learning 1 Administrative Trivia Course Structure 3-0-2 Lecture Timings Monday 9.55-10.45am
More informationMajor Milestones, Team Activities, and Individual Deliverables
Major Milestones, Team Activities, and Individual Deliverables Milestone #1: Team Semester Proposal Your team should write a proposal that describes project objectives, existing relevant technology, engineering
More informationMULTILINGUAL INFORMATION ACCESS IN DIGITAL LIBRARY
MULTILINGUAL INFORMATION ACCESS IN DIGITAL LIBRARY Chen, Hsin-Hsi Department of Computer Science and Information Engineering National Taiwan University Taipei, Taiwan E-mail: hh_chen@csie.ntu.edu.tw Abstract
More informationBiological Sciences, BS and BA
Student Learning Outcomes Assessment Summary Biological Sciences, BS and BA College of Natural Science and Mathematics AY 2012/2013 and 2013/2014 1. Assessment information collected Submitted by: Diane
More informationLecture 10: Reinforcement Learning
Lecture 1: Reinforcement Learning Cognitive Systems II - Machine Learning SS 25 Part III: Learning Programs and Strategies Q Learning, Dynamic Programming Lecture 1: Reinforcement Learning p. Motivation
More informationAnalysis of Emotion Recognition System through Speech Signal Using KNN & GMM Classifier
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 2, Ver.1 (Mar - Apr.2015), PP 55-61 www.iosrjournals.org Analysis of Emotion
More informationINPE São José dos Campos
INPE-5479 PRE/1778 MONLINEAR ASPECTS OF DATA INTEGRATION FOR LAND COVER CLASSIFICATION IN A NEDRAL NETWORK ENVIRONNENT Maria Suelena S. Barros Valter Rodrigues INPE São José dos Campos 1993 SECRETARIA
More information