DOCSLIB.ORG

Spoken Language Understanding II

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Spoken Language Understanding II NPFL099 - Statistical dialogue systems Spoken language understanding II Filip Jurčíček Institute of Formal and Applied Linguistics Charles University in Prague Czech Republic Home page: http://ufal.mff.cuni.cz/~jurcicek Version: 13/03/2013 NPFL099 2013LS 1/41 Outline ● What is SLU? ● Parsers ● Semantic tuple classifiers ● Hidden Vector State ● PCCG NPFL099 2013LS 2/41 Spoken language understanding ● Definition ● SLU converts recognised speech into meaning ● We are looking for mapping of ● I am looking for a Chinese restaurant into ● inform(venue=restaurant)&inform(food=Chinese) NPFL099 2013LS 3/41 Meaning representation ● Is in the form of dialogue acts: ● Each composed of: ● a dialogue act type: – inform, request, confirm, select, affirm, deny, hello, bye, repeat, help, request_alternatives, etc. ● semantic information: – venue=restaurant – food=Chinese NPFL099 2013LS 4/41 Semantic tuple classifiers ● Developed for trees ● Based on composition of simple classifiers for ● non terminal and terminal nodes ● No word alignment is considered ● classifiers are conditioned on the complete sentence F. Mairesse et al., ”Spoken language understanding from unaligned data using discriminative classification models” in ICASSP '09: Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, 2009, pp. 4749-4752. NPFL099 2013LS 5/41 Trees and DAs inform(venue=”restaurant”, food=”Chinese”, near=”railway station”) CLASSIC notation! NPFL099 2013LS 6/41 High precision mode ● dialogue act type is the root ● C(DAT|W) ● slot name is next ● C(NAME|DAT,W) ● slot value is next ● C(VALUE|NAME,W) ● High precision because ● slot names are conditioned on the DAT inform(venue=”restaurant”, food=”Chinese”, near=”railway station”) NPFL099 2013LS 7/41 High recall mode ● dialogue act type is the root ● C(DAT|W) ● slot name and value is next ● C(NAME, VALUE| W) ● High recall because ● slots are conditioned only on W ● error in classification of DAT does not propagate inform(venue=”restaurant”, food=”Chinese”, near=”railway station”) NPFL099 2013LS 8/41 Choice of classifiers ● Arbitrary classifiers ● Classification ● 1 out of N - DAT ● 1 out of 2 – presence of a slot/vale ● Original paper used SVM (support vector machines) ● a kernel based technique using training examples as data-points ● simple scalar product on features works well NPFL099 2013LS 9/41 Features ● Training classifiers in high recall mode ● C(DAT|W) ● C(NAME,VALUE|W) ● To condition on W, extract features ● bag of words trick – N-grams – N-grams from dependency tries etc. ● Tuning ● features can be optimised for each classifier separately NPFL099 2013LS 10/41 Alternatives to SVM ● Naive Bayes ● 1 out of N ● Decision trees ● 1 out of N ● CART ● C4.5 ● Decision forests ● combination of many trees ● increased robustness NPFL099 2013LS 11/41 Alternatives to SVM ● Logistic regression N ∑ θi Φi (W ) ● 1 out of 2 p(C=1∣W )≈e i ● Kernelised logistic regression N ● 1 out of 2 ∑ θi k (W i , W ) p(C=1∣W )≈e i k (W i , W )=Φ(W i )Φ(W ) Dot product kernel NPFL099 2013LS 12/41 Summary of the classifiers Name of classier Type Output Phoenix handcrafted deterministic SVM data driven deterministic with error margins Naïve Bayes data driven probabilistic Decision tree data driven deterministic can be used for regressions Decision forests data driven probabilistic Logistic regression data driven probabilistic Kernelised regression data driven probabilistic NPFL099 2013LS 13/41 Other alternatives ● Weka toolkit ● KSTAR, IBK, JRIP ● mlpy.sourceforge.net ● Linear Discriminant Analysis (LDA), Basic Perceptron, Elastic Net, Logistic Regression, (Kernel) Support Vector Machines (SVM), Diagonal Linear Discriminant Analysis (DLDA), Golub Classifier, Parzen-based, (kernel) Fisher Discriminant Classifier k-Nearest-Neighbor, Iterative RELIEF, Classification Tree, Maximum Likelihood Classifier ● http://scikit-learn.sourceforge.net ● Lasso, Elastic Net, Least Angle Regression, LARS Lasso, Orthogonal Matching Pursuit (OMP), Bayesian Regression, Logisitic regression, Support Vector Machines, Stochastic Gradient Descent, Nearest Neighbors, Gaussian Processes, Partial Least Squares, Naive Bayes, Decision Trees, Ensemble methods, Feature selection NPFL099 2013LS 14/41 PCFG extension ● Probabilistic version of a CFG ● R → INFORM S ● R → REQUEST S inform(venue=”restaurant”, food=”Chinese”, ● S → S S near=”railway station”) ● S → A ● S → AV ● INFORM → looking ● REQUEST → can I get ● A → food ● AV → food = FV ● FV → Chinese I am looking for a Chinese restaurant near the rail way station. ● FV → Italian NPFL099 2013LS 15/41 PCFG extension ● We need to know probabilities of: ● P(R → INFORM S | W) ● P(S → AV | W) ● P(AV → food = FV | W) ● P(FV → Italian | W) N ∑ θ i Φc ,i( W ) ● … p(C=c∣W )≈e i Or any other probabilistic classifier ● W can be the whole input ● or only the part of the input spanned by the rule NPFL099 2013LS 16/41 PCFG approach is more general ● It can theoretically handle: ● I would like Chinese restaurants which are not cheap or expensive or expensive hotels which are not near city centre but near south of the town. ● inform( venue = restaurant && food = Chinese && (price_range != cheap || price_range != expensive) || venue = hotel && price_range = expensive && (near ! = centre || near = south) ) ● However, we do not need this at this moment NPFL099 2013LS 17/41 Hidden Vector State parser ● PCFG structure is too complex ● Arbitrary depth of a tree ● Lets limit the depth of the semantic tree DEPARTURE TO STATION TIME jede nějaký spěšný vlak do Prahy kolem čtvrté odpoledne Y. He and S. Young (2005). "Semantic Processing using the Hidden Vector State Model." Computer Speech and Language 19(1): 85-106. NPFL099 2013LS 18/41 Pushdown automaton approximation ● Push a new concept for each input word ● Pop 0,1,2,3 concepts fro the current stack NPFL099 2013LS 19/41 Pushdown automaton approximation ● Push a new concept for each word ● Pop 0,1,2,3 concepts fro the current stack NPFL099 2013LS 20/41 HVS training ● Given an utterance ● Unaligned state sequence ● Train probabilistic model of ● observations – P(w| c1) ● push – P(c1|c2,c3,c4) ● pop – P(n|c1,c2,c3,c4) ● EM algorithm NPFL099 2013LS 21/41 HVS summary ● Although well received by community ● it's is not very good ● The learned model is biased towards unimportant common words ● In English: a, the, an ● The reason: ● generative structure ● the articles are in almost all utterances ● P( w = 'a' | c ) is the most reliably estimated probability ● So the automatically inferred alignment ● align some concepts always with articles, etc. NPFL099 2013LS 22/41 Processing multiple hypotheses ● ASR provides N-best list ● 0.33 ± I am looking for a bar ● 0.26 ± I am looking for the bar ● 0.11 ± I am looking for a car ● 0.09 ± I am looking for the car ● ... ● How do we get? ● 0.59 ± inform(task=find, venue=bar) ● 0.20 ± null() ● ... NPFL099 2013LS 23/41 Processing multiple hypotheses ● Semantic parser: P(d∣w ) ● Automatic speech recognition: P(w∣a) ● We want to get: P(d∣a) ● where ● d – dialogue act ● w – word sequence ● a – audio signal NPFL099 2013LS 24/41 Processing multiple hypotheses ● ASR provides multiple word sequence hypotheses ● we have to sum over them ( ∣ )= ( ∣ ) ( ∣ ) P d a ∑w P d w P w a ● Algorithm ● Compute semantic interpretation for every word seq. ● Weight them by the prob. of the word sequence ● Merge the same dialogue acts and sum their probs. NPFL099 2013LS 25/41 Alternative ● ASR provides P(w∣a) ● map directly from probability distribution to dialogue acts P(d∣a)=P(d∣P(w∣a)) θT⋅Φ (P(w∣a)) P(d∣a)≈e d ● P(w|a) - can be compactly represented in the form of a confusion network NPFL099 2013LS 26/41 Confusion network ● N-best list ● 0.33 ± I am looking for a bar ● 0.26 ± I am looking for the bar ● 0.11 ± I am looking for a car ● 0.09 ± I am looking for the car ● Confusion network I – 0.9 my – 0.07 am – 0.9 a – 0.6 bar – 0.5 looking – 1.0 for – 1.0 car – 0.4 hi – 0.02 ε – 0.01 ε – 0.1 the – 0.4 ε – 0.1 NPFL099 2013LS 27/41 Features from an utterance ● 1 – best utterance ● I am looking for a bar ● E.g. bigrams ● (I,am) = 1 ● (am,looking) = 1 ● (looking,for) = 1 ● (for,a) = 1 ● (a,bar) = 1 NPFL099 2013LS 28/41 Features from a CN ● CN I – 0.9 my – 0.07 am – 0.9 a – 0.6 bar – 0.5 looking – 1.0 for – 1.0 car – 0.4 hi – 0.02 ε – 0.01 ε – 0.1 the – 0.4 ε – 0.1 ● E.g. bigram features Φd (P(w∣a)) ● (I,am) = 0.81 ● (my,am) = 0.063 Normalise for the length of N-grams ● (looking,for) = 1 ● (a,bar) = 0.3 ● (a,car) = 0.24 ● (a,eps) = 0.06 NPFL099 2013LS 29/41 Thank you! Filip Jurčíček Institute of Formal and Applied Linguistics Charles University in Prague Czech Republic Home page: http://ufal.mff.cuni.cz/~jurcicek NPFL099 2013LS 30/41 SLU exercise ● Built a SLU component using a technique of your choice ● E.g. ● Phoenix parser ● TBL ● SVM ● Decision trees – Random (Decision) forests ● Conditional Random Fields ● Template based matching – clustering ● CFG based NPFL099 2013LS 31/41 Dialogue acts in data ● The format is slightly different ● Each slot value pair has a DAT ● perfect thank you goodbye ● bye()&thankyou() ● i'd like an english restaurant that plays folk music in the north part of town ● inform(area="north")&inform(food="english")&inform( music="folk")&inform(type="restaurant") ● and what type of restaurant is the grand ● inform(name="the grand")&request(food) NPFL099 2013LS 32/41 Dialogue acts in data ● The format is slightly different ● Each slot value pair has a DAT ● perfect thank you goodbye ● bye()&thankyou() ● i'd like an english restaurant that plays folk music in the north part of town ● inform(area="north")&inform(food="english")&inform( music="folk")&inform(type="restaurant") ● and what type of restaurant is the grand ● inform(name="the grand")&request(food) NPFL099 2013LS 33/41 Provided data ● All data ● do not distribute ● use only for NPFL099 ● Original CUED data ● in SDS/applications/TownInfo/cued_data ● Processed data in new format ● run ./cued-sem2ufal-sem.py in SDS/applications/TownInfo ● new data in SDS/applications/TownInfo/data ● I provide the data already in new format NPFL099 2013LS 34/41 Provided data ● Data: train, dev, test ● Data: asr, transribed ● Files: ● auto_database.py ● database.py ● ..
Load more

Recommended publications
  • Arxiv:1210.6293V1 [Cs.MS] 23 Oct 2012 So the Finally, Accessible
    Journal of Machine Learning Research 1 (2012) 1-4 Submitted 9/12; Published x/12 MLPACK: A Scalable C++ Machine Learning Library Ryan R. Curtin [email protected] James R. Cline [email protected] N. P. Slagle [email protected] William B. March [email protected] Parikshit Ram [email protected] Nishant A. Mehta [email protected] Alexander G. Gray [email protected] College of Computing Georgia Institute of Technology Atlanta, GA 30332 Editor: Abstract MLPACK is a state-of-the-art, scalable, multi-platform C++ machine learning library re- leased in late 2011 offering both a simple, consistent API accessible to novice users and high performance and flexibility to expert users by leveraging modern features of C++. ML- PACK provides cutting-edge algorithms whose benchmarks exhibit far better performance than other leading machine learning libraries. MLPACK version 1.0.3, licensed under the LGPL, is available at http://www.mlpack.org. 1. Introduction and Goals Though several machine learning libraries are freely available online, few, if any, offer efficient algorithms to the average user. For instance, the popular Weka toolkit (Hall et al., 2009) emphasizes ease of use but scales poorly; the distributed Apache Mahout library offers scal- ability at a cost of higher overhead (such as clusters and powerful servers often unavailable to the average user). Also, few libraries offer breadth; for instance, libsvm (Chang and Lin, 2011) and the Tilburg Memory-Based Learner (TiMBL) are highly scalable and accessible arXiv:1210.6293v1 [cs.MS] 23 Oct 2012 yet each offer only a single method.
    [Show full text]
  • Sb2b Statistical Machine Learning Hilary Term 2017
    SB2b Statistical Machine Learning Hilary Term 2017 Mihaela van der Schaar and Seth Flaxman Guest lecturer: Yee Whye Teh Department of Statistics Oxford Slides and other materials available at: http://www.oxford-man.ox.ac.uk/~mvanderschaar/home_ page/course_ml.html Administrative details Course Structure MMath Part B & MSc in Applied Statistics Lectures: Wednesdays 12:00-13:00, LG.01. Thursdays 16:00-17:00, LG.01. MSc: 4 problem sheets, discussed at the classes: weeks 2,4,6,7 (check website) Part C: 4 problem sheets Class Tutors: Lloyd Elliott, Kevin Sharp, and Hyunjik Kim Please sign up for the classes on the sign up sheet! Administrative details Course Aims 1 Understand statistical fundamentals of machine learning, with a focus on supervised learning (classification and regression) and empirical risk minimisation. 2 Understand difference between generative and discriminative learning frameworks. 3 Learn to identify and use appropriate methods and models for given data and task. 4 Learn to use the relevant R or python packages to analyse data, interpret results, and evaluate methods. Administrative details SyllabusI Part I: Introduction to supervised learning (4 lectures) Empirical risk minimization Bias/variance, Generalization, Overfitting, Cross validation Regularization Logistic regression Neural networks Part II: Classification and regression (3 lectures) Generative vs. Discriminative models K-nearest neighbours, Maximum Likelihood Estimation, Mixture models Naive Bayes, Decision trees, CART Support Vector Machines Random forest, Boostrap Aggregation (Bagging), Ensemble learning Expectation Maximization Administrative details SyllabusII Part III: Theoretical frameworks Statistical learning theory Decision theory Part IV: Further topics Optimisation Hidden Markov Models Backward-forward algorithms Reinforcement learning Overview Statistical Machine Learning What is Machine Learning? http://gureckislab.org Tom Mitchell, 1997 Any computer program that improves its performance at some task through experience.
    [Show full text]
  • Computational Tools for Big Data — Python Libraries
    Computational Tools for Big Data | Python Libraries Finn Arup˚ Nielsen DTU Compute Technical University of Denmark September 15, 2015 Computational Tools for Big Data | Python libraries Overview Numpy | numerical arrays with fast computation Scipy | computation science functions Scikit-learn (sklearn) | machine learning Pandas | Annotated numpy arrays Cython | write C program in Python Finn Arup˚ Nielsen 1 September 15, 2015 Computational Tools for Big Data | Python libraries Python numerics The problem with Python: >>> [1, 2, 3] * 3 Finn Arup˚ Nielsen 2 September 15, 2015 Computational Tools for Big Data | Python libraries Python numerics The problem with Python: >>> [1, 2, 3] * 3 [1, 2, 3, 1, 2, 3, 1, 2, 3]# Not [3, 6, 9]! Finn Arup˚ Nielsen 3 September 15, 2015 Computational Tools for Big Data | Python libraries Python numerics The problem with Python: >>> [1, 2, 3] * 3 [1, 2, 3, 1, 2, 3, 1, 2, 3]# Not [3, 6, 9]! >>> [1, 2, 3] + 1# Wants [2, 3, 4]... Finn Arup˚ Nielsen 4 September 15, 2015 Computational Tools for Big Data | Python libraries Python numerics The problem with Python: >>> [1, 2, 3] * 3 [1, 2, 3, 1, 2, 3, 1, 2, 3]# Not [3, 6, 9]! >>> [1, 2, 3] + 1# Wants [2, 3, 4]... Traceback(most recent call last): File"<stdin>", line 1, in<module> TypeError: can only concatenate list(not"int") to list Finn Arup˚ Nielsen 5 September 15, 2015 Computational Tools for Big Data | Python libraries Python numerics The problem with Python: >>> [1, 2, 3] * 3 [1, 2, 3, 1, 2, 3, 1, 2, 3]# Not [3, 6, 9]! >>> [1, 2, 3] + 1# Wants [2, 3, 4]..
    [Show full text]
  • Likelihood Algorithm Afterapplying PCA on LISS 3 Image Using Python Platform
    International Journal of Scientific & Engineering Research, Volume 7, Issue 8, August-2016 1624 ISSN 2229-5518 Performance Evaluation of Maximum- Likelihood Algorithm afterApplying PCA on LISS 3 Image using Python Platform MayuriChatse, Vikas Gore, RasikaKalyane, Dr. K. V. Kale Dr. BabasahebAmbedkarMarathwada, University, Aurangabad, Maharashtra, India Abstract—This paper presents a system for multispectral image processing of LISS3 image using python programming language. The system starts with preprocessing technique i.e. by applying PCA on LISS3 image.PCA reduces image dimensionality by processing new, uncorrelated bands consisting of the principal components (PCs) of the given bands. Thus, this method transforms the original data set into a new dataset, which captures essential information.Further classification is done through maximum- likelihood algorithm. It is tested and evaluated on selected area i.e. region of interest. Accuracy is evaluated by confusion matrix and kappa statics.Satellite imagery tool using python shows better result in terms of overall accuracy and kappa coefficient than ENVI tool’s for maximum-likelihood algorithm. Keywords— Kappa Coefficient,Maximum-likelihood, Multispectral image,Overall Accuracy, PCA, Python, Satellite imagery tool —————————— —————————— I. Introduction microns), which provides information with a spatial resolution of 23.5 m not like in IRS-1C/1D (where the spatial resolution is 70.5 m) [12]. Remote sensing has become avitaltosol in wide areas. The classification of multi-spectral images has been a productive application that’s used for classification of land cover maps [1], urban growth [2], forest change [3], monitoring change in ecosystem condition [4], monitoring assessing deforestation and burned forest areas [5], agricultural expansion [6], The Data products are classified as Standard and have a mapping [7], real time fire detection [8], estimating tornado system level accuracy.
    [Show full text]
  • Scikit-Learn: Machine Learning in Python
    Scikit-learn: Machine Learning in Python Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al. To cite this version: Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, et al.. Scikit-learn: Machine Learning in Python. Journal of Machine Learning Research, Microtome Pub- lishing, 2011. hal-00650905v1 HAL Id: hal-00650905 https://hal.inria.fr/hal-00650905v1 Submitted on 2 Jan 2012 (v1), last revised 2 Mar 2013 (v2) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Journal of Machine Learning Research 12 (2011) 2825-2830 Submitted 3/11; Revised 8/11; Published 10/11 Scikit-learn: Machine Learning in Python Fabian Pedregosa [email protected] Ga¨el Varoquaux [email protected] Alexandre Gramfort [email protected] Vincent Michel [email protected] Bertrand Thirion [email protected] Parietal, INRIA Saclay Neurospin, Bˆat 145, CEA Saclay 91191 Gif sur Yvette – France Olivier Grisel [email protected] Nuxeo 20 rue Soleillet 75 020 Paris – France Mathieu Blondel [email protected] Kobe University 1-1 Rokkodai, Nada Kobe 657-8501 – Japan Peter Prettenhofer [email protected] Bauhaus-Universit¨at Weimar Bauhausstr.
    [Show full text]
  • Review on Advanced Machine Learning Model: Scikit-Learn P
    International Journal of Scientific Research and Engineering Development-– Volume 3 - Issue 4, July - Aug 2020 Available at www.ijsred.com RESEARCH ARTICLE OPEN ACCESS Review on Advanced Machine Learning Model: Scikit-Learn P. Deekshith chary*, Dr. R.P.Singh** *CSE, Vageswari college of Engg, Telangana. **Computer science Engineering ,SSSUTMS, Bhopal Email: [email protected] ---------------------------------------- ************************ ---------------------------------- Abstract: Scikit-learn is a Python module integrating a huge vary of ultra-modern computer gaining knowledge of algorithms for medium-scale supervised and unsupervised problems. This bundle focuses on bringing machine gaining knowledge of to non-specialists the usage of a general-purpose high-level language. Emphasis is put on ease of use, performance, documentation, and API consistency. It has minimal dependencies and is disbursed beneath the simplified BSD license, encouraging its use in each academic and business settings. Source code, binaries, and documentation can be downloaded from http://scikit-learn.sourceforge.net. Keywords —Python, supervised learning, unsupervised learning, model selection ---------------------------------------- ************************ ---------------------------------- MDP (Zito et al., 2008) and pybrain (Schaul et al., I. INTRODUCTION 2010), iii) it relies upon solely on numpy and The Python programming language is setting up scipyto facilitate handy distribution, not like itself as one of the most famous languages for pymvpa (Hanke et al., 2009) that has optional scientific computing. Thanks to its high-level dependencies such as R and shogun, and iv) it interactive nature and its maturing ecosystem of focuses on quintessential programming, in contrast scientific libraries, it is an attractive desire for to pybrain which makes use of a data-flow algorithmic improvement and exploratory records framework[3].
    [Show full text]
  • Mlpy: Machine Learning Python
    mlpy: Machine Learning Python Davide Albanese [email protected] Fondazione Bruno Kessler, Trento, Italy Roberto Visintainer [email protected] Fondazione Bruno Kessler & University of Trento, Italy Stefano Merler [email protected] Samantha Riccadonna [email protected] Giuseppe Jurman [email protected] Cesare Furlanello [email protected] Fondazione Bruno Kessler, Trento, Italy Abstract mlpy is a Python Open Source Machine Learning library built on top of NumPy/SciPy and the GNU Scientific Libraries. mlpy provides a wide range of state-of-the-art machine learning methods for supervised and unsupervised problems and it is aimed at finding a reasonable compromise among modularity, maintainability, reproducibility, usability and efficiency. mlpy is multiplatform, it works with Python 2 and 3 and it is distributed under GPL3 at the website http://mlpy.fbk.eu. Keywords: Python, machine learning, classification, regression, dimensionality reduc- tion, clustering 1. Overview We introduce here mlpy, a library providing access to a wide spectrum of machine learn- ing methods implemented in Python, which has proven to be an effective environment for building scientific oriented tools (P´erez et al., 2011). Although planned for general purpose applications, mlpy has the computational biology in general, and the functional genomics modeling in particular, as the elective application fields. As a major applications example, arXiv:1202.6548v2 [cs.MS] 1 Mar 2012 we use mlpy methods to implement molecular profiling experiments that need to warrant study reproducibility (Ioannidis et al., 2009) and flawless results (Ambroise and McLachlan, 2002). This task requires the availability of highly modular tools allowing the praction- ers to build an adequate workflow for the task at hand following authoritative guidelines (The MicroArray Quality Control (MAQC) Consortium, 2010).
    [Show full text]
  • Data Mining Tutorial with Python
    EECS 510: Social Media Mining Spring 2015 Data Mining Essenals 2: Data Mining in Pracce, with Python Rosanne Liu [email protected] Outline • Why Python? • Intro to Python • Intro to Scikit-Learn • Unsupervised Learning – Demo on PCA, K-Means • Supervised Learning – Demo on Linear Regression, LogisGc Regression Outline • Why Python? • Intro to Python • Intro to Scikit-Learn • Unsupervised Learning – Demo on PCA, K-Means • Supervised Learning – Demo on Linear Regression, LogisGc Regression • Why Python? What programming language do you use for data mining? Source from: http://www.kdnuggets.com/polls/index.html How much is your salary as analytics, data mining, data science professionals? Source from: http://www.kdnuggets.com/polls/index.html Should data scientist / data miners be responsible for their predictions? Source from: http://www.kdnuggets.com/polls/index.html Why Python? • Why Python? Not Think about the scien,st’s needs: § Get data (simulaon, experiment control) § Manipulate and process data. § Visualize results... to understand what we are doing! § Communicate results: produce figures for reports or publicaons, write presentaons. Why Python? • Why Python? Not – Easy • Easy to learn, easily readable • ScienGsts first, programmers second – Efficient • Managing memory is easy – if you just don’t care – A single Language for everything • Avoid learning a new soXware for each new problem More to Take Away • Free distribuGon from hZp://www.python.org • Known for it’s “baeries included” philosophy Similar to R, Python has a fantasGc
    [Show full text]
  • Student Research Conference 2020
    Proceedings in Informatics and Information Technologies Student Research Conference 2020 Ján Lang and Rastislav Bencel (Eds.) Keynote by Markus Rupp Proceedings in Informatics and Information Technologies IIT.SRC 2020 Student Research Conference 2 3 Ján Lang and Rastislav Bencel (Eds.) IIT.SRC 2020: Student Research Conference 16th Student Research Conference in Informatics and Information Technologies Bratislava, April 22, 2020 Proceedings 4 Proceedings in Informatics and Information Technologies IIT.SRC 2020 Student Research Conference Editors Ján Lang and Rastislav Bencel Faculty of Informatics and Information Technologies Slovak University of Technology in Bratislava Ilkovičova 2 842 16 Bratislava, Slovakia © 2020 Contributions are printed as delivered by authors without substantial modifications For internal use only. Visit IIT.SRC on the Web: http://iit-src.stuba.sk/2020/ Executive Editors: Rastislav Bencel Copy Editor: Ján Lang FIIT STU FIIT STU Ilkovičova 2, Bratislava, Slovakia Published in Slovak University of Technology in Bratislava in SPEKTRUM STU Publishing 2021 ISBN 978-80-227-5075-2 5 Preface The criteria of universities quality appraisal are primarily focused on their research activities. One of the crucial indicators is the research results publication. So, it is obvious a university activity setting – not except our faculty – the Faculty of Informatics and Information Technologies of the Slovak University of Technology in Bratislava – oriented to the closest possible research and education connection. There is a natural effort of researchers to name research problems, analyse existing solutions and approaches in close confrontation with the design and implementation of their own solution. State of the art in a domain, as well as their own approach in solving problems naturally together with evaluation, are usually part of the final work of students at all three levels of university study.
    [Show full text]
  • Predictive Analytics
    BUTLER A N A L Y T I C S BUSINESS ANALYTICS YEARBOOK 2015 Version 2 – December 2014 Business Analytics Yearbook 2015 BUTLER A N A L Y T I C S Contents Introduction Overview Business Intelligence Enterprise BI Platforms Compared Enterprise Reporting Platforms Open Source BI Platforms Free Dashboard Platforms Free MySQL Dashboard Platforms Free Dashboards for Excel Data Open Source and Free OLAP Tools 12 Cloud Business Intelligence Platforms Compared Data Integration Platforms Predictive Analytics Predictive Analytics Economics Predictive Analytics – The Idiot's Way Why Your Predictive Models Might be Wrong Enterprise Predictive Analytics Platforms Compared Open Source and Free Time Series Analytics Tools Customer Analytics Platforms Open Source and Free Data Mining Platforms Open Source and Free Social Network Analysis Tools Text Analytics What is Text Analytics? Text Analytics Methods Unstructured Meets Structured Data Copyright Butler Analytics 2014 2 Business Analytics Yearbook 2015 BUTLER A N A L Y T I C S Business Applications Text Analytics Strategy Text Analytics Platforms Qualitative Data Analysis Tools Free Qualitative Data Analysis Tools Open Source and Free Enterprise Search Platforms Prescriptive Analytics The Business Value of Prescriptive Analytics What is Prescriptive Analytics? Prescriptive Analytics Methods Integration Business Application Strategy Optimization Technologies Business Process Management * Open Source BPMS * About Butler Analytics * Version 2 additions are Business Process Management and Open Source BPMS This Year Book is updated every month, and is freely available until November 2015. Production of the sections dealing with Text Analytics and Prescriptive Analytics was supportedFICO by . Copyright Butler Analytics 2014 3 Business Analytics Yearbook 2015 BUTLER A N A L Y T I C S Introduction This yearbook is a summary of the research published on the Butler Analytics web site during 2014.
    [Show full text]
  • Python Programming Training
    800-633-1440 1-512-256-0197 www.mindshare.com [email protected] Python Programming Training Let MindShare Bring “Python Programming” to Life for You The Python Programming course examines the programming techniques required to develop Python software applications as well as integrate Python to a multitude of other software systems. The core course covers statistical data analysis in Python using NumPy/SciPy, Pandas, Matplotlib (publication-quality scientific graphics) that mirror support functions in R. You Will Learn: • Python development and optimization • Python Function protocols • Dynamic typing and memory model • Python object-oriented features • Built-in data types, sequence types (lists, dictionaries, tuples, etc), and type operators (slicing, comprehensions, generators, etc) • Building and using libraries and packages Who Should Attend? The target audience includes programmers, system administrators and QA engineers, with little or no knowledge of Python programming. You will be able to develop, automate, and test applications and systems using one of the most powerful programming languages. Course Length: 4 Days (but customizable to shorter duration) Course Outline: The curriculum explores topics in current and emerging Python modules and in-depth usage examples. Schedule: • Day 1: Getting started, basics, types, control structures, data structures • Day 2: Intermediate to advanced Python: object orientation, regular expressions • Day 3: NumPy/SciPy, Pandas, Matplotlib, and data integration • Day 4: Python Advanced: Interoperability
    [Show full text]
  • Towards Left Duff S Mdbg Holt Winters Gai Incl Tax Drupal Fapi Icici
    jimportneoneo_clienterrorentitynotfoundrelatedtonoeneo_j_sdn neo_j_traversalcyperneo_jclientpy_neo_neo_jneo_jphpgraphesrelsjshelltraverserwritebatchtransactioneventhandlerbatchinsertereverymangraphenedbgraphdatabaseserviceneo_j_communityjconfigurationjserverstartnodenotintransactionexceptionrest_graphdbneographytransactionfailureexceptionrelationshipentityneo_j_ogmsdnwrappingneoserverbootstrappergraphrepositoryneo_j_graphdbnodeentityembeddedgraphdatabaseneo_jtemplate neo_j_spatialcypher_neo_jneo_j_cyphercypher_querynoe_jcypherneo_jrestclientpy_neoallshortestpathscypher_querieslinkuriousneoclipseexecutionresultbatch_importerwebadmingraphdatabasetimetreegraphawarerelatedtoviacypherqueryrecorelationshiptypespringrestgraphdatabaseflockdbneomodelneo_j_rbshortpathpersistable withindistancegraphdbneo_jneo_j_webadminmiddle_ground_betweenanormcypher materialised handaling hinted finds_nothingbulbsbulbflowrexprorexster cayleygremlintitandborient_dbaurelius tinkerpoptitan_cassandratitan_graph_dbtitan_graphorientdbtitan rexter enough_ram arangotinkerpop_gremlinpyorientlinkset arangodb_graphfoxxodocumentarangodborientjssails_orientdborientgraphexectedbaasbox spark_javarddrddsunpersist asigned aql fetchplanoriento bsonobjectpyspark_rddrddmatrixfactorizationmodelresultiterablemlibpushdownlineage transforamtionspark_rddpairrddreducebykeymappartitionstakeorderedrowmatrixpair_rddblockmanagerlinearregressionwithsgddstreamsencouter fieldtypes spark_dataframejavarddgroupbykeyorg_apache_spark_rddlabeledpointdatabricksaggregatebykeyjavasparkcontextsaveastextfilejavapairdstreamcombinebykeysparkcontext_textfilejavadstreammappartitionswithindexupdatestatebykeyreducebykeyandwindowrepartitioning
    [Show full text]