Cooperative Interactive Cultural Algorithms Based on Dynamic Knowledge Alliance
|
|
- Robert Crawford
- 6 years ago
- Views:
Transcription
1 Cooperative Interactive Cultural Algorithms Based on Dynamic Knowledge Alliance Yi-nan Guo 1, Shuguo Zhang 1, Jian Cheng 1,2, and Yong Lin 1 1 College of Information and Electronic Engineering, China University of Mining and Technology, Xuzhou, Jiangsu, China nanfly@126.com 2 Department of Automation, Tinghua University, Beijing , China Abstract. In cooperative interactive genetic algorithms, each user evaluates all individuals in every generation through human-machine interface, which makes users tired. So population size and generation are limited. That means nobody can evaluate all individuals in search space, which leads to the deviation between the users best-liked individual and the optimal one by the evolution. In order to speed up the convergence, implicit knowledge denoting users preference is extracted and utized to induce the evolution. In the paper, users having simar preference are further divided into a group by K-means clustering method so as to share knowledge and exchange information each other. We call the group as knowledge alliance. The users included in a knowledge alliance vary dynamically whe their preferences are changed. Taken a fashion evolutionary design system as example, simulation results show that the algorithm speeds up the convergence and decreases the number of individuals evaluated by users. This can effectively alleviate users fatigue. Keywords: Cooperative Interactive Culture Algorithms, K-means, Dynamic Knowledge Alliance. 1 Introduction In interactive genetic algorithms (IGAs),the fitness values of individuals are evaluated by human[1]. The evolution operations of IGAs are usually implemented in a computer node for one user. Because human is easy to feel tired when he does one work for a long time, the generation and population size are limited. So it is difficult to obtain the satisfying solution in limited generation aiming at the optimization problems with large search space. Moreover, there are often more than one users participating in the evolution through human-machine interfaces in different computer nodes so as to obtain the satisfying individuals meeting themselves needs. In order to improve the performances of the evolution and effectively alleviate users fatigue, Guo[2] introduced dual structure of cultural algorithms into IGAs. Frequency pattern mining methods are adopted to extract key gene-meaning-unit which reflects users preferences in the evolution as implicit knowledge. Aiming at multiuser IGAs, many researchers proposed the methods to exchange the evolution information among users. This can improve the diversity of population in each clients and H. Deng et al. (Eds.): AICI 2011, Part III, LNAI 7004, pp , Springer-Verlag Berlin Heidelberg 2011
2 Cooperative Interactive Cultural Algorithms Based on Dynamic Knowledge Alliance 205 the convergence. Based on the satisfying degree of group decision-making and users preferences, Sun [3] proposed a distributed collaborative interactive genetic algorithm. How to confirm the number of sharing individuals and select them are lustrated. Mitsunori [4] introduced asynchronous collaborative IGA. An elite sample database is but to solve the limits at time and space in parallel IGAs. Tomoyukii [5] gave the idea about collaboration into online shopping navigation system. The satisfying products are obtained automatically in terms of users current preferences. Based on interactive cultural algorithms (ICAs), Guo [6] further proposed cooperative ICAs. Each user s preference is noticed to other users by adopting IP multicast technology so as to exchange the evolution information in knowledge level. So the effective experiences of other users are used for reference in the co-evolution. In this method, the cost of network communication is increasing along with the increasing number of users. In order to avoid network congestion caused by knowledge sharing among all users, a clustering method for users based on knowledge alliance is proposed. The users with simar preferences are classified into a knowledge alliance. The information is noticed to all user inside the alliance by IP broadcast. Common knowledge reflecting all users common preferences is exchanged among alliances by tree network. This can effectively decrease the cost for information transfer. 2 Algorithm Description Multi-user cooperative interactive culture algorithm is simar to the traditional culture algorithms. They are essentially dual-layer evolution model. IGA is implemented in population space. In each independent computer node, human gives qualitative evaluation for all individuals via human-machine interface. The evolution operations including selection strategy, crossover operator and mutation operator are carried out based on the evaluated fitness values. Some better individuals are selected to belief space as samples by acceptance function in terms of certain rules. Obviously, these samples contain the information about users personal preference. In belief space, knowledge reflecting users preference is extracted from samples by frequency pattern mining in every independent computer node. It is shared with other users. Considering the communication cost of information migration among users, a hierarchical sharing mechanism of knowledge based on knowledge alliance is proposed by adopting construction method of agent alliances in multi-agent system. Fig. 1. Dynamic knowledge alliance in belief space
3 206 Y.-n. Guo et al. As shown in Fig.1, K-means clustering algorithm is used to partition users to knowledge alliances. Here, there are K alliances. Each user is described by a black dot in the alliance. Users belonging to the same knowledge alliance have simar preferences. The common knowledge is migrated among alliances in the manner of broadcast. When a alliance receives migrated information from other alliances, migrated knowledge wl be integrated with its own common knowledge. Then inconsistent information is noticed to all users in the alliance by IP broadcast. This hierarchical information exchange mechanisms can decrease network communication cost and effectively share evolution information among users. 3 Extraction and Utization of Knowledge in ICAs In ICAs, users preferences are extracted from the better individuals as knowledge. The individuals are usually encoded by binary. In existing knowledge extraction methods, one or more bits with large percentage are obtained by statistical methods directly. However, the relationship among the gene-meaning-units cannot be effectively reflected. So an extraction method based on frequency pattern mining is presented. Suppose [ 0, f max ] is the range of individuals fitness values. Let E (t) be the individual set meeting f ( x ) [ 0.5 f f i ]. The algorithm s steps are shown as follows: max, max Step1: In E (t), each individual is encoded by binary. Suppose there are G genemeaning-units in an individual. Each gene-meaning-units x ij is converted into nonoverlapping real coding x ij [8] and saved into database Q. x ij = Ω j x, j = 0,1,2... G (1) ij Step2: After the database Q is scanned, the frequent items and their support counts is collected. Then FP-tree is constructed based on the minimum support counts. If FPtree contains a single path, the frequent patterns corresponding to the path are directly formed. Otherwise, the condition pattern database for each node is generated. The condition FP-tree is recursively obtained to get the frequent patterns. Step3: Each gene-meaning-units with certain values in obtained frequent patterns is transformed to corresponding gene-meaning-unit value with binary genotype by formula (2). Other uncertained bits are described as "*". x ij x ij Ω j 1, j = 0,1,2... = G (2) Here, the converted frequent patterns reflect the gene-meaning-units with largest frequency and maximum correlation in the evolution. They also note the most-liked favorite gene by users, called knowledge of users preferences. In this paper, frequent patterns are adopted to induce the evolution in next generation. If each bit of x ij is 0 or 1, the phenotype of this gene-meaning-unit is directly shown in human-machine interface to be evaluated. If x ij = * * is uncertain, it is add with own knowledge. If the uncertain genemeaning-unit stl exists, it is randomly generated by 0 or 1. In order to reserve own q
4 Cooperative Interactive Cultural Algorithms Based on Dynamic Knowledge Alliance 207 preference, the number of individuals influenced by migrated common knowledge are limited. Suppose knowledge influencing rate is γ ( 0Â1 ). Let pop is the population size. M is the number of individuals influenced by knowledge. The constrain for influenced population size is M γ pop. 4 Construction of Dynamic Knowledge Alliances Due to humans cognitive is variable, users preferences may change along with the evolution. So it s difficult to obtain the labeled training data reflecting user fixed preferences. Because K-means clustering method does not dependent on prior knowledge, a classification method for users by this algorithm is given. 4.1 Construction of Alliance Based on K-Means Clustering Method According to the knowledge extracted from computer nodes, the users having simar preference are collected by using K-means clustering method. A knowledge alliance for the users having common preference is constructed. Suppose { FP 1, FP2,, FP N } is users preferences set. N is the number of users. K users preferences are randomly selected as initial cluster centers expressed by C i ( i = 1,, K). The simarity of categories between the initial cluster center and jth users preference is calculated. S i j 1 = G K G δ ( FP jl, C ) (3) i = 1 l = 1 1 δ ( FP jl, C ) = 0 if FP if FP jl jl = C C (4) Here, δ ( FP jl, C ) describes the correlation between two frequent patterns. Based on the i simarity of categories, user is classified into the category with max S j. Thus, N users i are divided into K knowledge alliances according to their evolution knowledge. Then the cluster centers in all knowledge alliances denoted by Ci = C i1, Ci 2, C ig are adjusted according to the above classification results unt they are no longer changed. C = 1 N N i i i = 1 The number of users in a knowledge alliance is dynamically changed along with the evolution and the variation of users preferences. After the evaluation by users is finished in each generation, the simarity of categories between user s evolution knowledge and the corresponding cluster center is calculated. If the simarity of category is less than a certain threshold, the member of knowledge alliance does not change. If the simarity of category exceeds a certain threshold, this user exits from corresponding alliance. The simarity of categories between this user and other cluster centers are computed. The user joins an alliance with the maximum simarity. Then the cluster center of corresponding alliance is modified. C (5)
5 208 Y.-n. Guo et al. 4.2 Knowledge Migration Strategy In cooperative ICAs, hierarchical knowledge migration strategy is adopted. It contains the user-oriented knowledge migration within the alliance and the alliance-oriented knowledge migration among alliances. A) The migration mode After the evolution operations in each generation is completed, knowledge reflecting user s preference is extracted and sent to the server. The classification is done by the server before the evolution in next generation. Because human has own cognition and the degree of fatigue in the evaluation for individuals or the time spending on the evaluation is different, knowledge from different users may be asynchronous. So asynchronous knowledge migration is used in the paper. In asynchronous knowledge migration strategy, knowledge alliances may be constructed when knowledge from some of users is sent to the servers. But the maximum proportion of users participating in the classification must be ensured. Assume that T i is the evaluation time for ith user from the 1th generation to the generation sending knowledge to the sever at first time. If more than 0.8N users have submitted the knowledge to the sever, knowledge alliances are constructed for the first time. Users are gradually famiar with the system and know which kinds of individuals they like. So the evaluation time is decreasing. The interval for knowledge migration among alliances is defined by average T i, expressed by τ. Knowledge migration among alliances is done every iτ generation. N 1 = N i = τ T i (6) B) Knowledge fusion method After an alliance receives common knowledge from other alliances, the knowledge is sent to all users in the alliance in the form of broadcast and used to induce the evolution. Here, the gene-meaning-unit is used as a unit. Migrated common knowledge and self knowledge are fused by and operation. Suppose g is the number of the genemeaning-units with certain values in self knowledge of alliance M i. g denotes the gene-meaning-units set with certain values from common knowledge of alliance M j. Then the effect of common knowledge on alliance M i is analyzed in two aspects: If g g, the self knowledge of the alliance is replaced by common knowledge from M j to induce the evolution. If g g and g g Φ, the genes with same values are retained. At the genes with different values, M i is replaced by the corresponding parts of the knowledge from M j. If g g and g g = Φ, common knowledge from M j has a direct impact on the evolution. c ) Communication complexity analysis of the algorithm In cooperative ICAs, a dual-layer communication structure is formed by the establishment of dynamic knowledge alliance. Compared with CICAs without knowledge alliance, the communication complexity is further analyzed as follows.
6 Cooperative Interactive Cultural Algorithms Based on Dynamic Knowledge Alliance 209 No classification for users: Suppose there are N users participating in the evolution. If users are not classified, the knowledge reflecting users preferences is notified to other users in the form of broadcast in each generation. Therefore, the communication complexity is N(N-1). Classification for users: Suppose there are K alliances formed in the evolution. If users are classified to knowledge alliances, the common knowledge reflecting users same preference in a alliance is notified to other users in the alliance in the form of broadcast. Two layer communication mode including information exchange within and among alliances is formed. So the communication complexity is N+K(K-1). Obviously, the larger N is, the communication complexity of CICA with knowledge alliances is less. This wl make the quantity of exchanged information less so as to effectively avoid network congestion in the communication process. 5 Simulation Results and Their Analysis In order to validate the rationality of the algorithm, fashion evolutionary design system is taken as examples. The goal of fashion evolutionary design system is to find the satisfying dress for users. A dress is composed of coat and skirt. Each part includes pattern and color, which are described by binary code with nine bits [12]. The same evolution operations and parameters are adopted in each computer node. Roulette selection method combing with elitist strategy are used. Multi-point crossover operator and one-point mutation operator are adopted. The detaed parameters values are: f max =100, pop=8, Pc=0.4, Pm=0.01, T=200, N=10, K=3. A) Dynamic analysis of knowledge alliance Ten users are participated in the evolution. The same evolutionary operations are done by everyone in each computer node. The simulation results are shown in Table.1. All users can find their own satisfying solutions. But the evaluation time and the evaluated individuals are different. That means everybody has different cognition. The knowledge alliance containing certain users varies along with the evolution, as shown in Table.2. Each user participates in the evolution asynchronously. The alliance containing them varies along with the evolution. If the evolution is finished in some computer node, corresponding user wl not belong to any alliance. Table 1. The simulation results User ID iteration evaluation time evaluated individuals whether the satisfying dress is found yes yes yes yes yes yes yes yes yes yes
7 210 Y.-n. Guo et al. Table 2. The variation of knowledge alliance times th alliance 4/5/8 1/5/8 6/9 4 2th alliance 1/2/10 2/3/4/10 3/10 3/10 3 th alliance 4/5/8 6/7/9 2/7/9 2/7 The variation of alliances cluster centers is shown in Table.3. Along with the evolution, one user may belong to different alliances. So the cluster centers may be changed. It is obvious that the number of certain gene-meaning-unit in cluster centers is increasing. That means the accuracy of common knowledge is increasing. Common knowledge is exchanged in an alliance or among the alliances so as to guide the evolution. This improves the diversity of population and accelerates the convergence. Table 3. The variation of cluster centers times 1th cluster center 2th cluster center 3th cluster center 1 ************** ************* *****10001******** ********* *****0011**** *****10001******** ***** *****0011**** ******** ***** ***** **** B) Comparison of performances among different algorithms In order to show the important role of knowledge alliance to improve the performances of cooperative ICAs(CICADKA), it is compared with cooperative interactive cultural algorithms without users clustering(cicas) and traditional interactive genetic algorithm(igas). The simulation results are shown in Table.4. Table 4. Comparison of performances among different algorithms algorithms generation time the evaluated individuals satisfaction rate CICADKAs % CIGAs % IGAs % CICADKA can effectively decrease the number of individuals evaluated by users and find satisfying solutions in a shorter time and smaller generation. Compared with traditional IGAs, CICADKA not only improves the rate of obtained satisfying individuals, but also accelerated the convergence at the same time. In conclusion, this algorithm is consistent with the principles of alleviating users fatigue.
8 Cooperative Interactive Cultural Algorithms Based on Dynamic Knowledge Alliance Conclusions A multi-user cooperative ICAs with dynamic knowledge alliances is proposed. In each computer node, interactive cultural algorithms based on frequency pattern mining are done. Based on the knowledge given by nodes, users are dynamic classified to many alliances according to their preference by using K-means clustering method. Common knowledge is shared among these alliances. Knowledge is noticed to everyone inside the alliance by broadcast. Take fashion evolutionary design system as example, more than one user participates in the evolution. Simulation results show that the proposed algorithm can alleviate user s fatigue more and speed up the convergence. In a word, cooperative ICAs based on dynamic knowledge alliances is a feasible and effective multi-user interactive evolutionary algorithm. Acknowledgment. This work was supported by National Natural Science Foundation of China under Grant , Natural Science Foundation of Jiangsu under Grant BK , the China Postdoctoral Science Foundation Funded Project under Grant References 1. Takagi, H.: Interactive evolutionary computation: fusion of the capabities of EC optimization and human evaluation. Proceedings of the IEEE 89(9), (2001) 2. Guo, Y.-N., Lin, Y.: Interactive genetic algorithms with frequent-pattern mining. In: Proceedings of the 6th International Conference on Natural Computation, pp (2010) 3. Sun, X.-Y., Wang, X.-F., Gong, D.-W.: A distributed co-interactive genetic algorithm and its applications to group decision-making. Information and Control 36(5), (2007) 4. Miki, M., Yamamoto, Y., Wake, S.: Global asynchronous distributed interactive genetic algorithm. In: 2006 IEEE International Conference on Systems, Man and Cybernetics, pp (2006) 5. Hiroyasu, T., Yokouchi, H.: Extraction of Design Variables using Collaborative Ftering for Interactive Genetic Algorithms. In: IEEE International Conference on Fuzzy Systems, pp IEEE, Piscataway (2009) 6. Guo, Y.-N., Lin, Y., Yang, M., Zhang, S.: User s preference aggregation based on parallel interactive genetic algorithms. Applied Mechanics and Materials Journal 34, (2010) 7. Wang, J.P., Chen, H., Xu, Y., et al.: An architecture of agent-based intelligent control systems. In: Proceedings of the World Congress on Intelligent Control and Automation, pp IEEE, Piscataway (2000) 8. Le, M.N., Ong, Y.S.: A frequent pattern mining algorithm for understanding genetic algorithms. In: International Conference on Natural Computation, pp IEEE, Piscataway (2008)
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 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 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 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 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 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 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 informationFUZZY EXPERT. Dr. Kasim M. Al-Aubidy. Philadelphia University. Computer Eng. Dept February 2002 University of Damascus-Syria
FUZZY EXPERT SYSTEMS 16-18 18 February 2002 University of Damascus-Syria Dr. Kasim M. Al-Aubidy Computer Eng. Dept. Philadelphia University What is Expert Systems? ES are computer programs that emulate
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 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 informationMining Association Rules in Student s Assessment Data
www.ijcsi.org 211 Mining Association Rules in Student s Assessment Data Dr. Varun Kumar 1, Anupama Chadha 2 1 Department of Computer Science and Engineering, MVN University Palwal, Haryana, India 2 Anupama
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 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 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 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 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 informationOn the Combined Behavior of Autonomous Resource Management Agents
On the Combined Behavior of Autonomous Resource Management Agents Siri Fagernes 1 and Alva L. Couch 2 1 Faculty of Engineering Oslo University College Oslo, Norway siri.fagernes@iu.hio.no 2 Computer Science
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 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 informationSpeech Emotion Recognition Using Support Vector Machine
Speech Emotion Recognition Using Support Vector Machine Yixiong Pan, Peipei Shen and Liping Shen Department of Computer Technology Shanghai JiaoTong University, Shanghai, China panyixiong@sjtu.edu.cn,
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 informationA student diagnosing and evaluation system for laboratory-based academic exercises
A student diagnosing and evaluation system for laboratory-based academic exercises Maria Samarakou, Emmanouil Fylladitakis and Pantelis Prentakis Technological Educational Institute (T.E.I.) of Athens
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 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 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 informationAQUA: An Ontology-Driven Question Answering System
AQUA: An Ontology-Driven Question Answering System Maria Vargas-Vera, Enrico Motta and John Domingue Knowledge Media Institute (KMI) The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom.
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 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 informationBMBF Project ROBUKOM: Robust Communication Networks
BMBF Project ROBUKOM: Robust Communication Networks Arie M.C.A. Koster Christoph Helmberg Andreas Bley Martin Grötschel Thomas Bauschert supported by BMBF grant 03MS616A: ROBUKOM Robust Communication Networks,
More informationAUTOMATED TROUBLESHOOTING OF MOBILE NETWORKS USING BAYESIAN NETWORKS
AUTOMATED TROUBLESHOOTING OF MOBILE NETWORKS USING BAYESIAN NETWORKS R.Barco 1, R.Guerrero 2, G.Hylander 2, L.Nielsen 3, M.Partanen 2, S.Patel 4 1 Dpt. Ingeniería de Comunicaciones. Universidad de Málaga.
More informationWord Segmentation of Off-line Handwritten Documents
Word Segmentation of Off-line Handwritten Documents Chen Huang and Sargur N. Srihari {chuang5, srihari}@cedar.buffalo.edu Center of Excellence for Document Analysis and Recognition (CEDAR), Department
More informationAnalysis of Hybrid Soft and Hard Computing Techniques for Forex Monitoring Systems
Analysis of Hybrid Soft and Hard Computing Techniques for Forex Monitoring Systems Ajith Abraham School of Business Systems, Monash University, Clayton, Victoria 3800, Australia. Email: ajith.abraham@ieee.org
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 informationABSTRACT. A major goal of human genetics is the discovery and validation of genetic polymorphisms
ABSTRACT DEODHAR, SUSHAMNA DEODHAR. Using Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions in Genetic Epidemiology. (Under the direction of Dr. Alison Motsinger-Reif.) A major
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 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 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 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 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 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 informationRadius STEM Readiness TM
Curriculum Guide Radius STEM Readiness TM While today s teens are surrounded by technology, we face a stark and imminent shortage of graduates pursuing careers in Science, Technology, Engineering, and
More informationInternational Series in Operations Research & Management Science
International Series in Operations Research & Management Science Volume 240 Series Editor Camille C. Price Stephen F. Austin State University, TX, USA Associate Series Editor Joe Zhu Worcester Polytechnic
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 informationComputerized Adaptive Psychological Testing A Personalisation Perspective
Psychology and the internet: An European Perspective Computerized Adaptive Psychological Testing A Personalisation Perspective Mykola Pechenizkiy mpechen@cc.jyu.fi Introduction Mixed Model of IRT and ES
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 informationA heuristic framework for pivot-based bilingual dictionary induction
2013 International Conference on Culture and Computing A heuristic framework for pivot-based bilingual dictionary induction Mairidan Wushouer, Toru Ishida, Donghui Lin Department of Social Informatics,
More informationLinking the Ohio State Assessments to NWEA MAP Growth Tests *
Linking the Ohio State Assessments to NWEA MAP Growth Tests * *As of June 2017 Measures of Academic Progress (MAP ) is known as MAP Growth. August 2016 Introduction Northwest Evaluation Association (NWEA
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 informationAn Introduction to Simio for Beginners
An Introduction to Simio for Beginners C. Dennis Pegden, Ph.D. This white paper is intended to introduce Simio to a user new to simulation. It is intended for the manufacturing engineer, hospital quality
More informationLearning Methods in Multilingual Speech Recognition
Learning Methods in Multilingual Speech Recognition Hui Lin Department of Electrical Engineering University of Washington Seattle, WA 98125 linhui@u.washington.edu Li Deng, Jasha Droppo, Dong Yu, and Alex
More informationUsing focal point learning to improve human machine tacit coordination
DOI 10.1007/s10458-010-9126-5 Using focal point learning to improve human machine tacit coordination InonZuckerman SaritKraus Jeffrey S. Rosenschein The Author(s) 2010 Abstract We consider an automated
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 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 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 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 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 informationhave to be modeled) or isolated words. Output of the system is a grapheme-tophoneme conversion system which takes as its input the spelling of words,
A Language-Independent, Data-Oriented Architecture for Grapheme-to-Phoneme Conversion Walter Daelemans and Antal van den Bosch Proceedings ESCA-IEEE speech synthesis conference, New York, September 1994
More informationOn-Line Data Analytics
International Journal of Computer Applications in Engineering Sciences [VOL I, ISSUE III, SEPTEMBER 2011] [ISSN: 2231-4946] On-Line Data Analytics Yugandhar Vemulapalli #, Devarapalli Raghu *, Raja Jacob
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 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 informationApplications of data mining algorithms to analysis of medical data
Master Thesis Software Engineering Thesis no: MSE-2007:20 August 2007 Applications of data mining algorithms to analysis of medical data Dariusz Matyja School of Engineering Blekinge Institute of Technology
More informationFragment Analysis and Test Case Generation using F- Measure for Adaptive Random Testing and Partitioned Block based Adaptive Random Testing
Fragment Analysis and Test Case Generation using F- Measure for Adaptive Random Testing and Partitioned Block based Adaptive Random Testing D. Indhumathi Research Scholar Department of Information Technology
More informationIntegrating E-learning Environments with Computational Intelligence Assessment Agents
Integrating E-learning Environments with Computational Intelligence Assessment Agents Christos E. Alexakos, Konstantinos C. Giotopoulos, Eleni J. Thermogianni, Grigorios N. Beligiannis and Spiridon D.
More informationApplying Fuzzy Rule-Based System on FMEA to Assess the Risks on Project-Based Software Engineering Education
Journal of Software Engineering and Applications, 2017, 10, 591-604 http://www.scirp.org/journal/jsea ISSN Online: 1945-3124 ISSN Print: 1945-3116 Applying Fuzzy Rule-Based System on FMEA to Assess the
More informationMatching Similarity for Keyword-Based Clustering
Matching Similarity for Keyword-Based Clustering Mohammad Rezaei and Pasi Fränti University of Eastern Finland {rezaei,franti}@cs.uef.fi Abstract. Semantic clustering of objects such as documents, web
More informationLearning From the Past with Experiment Databases
Learning From the Past with Experiment Databases Joaquin Vanschoren 1, Bernhard Pfahringer 2, and Geoff Holmes 2 1 Computer Science Dept., K.U.Leuven, Leuven, Belgium 2 Computer Science Dept., University
More informationSemi-Supervised GMM and DNN Acoustic Model Training with Multi-system Combination and Confidence Re-calibration
INTERSPEECH 2013 Semi-Supervised GMM and DNN Acoustic Model Training with Multi-system Combination and Confidence Re-calibration Yan Huang, Dong Yu, Yifan Gong, and Chaojun Liu Microsoft Corporation, One
More informationBUSINESS INTELLIGENCE FROM WEB USAGE MINING
BUSINESS INTELLIGENCE FROM WEB USAGE MINING Ajith Abraham Department of Computer Science, Oklahoma State University, 700 N Greenwood Avenue, Tulsa,Oklahoma 74106-0700, USA, ajith.abraham@ieee.org Abstract.
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 informationMinistry of Education, Republic of Palau Executive Summary
Ministry of Education, Republic of Palau Executive Summary Student Consultant, Jasmine Han Community Partner, Edwel Ongrung I. Background Information The Ministry of Education is one of the eight ministries
More informationAUTOMATIC DETECTION OF PROLONGED FRICATIVE PHONEMES WITH THE HIDDEN MARKOV MODELS APPROACH 1. INTRODUCTION
JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 11/2007, ISSN 1642-6037 Marek WIŚNIEWSKI *, Wiesława KUNISZYK-JÓŹKOWIAK *, Elżbieta SMOŁKA *, Waldemar SUSZYŃSKI * HMM, recognition, speech, disorders
More informationCalibration of Confidence Measures in Speech Recognition
Submitted to IEEE Trans on Audio, Speech, and Language, July 2010 1 Calibration of Confidence Measures in Speech Recognition Dong Yu, Senior Member, IEEE, Jinyu Li, Member, IEEE, Li Deng, Fellow, IEEE
More informationHuman Emotion Recognition From Speech
RESEARCH ARTICLE OPEN ACCESS Human Emotion Recognition From Speech Miss. Aparna P. Wanare*, Prof. Shankar N. Dandare *(Department of Electronics & Telecommunication Engineering, Sant Gadge Baba Amravati
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 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 informationA GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING
A GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING Yong Sun, a * Colin Fidge b and Lin Ma a a CRC for Integrated Engineering Asset Management, School of Engineering Systems, Queensland
More informationAn Effective Framework for Fast Expert Mining in Collaboration Networks: A Group-Oriented and Cost-Based Method
Farhadi F, Sorkhi M, Hashemi S et al. An effective framework for fast expert mining in collaboration networks: A grouporiented and cost-based method. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(3): 577
More informationChapter 2 Rule Learning in a Nutshell
Chapter 2 Rule Learning in a Nutshell This chapter gives a brief overview of inductive rule learning and may therefore serve as a guide through the rest of the book. Later chapters will expand upon the
More informationGuru: A Computer Tutor that Models Expert Human Tutors
Guru: A Computer Tutor that Models Expert Human Tutors Andrew Olney 1, Sidney D'Mello 2, Natalie Person 3, Whitney Cade 1, Patrick Hays 1, Claire Williams 1, Blair Lehman 1, and Art Graesser 1 1 University
More informationImpact of Cluster Validity Measures on Performance of Hybrid Models Based on K-means and Decision Trees
Impact of Cluster Validity Measures on Performance of Hybrid Models Based on K-means and Decision Trees Mariusz Łapczy ski 1 and Bartłomiej Jefma ski 2 1 The Chair of Market Analysis and Marketing Research,
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 informationIntroduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition
Introduction to Ensemble Learning Featuring Successes in the Netflix Prize Competition Todd Holloway Two Lecture Series for B551 November 20 & 27, 2007 Indiana University Outline Introduction Bias and
More informationSimulation of Multi-stage Flash (MSF) Desalination Process
Advances in Materials Physics and Chemistry, 2012, 2, 200-205 doi:10.4236/ampc.2012.24b052 Published Online December 2012 (http://www.scirp.org/journal/ampc) Simulation of Multi-stage Flash (MSF) Desalination
More information*Net Perceptions, Inc West 78th Street Suite 300 Minneapolis, MN
From: AAAI Technical Report WS-98-08. Compilation copyright 1998, AAAI (www.aaai.org). All rights reserved. Recommender Systems: A GroupLens Perspective Joseph A. Konstan *t, John Riedl *t, AI Borchers,
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 informationReinForest: Multi-Domain Dialogue Management Using Hierarchical Policies and Knowledge Ontology
ReinForest: Multi-Domain Dialogue Management Using Hierarchical Policies and Knowledge Ontology Tiancheng Zhao CMU-LTI-16-006 Language Technologies Institute School of Computer Science Carnegie Mellon
More information4-3 Basic Skills and Concepts
4-3 Basic Skills and Concepts Identifying Binomial Distributions. In Exercises 1 8, determine whether the given procedure results in a binomial distribution. For those that are not binomial, identify at
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 informationProduct Feature-based Ratings foropinionsummarization of E-Commerce Feedback Comments
Product Feature-based Ratings foropinionsummarization of E-Commerce Feedback Comments Vijayshri Ramkrishna Ingale PG Student, Department of Computer Engineering JSPM s Imperial College of Engineering &
More informationBridging Lexical Gaps between Queries and Questions on Large Online Q&A Collections with Compact Translation Models
Bridging Lexical Gaps between Queries and Questions on Large Online Q&A Collections with Compact Translation Models Jung-Tae Lee and Sang-Bum Kim and Young-In Song and Hae-Chang Rim Dept. of Computer &
More informationMandarin Lexical Tone Recognition: The Gating Paradigm
Kansas Working Papers in Linguistics, Vol. 0 (008), p. 8 Abstract Mandarin Lexical Tone Recognition: The Gating Paradigm Yuwen Lai and Jie Zhang University of Kansas Research on spoken word recognition
More informationThe Method of Immersion the Problem of Comparing Technical Objects in an Expert Shell in the Class of Artificial Intelligence Algorithms
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS The Method of Immersion the Problem of Comparing Technical Objects in an Expert Shell in the Class of Artificial Intelligence
More informationShared Mental Models
Shared Mental Models A Conceptual Analysis Catholijn M. Jonker 1, M. Birna van Riemsdijk 1, and Bas Vermeulen 2 1 EEMCS, Delft University of Technology, Delft, The Netherlands {m.b.vanriemsdijk,c.m.jonker}@tudelft.nl
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 informationTeam Formation for Generalized Tasks in Expertise Social Networks
IEEE International Conference on Social Computing / IEEE International Conference on Privacy, Security, Risk and Trust Team Formation for Generalized Tasks in Expertise Social Networks Cheng-Te Li Graduate
More informationTeaching Algorithm Development Skills
International Journal of Advanced Computer Science, Vol. 3, No. 9, Pp. 466-474, Sep., 2013. Teaching Algorithm Development Skills Jungsoon Yoo, Sung Yoo, Suk Seo, Zhijiang Dong, & Chrisila Pettey Manuscript
More informationThe Good Judgment Project: A large scale test of different methods of combining expert predictions
The Good Judgment Project: A large scale test of different methods of combining expert predictions Lyle Ungar, Barb Mellors, Jon Baron, Phil Tetlock, Jaime Ramos, Sam Swift The University of Pennsylvania
More informationA Topic Maps-based ontology IR system versus Clustering-based IR System: A Comparative Study in Security Domain
A Topic Maps-based ontology IR system versus Clustering-based IR System: A Comparative Study in Security Domain Myongho Yi 1 and Sam Gyun Oh 2* 1 School of Library and Information Studies, Texas Woman
More information