Knowledge reuse in multiple classifier systems 1
|
|
- Richard Collins
- 6 years ago
- Views:
Transcription
1 Ž. Pattern Recognition Letters Knowlege reuse in multiple classifier systems 1 Kurt Dewitt Bollacker ), Joyeep Ghosh Department of Electrical an Computer Engineering, UniÕersity of Texas, Austin, TX 78712, USA Abstract We introuce a framework for the reuse of knowlege from previously traine classifiers to improve performance in a current an possibly relate classification task. The approach use is flexible in the type an relevance of reuse classifiers an is also scalable. Experiments on public omain ata sets emonstrate the usefulness of this approach when one is face with very few training examples or very noisy training ata. q 1997 Publishe by Elsevier Science B.V. Keywors: Knowlege transfer; Multiple classifier; Mutual information 1. Introuction Artificial classifiers epen heavily on the set of training samples to make classification ecisions. If the training set insufficiently represents the essence of a classification task, then creation of a well generalizing classifier for that task may not be possible. In the construction of artificial classifiers, the inclusion of previously learne knowlege emboie in existing classifiers is a potential approach to the problem of inaequate training ata. However, both a suitable representation of the knowlege to be reuse, an a mechanism for ientification of pertinent knowlege an its incorporation using that representation must be esigne. We use attributes of human knowlege reuse as a guie to this esign. One of the most impressive traits of human knowlege reuse is the ability to raw simultane- ously from a large number of previous experiences quickly an easily. Each bit of learne knowlege may not help much, but as a whole, the knowlege gaine from experience can paint a very clear picture of the problem omain. Analogously, a practical artificial knowlege reuse system shoul be able to have goo performance scalability with the amount of knowlege reuse. Human flexibility in knowlege reuse is also quite notable. Humans can use knowlege learne from a variety of types of experiences without consiering how that knowlege was gaine. Also, humans are capable of quickly an efficiently picking out learne knowlege that is relevant to the current classification task from their immense boy of experience. A flexible knowlege reuse system shoul be able to take avantage of a iversity of knowlege sources for reuse an have a means to juge the relevance of such knowlege PreÕious work ) Corresponing author. 1 This work was supporte by the Army Research Office contracts DAAH-94-G-0417 an DAAH an The National Science Founation. The most common approach to obtaining a ecent generalization given inaequate training sets is to severely constrain the solution space using prior r97r$17.00 q 1997 Publishe by Elsevier Science B.V. All rights reserve. Ž. PII S
2 1386 ( ) K.D. Bollacker, J. GhoshrPattern Recognition Letters omain knowlege. For example, in Bayesian approaches to classification, such knowlege exists in the form of prior istributions assume for the moel parameters an the choice of prior class probabilities. In the machine learning community, the esign choice is calle inuctive bias of the classifier. For example, in a ecision tree, the bias is inicate by the size of the tree an the variables Žor combinations thereof. consiere for making the branches. In fee-forwar neural networks, the type an number of hien units, amount an form of regularization Ž e.g. weight ecay. serve to constrain the solution. In all of these approaches, knowlege reuse is inirect. More importantly, they work well only if the inuctive bias is a goo match to the current problem. This is often ifficult to attain in practice. Some recent work in knowlege reuse has focuse on the automate extraction an reuse of knowlege from the ata sets of other relevant classifiers, incluing reuse of the traine classifiers themselves. Uner the belief that relate classification tasks may benefit from common internal features, Caruana Ž has create a multilayer perceptron Ž MLP. base multiple classifier system that is traine simultaneously to perform several relate classification tasks. The first layer of the MLP is common to all tasks an the secon layer is specific to iniviual tasks. The first layer is expecte to learn common features that are useful to all of the relate tasks. Baxter Ž has evelope a rigorous analysis of a similar type of architecture, showing that as the number of simultaneously traine tasks increases, the number of examples neee per task for goo generalization ecreases. Pratt Ž has explore a similar knowlege reuse metho in which some of the traine weights from one MLP network are use to initialize weights in an MLP to be traine for a later, relate task. A ifferent approach is taken by Thrun an O Sullivan Ž 1996., who propose a metho to estimate classifier relevance by measuring how much better a classifier performs with a reuse scaling vector for nearest neighbor classifiers. Tasks with mutually helpful scaling vectors can be clustere into relate groups. Recently, popular approaches such as committees, ensembles, an mixture of experts also use multiple classifiers. However, since all these classifiers try to Ž solve the same task though they may specialize in. ifferent input regions, they are not germane to the work presente here. 2. Methos We escribe here an architecture for knowlege reuse from previously traine classifiers. Classifiers traine for the current classification task are calle target classifiers while classifiers previously traine to perform other classification tasks are terme support classifiers as inicate in Fig. 1. Our reuse strategy is to apply the input values of each of the training samples available for the target task to all available releõant classifiers. The output class labels of the target an support classifiers are observe by a secon stage supra-classifier which makes the ultimate classification Žc Ž P. in Fig. 1. A. Since no inter- nal information is being use, the support classifiers can be of any type A few efinitions Let the target classification task be A, an let A have a iscrete range SA an -imensional input 4 omain space R. Let x, y A : xgr, ygsa be the set of training examples for task A. We assume that x, y4a is sample from the true istribution for task A with associate ranom variable Ž X,Y. A Ag Ž R, S. A. Our goal is to fin the most likely value of the conitional marginal Y <Ž X s x. A A an efine this maximum likelihoo function to be t Ž x. A s argmax PYsy Ž < X sx.. Thus, t Ž P. : t Ž P. gs y A A A A A Fig. 1. A supra-classifier reuse architecture.
3 ( ) K.D. Bollacker, J. GhoshrPattern Recognition Letters is the target function that we woul like to approximate using the information in x, y 4. Let c Ž P. A A be a function mapping R SA which is esigne to perform classification task A. Let B be a set of support classification tasks which have the same input omain space R as task A. Let c Ž P.4 B : BgB be the corresponing set of classifiers where each c Ž P. maps R S : BgB. Let Xˆ B B A be the ranom variable associate with the input values of training sample set x, y 4. Let T : T st Ž X. A A A A Aˆ be efine as the ranom variable associate with the target function of X ˆ. Similarly, let C : C sc Ž X ˆ. A A A A A an C : C sc Ž X. B B B Aˆ be the ranom variables resulting from the application of Xˆ A to classifiers c Ž P. an c Ž P. A B, respectively. An ieal supra-classifier c ) Ž x. A will always choose the most likely class ygsa given the class labels c Ž x. an c Ž x.4 A B : B g B. More specifically, for any given k : k gs, k : k gs 4 A A A B B B : BgB we can efine the maximum probability function mž P. as mk, Ž k 4 : bgb, A, B. sargmax PT Ž A B y A sy< C sk, C sk 4 : BgB. A A B B. We can then efine an ieal classifier base on this maximum probability function as c A ) Ž x. smž caž x., cbž x. 4:BgB, A, B., Ž 1. ) Ž. ) where ca P has an associate ranom variable C A : ) ) C sc Ž X ˆ. A A A. In practice, if the number of support classifiers is quite large, Eq. Ž. 1 becomes impractical ue to the curse of imensionality Ž Frieman, Therefore, we introuce two approximating approaches to Eq. Ž. 1 in Section Classifier releõance measure A measure of relevance of each support classifier to the target classification task woul be helpful in the construction of a supra-classifier. We have chosen to use mutual information IŽ P;P. Ža measure of the amount of share information between two ranom variables. with the target istribution as a classifier s relevance to that classification task. If IT;C Ž.)IŽ T;C. A B A B, then we say that c B knows more about t Ž P. than oes c Ž P. A B 2. We have empirically emonstrate that mutual information can be use effectively as a relevance measure in our knowlege reuse framework ŽBollacker an Ghosh, Practical supra-classifier methos The problem of esigning a practical supra-classifier can be thought of as esigning a classifier for a task with a large number of iscrete features, many or most of which may only be barely useful. We introuce two supra-classifier approaches that are esigne to scale linearly in their computational requirements with the number of reuse support classifiers in orer to satisfy our esign goal of scalability Cascae maximum posterior probabilities Let us relabel the support classifiers c Ž P.4 B : BgB in an orere fashion in the form c Ž P.4 B i : is0... < B< y1 an then revisit Eq. Ž. 1 consiering only c Ž P. an the first support classifier c Ž P. A B 0 to compute cˆ 1 Ž x. : c 1 Ž x. smžcž x,c. Ž x.,a, B. A ˆA A B 0.We 0 then progressively upate our approximation of Eq. Ž. 1 by aing each of the remaining support classinq1 fiers in B one at a time using the form c Ž x. ˆA s mc Ž ˆ n Ž x,c. Ž x.,a, B.. ŽWe efine c Ž P. sc 0 Ž P. A B n A ˆA for n consistency.. As n increases, classification performance on the training example set is strictly non-ecreasing Ž a simple proof omitte for brevity.. In a variation to CMAP, we orer the cascae of support classifiers by ecreasing relevance as a heuristic base on the belief that it woul be beneficial to have the most relevant classifiers be earlier in the cascae Hamming nearest neighbor If Ž P. is the inicator function, then the istance measure between two samples xtrn an x tst can be calculate as D Ž x, x. Hamming trn tst s S Žc Ž x./ c Ž x.. B :is0...< B <y1 B trn B tst. For each test i i i example, the Hamming Nearest Neighbor Ž HNN. supra-classifier will choose the class label of the training example with the smallest Hamming istance from it. In a weighte variation of this supraclassifier metho Ž WHNN., the istance contribution of each support classifier Ž 0 or 1. to the total Hamming istance is multiplie by its relevance Žmutual information.. 3. Experiments If there are too few training examples, or if the examples are too noisy, then goo generalization
4 1388 ( ) K.D. Bollacker, J. GhoshrPattern Recognition Letters may not be possible with the information from the target problem s training examples alone. It is these two cases that we have investigate. In orer to test an compare the supra-classifier methos with unaie target classifiers, we took two public omain ata sets from the U.C Irvine Machine Learning atabase an partitione the examples into two isjoint an unequal size subsets base on their class labels. The subset with fewer classes became the target task. The other subset was use to create several two-class problems using all combinations of two classes. First, a example capital English letter ata set Ž LR. onate by Davi Slate was ivie into the target ata set consisting of the five classes H, L, O, R an S an 210 support classifiers consisting of two-class classifiers of the other 21 classes. Secon, a spoken vowel ata set Ž VOW. contribute by Peter Turney consiste of 990 examples evenly istribute among 11 spoken vowels. The two classes hu an he were chosen to form the target classifier task an examples from the remaining 9 classes were use to construct 36 support classifiers Case of few examples The LR ata set of training examples was ranomly partitione into equal size base training an test sets. Both target an support classifier training an test sets were create by taking only examples of the target or support classes respectively from the base training an test sets. The target training set was use to create MLP, single nearest neighbor Ž 1-NN., an C4.5 target classifiers for each target problem. The 210 LR support classifiers were traine MLPs. In orer to consier the case of few available target training examples, only a fraction of the available training examples was actually use for training of the target classifier an supra-classifiers. Target training sets of sizes 5, 20, 40, 80, 160, 320 an 480 examples were applie to the MLP an 1-NN target classifiers an all of the support classifiers. The outputs of these target an support classifiers were then use as the input vector for each of the supra-classifiers. Average results over 20 trials can be seen in Fig. 2. The WHNN followe by the unweighte HNN supra-classifiers showe better classification performance than the unaie MLP, Fig. 2. Classification performance of supra-classifiers an unaie classifiers versus number of training examples on the LR ata set. 1-NN an C4.5 classifiers, especially when the number of training examples was very low. The sorte CMAP supra-classifier performe ientically to the unaie 1-NN an the unsorte CMAP performe worse. This gives evience that the information provie by the support classifiers can compensate somewhat for a lack of sufficient training set size Noisy examples A similar experimental setup to the above was mae but for the VOW ata set in the case of noisy examples. For the target classification problems, Gaussian noise was ae to each input vector of the target training set. ŽThe noise covariance matrix was 2 s I.. An MLP target classifier an 36 1-NN support classifiers were use in 100 experimental trials per- Ž 2 forme over a range s s 0 to 16. of noise variances. Average results for the vowel problem are shown in Fig. 3. The performance boost from knowlege reuse in the HNN is quite prominent, but as Fig. 3. Classification performance of supra-classifiers an unaie classifiers versus Gaussian noise variance on the vowel ata set.
5 ( ) K.D. Bollacker, J. GhoshrPattern Recognition Letters expecte, the avantage isappears as the noise level is lowere. 4. Conclusions In both the case of high noise an of few training examples, knowlege reuse from relevant classifiers via an appropriate supra-classifier improve performance while ahering to the flexibility an scalability esign constraints. This happene even though the previously traine support classifiers ha no output classes in common with the target classifier. Thus, we have evience that the knowlege reuse framework presente here can be a practical means for the reuse of knowlege from classifiers that are iverse in form an purpose. We also use a mutual information base relevance measure to guie the construction of some of the supra-classifier methos. This ha mixe results for both the CMAP an HNN supra-classifiers, inicating that a relevance measure may help if use carefully. Although we have shown some encouraging empirical results, there are several irections in which this work can be extene. One of the most important extensions to this work will be application to a truly complex problem omain. We envision the eventual construction of a powerful an broaly applicable warehouse of previously constructe reusable classifiers for a large omain of interest Ž e.g. image atabases., where the set of support classifiers will serve as an efficient representation of the problem omain knowlege. Discussion Rhagavan: I was wonering what the relationship is between the classifier that you re trying to esign an the classifiers that you use as support? Bollacker: I am simply using the probabilities, trying to see if there is some correlation. In the letter recognition ataset you have for instance the two classes H an O. You might expect that a classifier for N an Q might be use as a support classifier. You might expect that the support classifier for N an Q woul be able to say something useful about ifferentiating H an O, since the features for that ataset were statistics on the shapes of the letters an since N is similar to H an Q is similar in shape to O. So, you woul hope that there woul be some useful information that you coul erive from that N, Q classifier. Van Dyck: I want to point out an analogy between what you i an the infotree metho which I presente. There we consiere the pixel as the most primitive classifier. We combine pixels using mutual entropy, to get a higher level classifier. This is repeate in a kin of tree fashion until the final classifier gives the whole pattern. Bollacker: When I first starte looking at this, I thought of something like that. The first omain I consiere was images. But I ecie that there was too much overhea builing a set of classifiers for an image omain. So we use these simpler atasets. In the long term, towars builing a warehouse of classifiers, you woul start to buil classifiers that say very simple things about the image omain. Then using those, you might be able to buil classifiers that say slightly more complex things, an so on, in some sort of hierarchy like you presente. But that seems to be a much longer-term project than what we have one so far. Loew: When you showe the curves of performance, it woul have been helpful if we woul have been able to see some error bars on those points, so we coul have a feel for whether the ifferences between them were significant or not. But perhaps more importantly, I am wonering about your nearest neighbour classifier, which seems to be almost the best or secon in the two cases. I woner whether, if you ha gone to some K-nearest neighbour classifier, if the performance woul have come very close. Do you have any feel for that? Bollacker: About the error bars: the reason that I i not put these on is that the graphs are alreay relatively cluttere. So I just mae sure that I performe a large enough number of trials to make sure that the error bars woul be small. Regaring the other question: are you talking about a single nearest neighbour supra-classifier? Loew: No, I think at the lower level. Bollacker: You are talking about the unaie single nearest neighbour classifier. Actually, I gave these
6 1390 ( ) K.D. Bollacker, J. GhoshrPattern Recognition Letters unaie classifiers the benefit of the oubt. An it turne out in all the ata sets that I use, that for all K-nearest neighbour classifiers, the single nearest neighbour classifier worke better than those with larger K. Loew: Do you have any feel for why that was so? Bollacker: Well, in fact that was not true in all the ata sets that I use, but it was true for these two. So I just ecie that I woul choose the best one an use that for comparison. Roli: I woul like to have a clarification. Is it correct to say that the concept of knowlege reuse can be regare as a problem of ientifying in a library of classification algorithms, the most inepenent ones, that is the algorithms that make uncorrelate errors? Because, of course, classifiers that make uncorrelate errors are the classifiers most promising to be combine. In your opinion, is this true? Bollacker: We haven t one an analysis to look at error correlation. An certainly what you are suggesting might result in a better relevance measure. So that is certainly something to look at. It coul be ae to the list of future things to o. References Baxter, J., Learning internal representations. Ph.D. Thesis, The Fliners University of South Australia. Bollacker, K.D., Ghosh, J., A scalable metho for classifier knowlege reuse. In: Proc Internat. Conf. on Neural Networks. Caruana, R., Learning many relate tasks at the same time with backpropagation. Av. Neural Inform. Process. Systems 7, Frieman, J.H., An overview of preictive learning an function approximation. In: Cherkassky, V., Frieman, J.H., Wechsler, H. Ž Es.., From Statistics to Neural Networks, Proc. NATOrASI Workshop. Springer, Berlin, pp Pratt, L.Y., Experiments on the transfer of knowlege between neural networks. In: Hanson, S., Drastal, G., Rivest, R. Ž Es.., Computational Learning Theory an Natural Learning Systems, Constraints an Prospects, Chapter 19. MIT Press, pp Thrun, S., O Sullivan, J., Discovering structure in multiple learning tasks: The TC algorithm. In: Proc. 13th Internat. Conf. on Machine Learning.
Lecture 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 informationSweden, The Baltic States and Poland November 2000
Folkbilning co-operation between Sween, The Baltic States an Polan 1990 2000 November 2000 TABLE OF CONTENTS FOREWORD...3 SUMMARY...4 I. CONCLUSIONS FROM THE COUNTRIES...6 I.1 Estonia...8 I.2 Latvia...12
More informationSPECIAL ARTICLES Pharmacy Education in Vietnam
American Journal of Pharmaceutical Eucation 2013; 77 (6) Article 114. SPECIAL ARTICLES Pharmacy Eucation in Vietnam Thi-Ha Vo, MSc, a,b Pierrick Beouch, PharmD, PhD, b,c Thi-Hoai Nguyen, PhD, a Thi-Lien-Huong
More informationKnowledge Transfer in Deep Convolutional Neural Nets
Knowledge Transfer in Deep Convolutional Neural Nets Steven Gutstein, Olac Fuentes and Eric Freudenthal Computer Science Department University of Texas at El Paso El Paso, Texas, 79968, U.S.A. Abstract
More informationModeling function word errors in DNN-HMM based LVCSR systems
Modeling function word errors in DNN-HMM based LVCSR systems Melvin Jose Johnson Premkumar, Ankur Bapna and Sree Avinash Parchuri Department of Computer Science Department of Electrical Engineering Stanford
More informationModeling function word errors in DNN-HMM based LVCSR systems
Modeling function word errors in DNN-HMM based LVCSR systems Melvin Jose Johnson Premkumar, Ankur Bapna and Sree Avinash Parchuri Department of Computer Science Department of Electrical Engineering Stanford
More informationSANTIAGO CANYON COLLEGE Reading & English Placement Testing Information
SANTIAGO CANYON COLLEGE Reaing & English Placement Testing Information DO YOUR BEST on the Reaing & English Placement Test The Reaing & English placement test is esigne to assess stuents skills in reaing
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 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 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 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 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 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 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 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 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 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 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 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 informationSoftprop: Softmax Neural Network Backpropagation Learning
Softprop: Softmax Neural Networ Bacpropagation Learning Michael Rimer Computer Science Department Brigham Young University Provo, UT 84602, USA E-mail: mrimer@axon.cs.byu.edu Tony Martinez Computer Science
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 informationA Survey on Unsupervised Machine Learning Algorithms for Automation, Classification and Maintenance
A Survey on Unsupervised Machine Learning Algorithms for Automation, Classification and Maintenance a Assistant Professor a epartment of Computer Science Memoona Khanum a Tahira Mahboob b b Assistant Professor
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 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 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 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 informationSoftware Maintenance
1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories
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 informationPREDICTING SPEECH RECOGNITION CONFIDENCE USING DEEP LEARNING WITH WORD IDENTITY AND SCORE FEATURES
PREDICTING SPEECH RECOGNITION CONFIDENCE USING DEEP LEARNING WITH WORD IDENTITY AND SCORE FEATURES Po-Sen Huang, Kshitiz Kumar, Chaojun Liu, Yifan Gong, Li Deng Department of Electrical and Computer Engineering,
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 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 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 PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS ASSESSING THE EFFECTIVENESS OF MULTIPLE CHOICE MATH TESTS
THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS ASSESSING THE EFFECTIVENESS OF MULTIPLE CHOICE MATH TESTS ELIZABETH ANNE SOMERS Spring 2011 A thesis submitted in partial
More informationCourse Outline. Course Grading. Where to go for help. Academic Integrity. EE-589 Introduction to Neural Networks NN 1 EE
EE-589 Introduction to Neural Assistant Prof. Dr. Turgay IBRIKCI Room # 305 (322) 338 6868 / 139 Wensdays 9:00-12:00 Course Outline The course is divided in two parts: theory and practice. 1. Theory covers
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 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 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 informationA study of speaker adaptation for DNN-based speech synthesis
A study of speaker adaptation for DNN-based speech synthesis Zhizheng Wu, Pawel Swietojanski, Christophe Veaux, Steve Renals, Simon King The Centre for Speech Technology Research (CSTR) University of Edinburgh,
More informationIssues in the Mining of Heart Failure Datasets
International Journal of Automation and Computing 11(2), April 2014, 162-179 DOI: 10.1007/s11633-014-0778-5 Issues in the Mining of Heart Failure Datasets Nongnuch Poolsawad 1 Lisa Moore 1 Chandrasekhar
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 informationPhonetic- and Speaker-Discriminant Features for Speaker Recognition. Research Project
Phonetic- and Speaker-Discriminant Features for Speaker Recognition by Lara Stoll Research Project Submitted to the Department of Electrical Engineering and Computer Sciences, University of California
More informationData Fusion Through Statistical Matching
A research and education initiative at the MIT Sloan School of Management Data Fusion Through Statistical Matching Paper 185 Peter Van Der Puttan Joost N. Kok Amar Gupta January 2002 For more information,
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 informationSpeech Segmentation Using Probabilistic Phonetic Feature Hierarchy and Support Vector Machines
Speech Segmentation Using Probabilistic Phonetic Feature Hierarchy and Support Vector Machines Amit Juneja and Carol Espy-Wilson Department of Electrical and Computer Engineering University of Maryland,
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 informationProbability and Statistics Curriculum Pacing Guide
Unit 1 Terms PS.SPMJ.3 PS.SPMJ.5 Plan and conduct a survey to answer a statistical question. Recognize how the plan addresses sampling technique, randomization, measurement of experimental error and methods
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 informationUsing Web Searches on Important Words to Create Background Sets for LSI Classification
Using Web Searches on Important Words to Create Background Sets for LSI Classification Sarah Zelikovitz and Marina Kogan College of Staten Island of CUNY 2800 Victory Blvd Staten Island, NY 11314 Abstract
More informationTest Effort Estimation Using Neural Network
J. Software Engineering & Applications, 2010, 3: 331-340 doi:10.4236/jsea.2010.34038 Published Online April 2010 (http://www.scirp.org/journal/jsea) 331 Chintala Abhishek*, Veginati Pavan Kumar, Harish
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 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 informationUsing dialogue context to improve parsing performance in dialogue systems
Using dialogue context to improve parsing performance in dialogue systems Ivan Meza-Ruiz and Oliver Lemon School of Informatics, Edinburgh University 2 Buccleuch Place, Edinburgh I.V.Meza-Ruiz@sms.ed.ac.uk,
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 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 informationSemi-Supervised Face Detection
Semi-Supervised Face Detection Nicu Sebe, Ira Cohen 2, Thomas S. Huang 3, Theo Gevers Faculty of Science, University of Amsterdam, The Netherlands 2 HP Research Labs, USA 3 Beckman Institute, University
More informationExploration. CS : Deep Reinforcement Learning Sergey Levine
Exploration CS 294-112: Deep Reinforcement Learning Sergey Levine Class Notes 1. Homework 4 due on Wednesday 2. Project proposal feedback sent Today s Lecture 1. What is exploration? Why is it a problem?
More informationLecture 1: Basic Concepts of Machine Learning
Lecture 1: Basic Concepts of Machine Learning Cognitive Systems - Machine Learning Ute Schmid (lecture) Johannes Rabold (practice) Based on slides prepared March 2005 by Maximilian Röglinger, updated 2010
More informationSpeech Recognition at ICSI: Broadcast News and beyond
Speech Recognition at ICSI: Broadcast News and beyond Dan Ellis International Computer Science Institute, Berkeley CA Outline 1 2 3 The DARPA Broadcast News task Aspects of ICSI
More informationA Neural Network GUI Tested on Text-To-Phoneme Mapping
A Neural Network GUI Tested on Text-To-Phoneme Mapping MAARTEN TROMPPER Universiteit Utrecht m.f.a.trompper@students.uu.nl Abstract Text-to-phoneme (T2P) mapping is a necessary step in any speech synthesis
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 informationPredicting Student Attrition in MOOCs using Sentiment Analysis and Neural Networks
Predicting Student Attrition in MOOCs using Sentiment Analysis and Neural Networks Devendra Singh Chaplot, Eunhee Rhim, and Jihie Kim Samsung Electronics Co., Ltd. Seoul, South Korea {dev.chaplot,eunhee.rhim,jihie.kim}@samsung.com
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 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 informationSpeaker Identification by Comparison of Smart Methods. Abstract
Journal of mathematics and computer science 10 (2014), 61-71 Speaker Identification by Comparison of Smart Methods Ali Mahdavi Meimand Amin Asadi Majid Mohamadi Department of Electrical Department of Computer
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 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 informationChinese Language Parsing with Maximum-Entropy-Inspired Parser
Chinese Language Parsing with Maximum-Entropy-Inspired Parser Heng Lian Brown University Abstract The Chinese language has many special characteristics that make parsing difficult. The performance of state-of-the-art
More informationIEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 17, NO. 3, MARCH
IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 17, NO. 3, MARCH 2009 423 Adaptive Multimodal Fusion by Uncertainty Compensation With Application to Audiovisual Speech Recognition George
More informationLearning Distributed Linguistic Classes
In: Proceedings of CoNLL-2000 and LLL-2000, pages -60, Lisbon, Portugal, 2000. Learning Distributed Linguistic Classes Stephan Raaijmakers Netherlands Organisation for Applied Scientific Research (TNO)
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 informationMGT/MGP/MGB 261: Investment Analysis
UNIVERSITY OF CALIFORNIA, DAVIS GRADUATE SCHOOL OF MANAGEMENT SYLLABUS for Fall 2014 MGT/MGP/MGB 261: Investment Analysis Daytime MBA: Tu 12:00p.m. - 3:00 p.m. Location: 1302 Gallagher (CRN: 51489) Sacramento
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 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 informationBUILDING CONTEXT-DEPENDENT DNN ACOUSTIC MODELS USING KULLBACK-LEIBLER DIVERGENCE-BASED STATE TYING
BUILDING CONTEXT-DEPENDENT DNN ACOUSTIC MODELS USING KULLBACK-LEIBLER DIVERGENCE-BASED STATE TYING Gábor Gosztolya 1, Tamás Grósz 1, László Tóth 1, David Imseng 2 1 MTA-SZTE Research Group on Artificial
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 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 informationTime series prediction
Chapter 13 Time series prediction Amaury Lendasse, Timo Honkela, Federico Pouzols, Antti Sorjamaa, Yoan Miche, Qi Yu, Eric Severin, Mark van Heeswijk, Erkki Oja, Francesco Corona, Elia Liitiäinen, Zhanxing
More informationAutomatic Pronunciation Checker
Institut für Technische Informatik und Kommunikationsnetze Eidgenössische Technische Hochschule Zürich Swiss Federal Institute of Technology Zurich Ecole polytechnique fédérale de Zurich Politecnico federale
More informationEvidence for Reliability, Validity and Learning Effectiveness
PEARSON EDUCATION Evidence for Reliability, Validity and Learning Effectiveness Introduction Pearson Knowledge Technologies has conducted a large number and wide variety of reliability and validity studies
More informationLearning to Schedule Straight-Line Code
Learning to Schedule Straight-Line Code Eliot Moss, Paul Utgoff, John Cavazos Doina Precup, Darko Stefanović Dept. of Comp. Sci., Univ. of Mass. Amherst, MA 01003 Carla Brodley, David Scheeff Sch. of Elec.
More informationIT Students Workshop within Strategic Partnership of Leibniz University and Peter the Great St. Petersburg Polytechnic University
IT Students Workshop within Strategic Partnership of Leibniz University and Peter the Great St. Petersburg Polytechnic University 06.11.16 13.11.16 Hannover Our group from Peter the Great St. Petersburg
More informationTD(λ) and Q-Learning Based Ludo Players
TD(λ) and Q-Learning Based Ludo Players Majed Alhajry, Faisal Alvi, Member, IEEE and Moataz Ahmed Abstract Reinforcement learning is a popular machine learning technique whose inherent self-learning ability
More informationLarge-Scale Web Page Classification. Sathi T Marath. Submitted in partial fulfilment of the requirements. for the degree of Doctor of Philosophy
Large-Scale Web Page Classification by Sathi T Marath Submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy at Dalhousie University Halifax, Nova Scotia November 2010
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 informationUsing the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees Cognitive Skills in Algebra on the SAT
The Journal of Technology, Learning, and Assessment Volume 6, Number 6 February 2008 Using the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees Cognitive Skills in Algebra on the
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 informationWHEN THERE IS A mismatch between the acoustic
808 IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 14, NO. 3, MAY 2006 Optimization of Temporal Filters for Constructing Robust Features in Speech Recognition Jeih-Weih Hung, Member,
More informationWhat is PDE? Research Report. Paul Nichols
What is PDE? Research Report Paul Nichols December 2013 WHAT IS PDE? 1 About Pearson Everything we do at Pearson grows out of a clear mission: to help people make progress in their lives through personalized
More informationDOMAIN MISMATCH COMPENSATION FOR SPEAKER RECOGNITION USING A LIBRARY OF WHITENERS. Elliot Singer and Douglas Reynolds
DOMAIN MISMATCH COMPENSATION FOR SPEAKER RECOGNITION USING A LIBRARY OF WHITENERS Elliot Singer and Douglas Reynolds Massachusetts Institute of Technology Lincoln Laboratory {es,dar}@ll.mit.edu ABSTRACT
More informationarxiv: v2 [cs.cv] 30 Mar 2017
Domain Adaptation for Visual Applications: A Comprehensive Survey Gabriela Csurka arxiv:1702.05374v2 [cs.cv] 30 Mar 2017 Abstract The aim of this paper 1 is to give an overview of domain adaptation and
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 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 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 informationA New Perspective on Combining GMM and DNN Frameworks for Speaker Adaptation
A New Perspective on Combining GMM and DNN Frameworks for Speaker Adaptation SLSP-2016 October 11-12 Natalia Tomashenko 1,2,3 natalia.tomashenko@univ-lemans.fr Yuri Khokhlov 3 khokhlov@speechpro.com Yannick
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 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 informationIterative Cross-Training: An Algorithm for Learning from Unlabeled Web Pages
Iterative Cross-Training: An Algorithm for Learning from Unlabeled Web Pages Nuanwan Soonthornphisaj 1 and Boonserm Kijsirikul 2 Machine Intelligence and Knowledge Discovery Laboratory Department of Computer
More informationLongest Common Subsequence: A Method for Automatic Evaluation of Handwritten Essays
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 6, Ver. IV (Nov Dec. 2015), PP 01-07 www.iosrjournals.org Longest Common Subsequence: A Method for
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 informationActive Learning. Yingyu Liang Computer Sciences 760 Fall
Active Learning Yingyu Liang Computer Sciences 760 Fall 2017 http://pages.cs.wisc.edu/~yliang/cs760/ Some of the slides in these lectures have been adapted/borrowed from materials developed by Mark Craven,
More information