Efficiency and design optimization
|
|
- Cecil Preston
- 5 years ago
- Views:
Transcription
1 Efficiency and design optimization Tuesday, Lecture 3 Jeanette Mumford University of Wisconsin - Madison Thanks to Tom Liu for letting me use some of his slides!
2 What is the best way to increase your power?
3 Your N is fixed what do you Give up? do? Let s look at the variance! Lowering the variance will increase our power
4 This lecture s focus X Improvements during study design Y GLM T
5 Efficient designs will increase power Lowering variance increases power
6 Efficient designs will increase power Lowering variance increases power 2 MFX = c(x 0 X) 1 c 0 2 w + 2 b
7 Efficient designs will increase power Lowering variance increases power 2 MFX = c(x 0 X) 1 c 0 2 w + 2 b Between-subject variance (probably unknown)
8 Efficient designs will increase power Lowering variance increases power 2 MFX = c(x 0 X) 1 c 0 2 w + 2 b Within-subject variance (probably unknown)
9 Efficient designs will increase power Lowering variance increases power 2 MFX = c(x 0 X) 1 c 0 2 w + 2 b Design matrix and contrasts (We have total control over this!!)
10 Efficiency E ciency = 1 c(x 0 X) 1 c 0
11 Interpreting efficiency Relative measure Rank designs and pick the one with highest efficiency (lowest variance)
12 Motivating illustration Let s assume we re working with convolved regressors More on this later! Two stimuli (positive and negative images) Stimulus duration = 1s ISI = 2s (fixed) Contrast of interest: positive negative How much can I increase efficiency by searching over random trial orders?
13 Motivating illustration Within- and between-subject variance estimates from real data Typically you won t be able to do this!! within-subject variance = 3036 between-subject variance = 810 N=30 What is the power as a function of effect size? alpha = 0.05
14 Motivating illustration Power for N=30 Power Most efficient Least efficient Effect Size
15 Motivating illustration Power for N=30 Power Most efficient 81% v 63% power Least efficient Effect Size
16 Things that might increase efficiency Random trial order Jittering your ITI Increasing your ITI Lengthen stimuli Increase number of stimuli
17 Which is the best design? It depends on the experimental question. E Slide courtesy of Tom Liu
18 What s to come What design is best? What is Estimation Efficiency vs Detection Power? You need to know to make educated decisions when choosing software What about efficiency for multiple contrasts? Is there a way to speed up the process?
19 Considerations Statistical efficiency Psychological considerations How you plan on modeling the data
20 Estimation vs Detection Pile of sand example
21 Estimation vs Detection Pile of sand example You can detect that something is there but what??
22 Estimation vs Detection Pile of sand example Zoom in and you can see a little better, but you can t be sure about what exactly is in here
23 Estimation vs Detection Pile of sand example You can sort of see something is there..but is is harder to detect
24 Estimation vs Detection Pile of sand example Zoom in and we can clearly estimate all of the shapes that are present!
25 Estimation vs Detection Detection Is there a signal present? What is the magnitude of the signal Estimation What is the shape of the fmri signal?
26 Image-based Example Slide courtesy of Tom Liu
27 Estimation If you are interested in the shape of the HRF, is a blocked or ER design better?
28 Estimation If you are interested in the shape of the HRF, is a blocked or ER design better? Separated ER design Use the FIR model to capture shape Jitter trial onsets to fit in the most trials within a given run GLM can separate out overlap in signal
29 Detection Which design is best for detecting signal?
30 Detection Which design is best for detecting signal? Blocked
31 Estimation? Models?
32 Estimation? Models?
33 Detection? Models?
34 Models? Detection? Y=Xβ+ε
35 The math behind efficiency To get the highest efficiency we strive for the lowest variance for a contrast
36 The math behind efficiency To get the highest efficiency we strive for the lowest variance for a contrast c must be a vector
37 The math behind efficiency What if we have multiple contrasts? 1. Calculate c(x X) -1 c for each contrast of interest 2. Average together (c 1 (X X)-1c 1 + c 2 (X X)-1c 2 + c 3 (X X)-1c 3 )/3 3. Efficiency is inverse 3/(c 1 (X X)-1c 1 + c 2 (X X)-1c 2 + c 3 (X X)-1c 3 ) This is known as A-optimality, but there are other options
38 Maximizing efficiency What kind of efficiency? Could try to maximize the efficiency to estimate the HRF shape Could maximize the efficiency to detect if a signal is present Could maximize the efficiency to detect a contrast between two trial types
39 Maximizing efficiency Depends on your model and your contrasts Can t have the best of both worlds Maximize detection and maximize estimation As detection increase estimation decreases (and vice versa)
40 Fundamental Trade-off Estimation Efficiency Periodic Semi-Random h 1 Detection Power Slide courtesy of Tom Liu
41 Maximizing efficiency What if you have multiple stimulus types? How do you choose the order? Need some type of search algorithm
42 Search algorithms Randomly try many design setups and choose one with best efficiency Would take a long time Not a very efficient efficiency search! Must also consider psychological factors
43 Permuted block design Start with stimuli blocked and randomly permute
44 Permuted block design Start with stimuli blocked and randomly permute
45 Permuted block design Start with stimuli blocked and randomly permute
46 Permuted block design Start with stimuli blocked and randomly permute
47 Permuted block design Start with stimuli blocked and randomly permute
48 Genetic Algorithm Uses the idea of genetics Two good parents should produce an even better offspring Mutations can lead to improvements
49 Genetic Algoritm
50 Genetic Algorithm
51 Improved genetic algorithm Kao et al (2008), NeuroImage Account for estimation, detection and psychological factors
52 Improved genetic algorithm
53 Options OptimizeX You ll use this in lab today! Based on convolved regressors (detection? estimation?
54 OptimizeX
55 Other options Software (Optseq and GA approaches) are limited in design types Eg. Say you have two types of stimuli (S a and S b ) that are always followed by response cues (R a and R b ) this can t be specified Based in FIR model! detection? estimation?
56 Other options Write your own code! design/start/ optseq surfer.nmr.mgh.harvard.edu/ optseq/
57 Collinearity Efficiency is a relative measure Collinearity relates to correlation between regressors High collinearity -> Low power Use the variance inflation factor (VIF) Aim for <5, but <10 in a pinch
58 What I typically do Set up the parameters for the design Write my code for generating designs Generate a few designs and check the VIF If VIF is good, I run a full efficiency search
59 Questions?
First-level fmri modeling
First-level fmri modeling Monday, Lecture 3 Jeanette Mumford University of Wisconsin - Madison What do we need to remember from the last lecture? What is the general structure of a t- statistic? How about
More informationExperimental Design for fmri OHBM Advanced fmri Educational Course Thomas Liu UCSD Center for Func6onal MRI
Experimental Design for fmri OHBM Advanced fmri Educational Course 2014 Thomas Liu UCSD Center for Func6onal MRI Experimental Design Design 1 Condition 1 Condition 2 Condition 3 Design 2 Why worry about
More informationMulti-voxel pattern analysis: Decoding Mental States from fmri Activity Patterns
Multi-voxel pattern analysis: Decoding Mental States from fmri Activity Patterns Artwork by Leon Zernitsky Jesse Rissman NITP Summer Program 2012 Part 1 of 2 Goals of Multi-voxel Pattern Analysis Decoding
More informationEvent-related design efficiency and How to plot fmri time series. Sepideh Sadaghiani NeuroSpin Methods Meeting 15. Sept. 2008
Event-related design efficiency and How to plot fmri time series Sepideh Sadaghiani NeuroSpin Methods Meeting 15. Sept. 2008 Event-related averaging or FIR? event-related fmri ability to average responses
More informationCSE 158. Web Mining and Recommender Systems. Midterm recap
CSE 158 Web Mining and Recommender Systems Midterm recap Midterm on Wednesday! 5:10 pm 6:10 pm Closed book but I ll provide a similar level of basic info as in the last page of previous midterms CSE 158
More informationEvolutionary origins of modularity
Evolutionary origins of modularity Jeff Clune, Jean-Baptiste Mouret and Hod Lipson Proceedings of the Royal Society B 2013 Presented by Raghav Partha Evolvability Evolvability capacity to rapidly adapt
More informationComputational Biology Lecture 12: Physical mapping by restriction mapping Saad Mneimneh
Computational iology Lecture : Physical mapping by restriction mapping Saad Mneimneh In the beginning of the course, we looked at genetic mapping, which is the problem of identify the relative order of
More informationthe PyHRF package P. Ciuciu1,2 and T. Vincent1,2 Methods meeting at Neurospin 1: CEA/NeuroSpin/LNAO
Joint detection-estimation of brain activity from fmri time series: the PyHRF package Methods meeting at Neurospin P. Ciuciu1,2 and T. Vincent1,2 philippe.ciuciu@cea.fr 1: CEA/NeuroSpin/LNAO www.lnao.fr
More informationCSE 158 Lecture 2. Web Mining and Recommender Systems. Supervised learning Regression
CSE 158 Lecture 2 Web Mining and Recommender Systems Supervised learning Regression Supervised versus unsupervised learning Learning approaches attempt to model data in order to solve a problem Unsupervised
More informationAdvanced Search Genetic algorithm
Advanced Search Genetic algorithm Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Jerry Zhu, Andrew Moore http://www.cs.cmu.edu/~awm/tutorials
More informationEvolutionary Computation
Evolutionary Computation Lecture 9 Mul+- Objec+ve Evolu+onary Algorithms 1 Multi-objective optimization problem: minimize F(X) = ( f 1 (x),..., f m (x)) The objective functions may be conflicting or incommensurable.
More informationFunction-Structure Integration in FreeSurfer
Function-Structure Integration in FreeSurfer Outline Function-Structure Integration Function-Structure Registration in FreeSurfer fmri Analysis Preprocessing First-Level Analysis Higher-Level (Group) Analysis
More information7/15/2016 ARE YOUR ANALYSES TOO WHY IS YOUR ANALYSIS PARAMETRIC? PARAMETRIC? That s not Normal!
ARE YOUR ANALYSES TOO PARAMETRIC? That s not Normal! Martin M Monti http://montilab.psych.ucla.edu WHY IS YOUR ANALYSIS PARAMETRIC? i. Optimal power (defined as the probability to detect a real difference)
More informationBasic Introduction to Data Analysis. Block Design Demonstration. Robert Savoy
Basic Introduction to Data Analysis Block Design Demonstration Robert Savoy Sample Block Design Experiment Demonstration Use of Visual and Motor Task Separability of Responses Combined Visual and Motor
More informationUsing Genetic Algorithms to Solve the Box Stacking Problem
Using Genetic Algorithms to Solve the Box Stacking Problem Jenniffer Estrada, Kris Lee, Ryan Edgar October 7th, 2010 Abstract The box stacking or strip stacking problem is exceedingly difficult to solve
More informationLecture 4. Lecture 4: The E/R Model
Lecture 4 Lecture 4: The E/R Model Lecture 4 Today s Lecture 1. E/R Basics: Entities & Relations ACTIVITY: Crayon time! 2. E/R Design considerations ACTIVITY: Crayon time pt. II 3. Advanced E/R Concepts
More informationIntroduction to Genetic Algorithms
Advanced Topics in Image Analysis and Machine Learning Introduction to Genetic Algorithms Week 3 Faculty of Information Science and Engineering Ritsumeikan University Today s class outline Genetic Algorithms
More informationTechTalk on Artificial Intelligence
TechTalk on Artificial Intelligence A practical approach to Genetic Algorithm Alexandre Bergel University of Chile, Object Profile http://bergel.eu Goal of today Give an introduction to what genetic algorithm
More informationPercent Change and Power Calculation NITP 2010
Percent Change and Power Calculation NITP 2010 Outline Calculating %-change How to do it What featquery does Why %-Change? As it is, parameter estimates do not reflect a specific unit T-stats are okay
More information/ Computational Genomics. Normalization
10-810 /02-710 Computational Genomics Normalization Genes and Gene Expression Technology Display of Expression Information Yeast cell cycle expression Experiments (over time) baseline expression program
More informationLecture 6 Stereo Systems Multi- view geometry Professor Silvio Savarese Computational Vision and Geometry Lab Silvio Savarese Lecture 6-24-Jan-15
Lecture 6 Stereo Systems Multi- view geometry Professor Silvio Savarese Computational Vision and Geometry Lab Silvio Savarese Lecture 6-24-Jan-15 Lecture 6 Stereo Systems Multi- view geometry Stereo systems
More informationConjoint analysis Outline
Outline Conjoint analysis as a decompositional preference model Steps in conjoint analysis Uses of conjoint analysis Compositional vs. decompositional preference models Compositional: respondents evaluate
More informationMultiVariate Bayesian (MVB) decoding of brain images
MultiVariate Bayesian (MVB) decoding of brain images Alexa Morcom Edinburgh SPM course 2015 With thanks to J. Daunizeau, K. Brodersen for slides stimulus behaviour encoding of sensorial or cognitive state?
More informationThe Binary Genetic Algorithm. Universidad de los Andes-CODENSA
The Binary Genetic Algorithm Universidad de los Andes-CODENSA 1. Genetic Algorithms: Natural Selection on a Computer Figure 1 shows the analogy between biological i l evolution and a binary GA. Both start
More informationD-Optimal Designs. Chapter 888. Introduction. D-Optimal Design Overview
Chapter 888 Introduction This procedure generates D-optimal designs for multi-factor experiments with both quantitative and qualitative factors. The factors can have a mixed number of levels. For example,
More informationGreedy Algorithms CHAPTER 16
CHAPTER 16 Greedy Algorithms In dynamic programming, the optimal solution is described in a recursive manner, and then is computed ``bottom up''. Dynamic programming is a powerful technique, but it often
More informationCOMP 410 Lecture 1. Kyle Dewey
COMP 410 Lecture 1 Kyle Dewey About Me I research automated testing techniques and their intersection with CS education My dissertation used logic programming extensively This is my second semester at
More informationFeature Subset Selection using Clusters & Informed Search. Team 3
Feature Subset Selection using Clusters & Informed Search Team 3 THE PROBLEM [This text box to be deleted before presentation Here I will be discussing exactly what the prob Is (classification based on
More informationNA-MIC National Alliance for Medical Image Computing fmri Data Analysis
NA-MIC fmri Data Analysis Sonia Pujol, Ph.D. Wendy Plesniak, Ph.D. Randy Gollub, M.D., Ph.D. Acknowledgments NIH U54EB005149 Neuroimage Analysis Center NIH P41RR013218 FIRST Biomedical Informatics Research
More informationAlgebraic Iterative Methods for Computed Tomography
Algebraic Iterative Methods for Computed Tomography Per Christian Hansen DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Per Christian Hansen Algebraic
More informationHyperplane Ranking in. Simple Genetic Algorithms. D. Whitley, K. Mathias, and L. Pyeatt. Department of Computer Science. Colorado State University
Hyperplane Ranking in Simple Genetic Algorithms D. Whitley, K. Mathias, and L. yeatt Department of Computer Science Colorado State University Fort Collins, Colorado 8523 USA whitley,mathiask,pyeatt@cs.colostate.edu
More informationGenetic Algorithms. Genetic Algorithms
A biological analogy for optimization problems Bit encoding, models as strings Reproduction and mutation -> natural selection Pseudo-code for a simple genetic algorithm The goal of genetic algorithms (GA):
More informationIntroduction to Automated Text Analysis. bit.ly/poir599
Introduction to Automated Text Analysis Pablo Barberá School of International Relations University of Southern California pablobarbera.com Lecture materials: bit.ly/poir599 Today 1. Solutions for last
More informationEvaluating Classifiers
Evaluating Classifiers Charles Elkan elkan@cs.ucsd.edu January 18, 2011 In a real-world application of supervised learning, we have a training set of examples with labels, and a test set of examples with
More informationSubmit: Your group source code to mooshak
Tutorial 2 (Optional) Genetic Algorithms This is an optional tutorial. Should you decide to answer it please Submit: Your group source code to mooshak http://mooshak.deei.fct.ualg.pt/ up to May 28, 2018.
More informationJournal of Articles in Support of The Null Hypothesis
Data Preprocessing Martin M. Monti, PhD UCLA Psychology NITP 2016 Typical (task-based) fmri analysis sequence Image Pre-processing Single Subject Analysis Group Analysis Journal of Articles in Support
More informationInformation Retrieval and Web Search Engines
Information Retrieval and Web Search Engines Lecture 7: Document Clustering December 4th, 2014 Wolf-Tilo Balke and José Pinto Institut für Informationssysteme Technische Universität Braunschweig The Cluster
More informationData Visualisation in SPM: An introduction
Data Visualisation in SPM: An introduction Alexa Morcom Edinburgh SPM course, April 2010 Centre for Cognitive & Neural Systems/ Department of Psychology University of Edinburgh Visualising results remembered
More informationCPSC 340: Machine Learning and Data Mining
CPSC 340: Machine Learning and Data Mining Feature Selection Original version of these slides by Mark Schmidt, with modifications by Mike Gelbart. Admin Assignment 3: Due Friday Midterm: Feb 14 in class
More informationLecture 6 Stereo Systems Multi-view geometry
Lecture 6 Stereo Systems Multi-view geometry Professor Silvio Savarese Computational Vision and Geometry Lab Silvio Savarese Lecture 6-5-Feb-4 Lecture 6 Stereo Systems Multi-view geometry Stereo systems
More informationk-selection Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong
Department of Computer Science and Engineering Chinese University of Hong Kong In this lecture, we will put randomization to some real use, by using it to solve a non-trivial problem called k-selection
More information1 Minimum Cut Problem
CS 6 Lecture 6 Min Cut and Karger s Algorithm Scribes: Peng Hui How, Virginia Williams (05) Date: November 7, 07 Anthony Kim (06), Mary Wootters (07) Adapted from Virginia Williams lecture notes Minimum
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
More informationAn Introduction To Presentation MACCS
An Introduction To Presentation MACCS Outline Experiment structure Tabs SDL and PCL Script structure: Settings and setup in your script Events PCL, logic and loops page 2 Experiment Structure An overall
More informationDecoding the Human Motor Cortex
Computer Science 229 December 14, 2013 Primary authors: Paul I. Quigley 16, Jack L. Zhu 16 Comment to piq93@stanford.edu, jackzhu@stanford.edu Decoding the Human Motor Cortex Abstract: A human being s
More informationScientific Method and Graphing
Scientific Method and Graphing Objectives - Students will be able to: 1.Explain what an independent and a dependent variable are. 2.Properly label a data table and graph 3.Create a graph from a data table
More informationSolving Systems of Equations Using Matrices With the TI-83 or TI-84
Solving Systems of Equations Using Matrices With the TI-83 or TI-84 Dimensions of a matrix: The dimensions of a matrix are the number of rows by the number of columns in the matrix. rows x columns *rows
More informationVersion. Getting Started: An fmri-cpca Tutorial
Version 11 Getting Started: An fmri-cpca Tutorial 2 Table of Contents Table of Contents... 2 Introduction... 3 Definition of fmri-cpca Data... 3 Purpose of this tutorial... 3 Prerequisites... 4 Used Terms
More informationComparative Analysis of Genetic Algorithm Implementations
Comparative Analysis of Genetic Algorithm Implementations Robert Soricone Dr. Melvin Neville Department of Computer Science Northern Arizona University Flagstaff, Arizona SIGAda 24 Outline Introduction
More informationTechnical Arts 101 Prof. Anupam Saxena Department of Mechanical engineering Indian Institute of Technology, Kanpur. Lecture - 7 Think and Analyze
Technical Arts 101 Prof. Anupam Saxena Department of Mechanical engineering Indian Institute of Technology, Kanpur Lecture - 7 Think and Analyze Last time I asked you to come up with a single funniest
More informationCPSC 340: Machine Learning and Data Mining. Feature Selection Fall 2017
CPSC 340: Machine Learning and Data Mining Feature Selection Fall 2017 Assignment 2: Admin 1 late day to hand in tonight, 2 for Wednesday, answers posted Thursday. Extra office hours Thursday at 4pm (ICICS
More informationI How does the formulation (5) serve the purpose of the composite parameterization
Supplemental Material to Identifying Alzheimer s Disease-Related Brain Regions from Multi-Modality Neuroimaging Data using Sparse Composite Linear Discrimination Analysis I How does the formulation (5)
More informationPractice Problems for the Final
ECE-250 Algorithms and Data Structures (Winter 2012) Practice Problems for the Final Disclaimer: Please do keep in mind that this problem set does not reflect the exact topics or the fractions of each
More information10601 Machine Learning. Model and feature selection
10601 Machine Learning Model and feature selection Model selection issues We have seen some of this before Selecting features (or basis functions) Logistic regression SVMs Selecting parameter value Prior
More informationES-2 Lecture: Fitting models to data
ES-2 Lecture: Fitting models to data Outline Motivation: why fit models to data? Special case (exact solution): # unknowns in model =# datapoints Typical case (approximate solution): # unknowns in model
More informationInformation Retrieval and Web Search Engines
Information Retrieval and Web Search Engines Lecture 7: Document Clustering May 25, 2011 Wolf-Tilo Balke and Joachim Selke Institut für Informationssysteme Technische Universität Braunschweig Homework
More informationCombining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem
Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem Weichen Liu, Thomas Weise, Yuezhong Wu and Qi Qi University of Science and Technology of Chine
More informationStatistical Methods in functional MRI. False Discovery Rate. Issues with FWER. Lecture 7.2: Multiple Comparisons ( ) 04/25/13
Statistical Methods in functional MRI Lecture 7.2: Multiple Comparisons 04/25/13 Martin Lindquist Department of iostatistics Johns Hopkins University Issues with FWER Methods that control the FWER (onferroni,
More informationfmri Basics: Single Subject Analysis
fmri Basics: Single Subject Analysis This session is intended to give an overview of the basic process of setting up a general linear model for a single subject. This stage of the analysis is also variously
More informationAn Intuitive Explanation of Fourier Theory
An Intuitive Explanation of Fourier Theory Steven Lehar slehar@cns.bu.edu Fourier theory is pretty complicated mathematically. But there are some beautifully simple holistic concepts behind Fourier theory
More informationCS/NEUR125 Brains, Minds, and Machines. Due: Wednesday, April 5
CS/NEUR125 Brains, Minds, and Machines Lab 8: Using fmri to Discover Language Areas in the Brain Due: Wednesday, April 5 In this lab, you will analyze fmri data from an experiment that was designed to
More informationAdvanced Digital Signal Processing Adaptive Linear Prediction Filter (Using The RLS Algorithm)
Advanced Digital Signal Processing Adaptive Linear Prediction Filter (Using The RLS Algorithm) Erick L. Oberstar 2001 Adaptive Linear Prediction Filter Using the RLS Algorithm A complete analysis/discussion
More informationSoftware Vulnerability
Software Vulnerability Refers to a weakness in a system allowing an attacker to violate the integrity, confidentiality, access control, availability, consistency or audit mechanism of the system or the
More informationAssignment: Backgrounding and Optical Flow.
Assignment: Backgrounding and Optical Flow. April 6, 00 Backgrounding In this part of the assignment, you will develop a simple background subtraction program.. In this assignment, you are given two videos.
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationHST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008
MIT OpenCourseWare http://ocw.mit.edu HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationEvaluation Metrics. (Classifiers) CS229 Section Anand Avati
Evaluation Metrics (Classifiers) CS Section Anand Avati Topics Why? Binary classifiers Metrics Rank view Thresholding Confusion Matrix Point metrics: Accuracy, Precision, Recall / Sensitivity, Specificity,
More informationINDIAN STATISTICAL INSTITUTE
INDIAN STATISTICAL INSTITUTE Mid Semestral Examination M. Tech (CS) - II Year, 202-203 (Semester - IV) Topics in Algorithms and Complexity Date : 28.02.203 Maximum Marks : 60 Duration : 2.5 Hours Note:
More informationPlanning and Search. Genetic algorithms. Genetic algorithms 1
Planning and Search Genetic algorithms Genetic algorithms 1 Outline Genetic algorithms Representing states (individuals, or chromosomes) Genetic operations (mutation, crossover) Example Genetic algorithms
More informationThe problem we have now is called variable selection or perhaps model selection. There are several objectives.
STAT-UB.0103 NOTES for Wednesday 01.APR.04 One of the clues on the library data comes through the VIF values. These VIFs tell you to what extent a predictor is linearly dependent on other predictors. We
More informationSecond revision: Supplementary Material Linking brain-wide multivoxel activation patterns to behaviour: examples from language and math
Second revision: Supplementary Material Linking brain-wide multivoxel activation patterns to behaviour: examples from language and math Rajeev D. S. Raizada, Feng Ming Tsao, Huei-Mei Liu, Ian D. Holloway,
More informationControlling for multiple comparisons in imaging analysis. Wednesday, Lecture 2 Jeanette Mumford University of Wisconsin - Madison
Controlling for multiple comparisons in imaging analysis Wednesday, Lecture 2 Jeanette Mumford University of Wisconsin - Madison Motivation Run 100 hypothesis tests on null data using p
More informationDescriptive Statistics Descriptive statistics & pictorial representations of experimental data.
Psychology 312: Lecture 7 Descriptive Statistics Slide #1 Descriptive Statistics Descriptive statistics & pictorial representations of experimental data. In this lecture we will discuss descriptive statistics.
More informationFinal Project Report: Learning optimal parameters of Graph-Based Image Segmentation
Final Project Report: Learning optimal parameters of Graph-Based Image Segmentation Stefan Zickler szickler@cs.cmu.edu Abstract The performance of many modern image segmentation algorithms depends greatly
More informationData Visualisation in SPM: An introduction
Data Visualisation in SPM: An introduction Alexa Morcom Edinburgh SPM course, April 2015 SPMmip [-30, 3, -9] 3 Visualising results remembered vs. fixation contrast(s) < < After the results table - what
More informationPredictive Analysis: Evaluation and Experimentation. Heejun Kim
Predictive Analysis: Evaluation and Experimentation Heejun Kim June 19, 2018 Evaluation and Experimentation Evaluation Metrics Cross-Validation Significance Tests Evaluation Predictive analysis: training
More informationQ: Which month has the lowest sale? Answer: Q:There are three consecutive months for which sale grow. What are they? Answer: Q: Which month
Lecture 1 Q: Which month has the lowest sale? Q:There are three consecutive months for which sale grow. What are they? Q: Which month experienced the biggest drop in sale? Q: Just above November there
More informationCP SC 8810 Data Visualization. Joshua Levine
CP SC 8810 Data Visualization Joshua Levine levinej@clemson.edu Lecture 05 Visual Encoding Sept. 9, 2014 Agenda Programming Lab 01 Questions? Continuing from Lec04 Attribute Types no implicit ordering
More informationLecture 8: Fitting. Tuesday, Sept 25
Lecture 8: Fitting Tuesday, Sept 25 Announcements, schedule Grad student extensions Due end of term Data sets, suggestions Reminder: Midterm Tuesday 10/9 Problem set 2 out Thursday, due 10/11 Outline Review
More informationProLog. Creating BrainVoyager protocol files out of Presentation log files
ProLog Creating BrainVoyager protocol files out of Presentation log files Index Introduction... 4 Manual protocol creation... 5 Step 1 Creating and reading BrainVoyager Template Protocol... 5 Step 2 Reading
More informationLecture 9. Heuristic search, continued. CS-424 Gregory Dudek
Lecture 9 Heuristic search, continued A* revisited Reminder: with A* we want to find the best-cost (C ) path to the goal first. To do this, all we have to do is make sure our cost estimates are less than
More informationBig Mathematical Ideas and Understandings
Big Mathematical Ideas and Understandings A Big Idea is a statement of an idea that is central to the learning of mathematics, one that links numerous mathematical understandings into a coherent whole.
More informationOnline Bipartite Matching: A Survey and A New Problem
Online Bipartite Matching: A Survey and A New Problem Xixuan Feng xfeng@cs.wisc.edu Abstract We study the problem of online bipartite matching, where algorithms have to draw irrevocable matchings based
More informationCS6375: Machine Learning Gautam Kunapuli. Mid-Term Review
Gautam Kunapuli Machine Learning Data is identically and independently distributed Goal is to learn a function that maps to Data is generated using an unknown function Learn a hypothesis that minimizes
More informationECE521: Week 11, Lecture March 2017: HMM learning/inference. With thanks to Russ Salakhutdinov
ECE521: Week 11, Lecture 20 27 March 2017: HMM learning/inference With thanks to Russ Salakhutdinov Examples of other perspectives Murphy 17.4 End of Russell & Norvig 15.2 (Artificial Intelligence: A Modern
More informationClustering & Dimensionality Reduction. 273A Intro Machine Learning
Clustering & Dimensionality Reduction 273A Intro Machine Learning What is Unsupervised Learning? In supervised learning we were given attributes & targets (e.g. class labels). In unsupervised learning
More informationAlgorithms: Lecture 7. Chalmers University of Technology
Algorithms: Lecture 7 Chalmers University of Technology Today s Lecture Divide & Conquer Counting Inversions Closest Pair of Points Multiplication of large integers Intro to the forthcoming problems Graphs:
More informationClustering Lecture 5: Mixture Model
Clustering Lecture 5: Mixture Model Jing Gao SUNY Buffalo 1 Outline Basics Motivation, definition, evaluation Methods Partitional Hierarchical Density-based Mixture model Spectral methods Advanced topics
More informationCS 229 Final Project - Using machine learning to enhance a collaborative filtering recommendation system for Yelp
CS 229 Final Project - Using machine learning to enhance a collaborative filtering recommendation system for Yelp Chris Guthrie Abstract In this paper I present my investigation of machine learning as
More informationSupport Vector Machines
Support Vector Machines Xiaojin Zhu jerryzhu@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [ Based on slides from Andrew Moore http://www.cs.cmu.edu/~awm/tutorials] slide 1
More informationUnit Overview. Concepts & Understandings. Learning Targets
Content Area: Math Garfield Middle School Unit Title: Algebraic Reasoning, Integers and Rational Numbers Target Course/Grade Level Duration: 30 blocks 7 th Description Students will simplify numerical
More informationMIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns
MIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns This is a closed-book exam. You should have no material on your desk other than the exam itself and a pencil or pen.
More informationWeighted Alternating Least Squares (WALS) for Movie Recommendations) Drew Hodun SCPD. Abstract
Weighted Alternating Least Squares (WALS) for Movie Recommendations) Drew Hodun SCPD Abstract There are two common main approaches to ML recommender systems, feedback-based systems and content-based systems.
More informationPhysics 2660: Fundamentals of Scientific Computing. Lecture 5 Instructor: Prof. Chris Neu
Physics 2660: Fundamentals of Scientific Computing Lecture 5 Instructor: Prof. Chris Neu (chris.neu@virginia.edu) Reminder I am back! HW04 due Thursday 22 Feb electronically by noon HW grades are coming.
More informationMA 1128: Lecture 02 1/22/2018
MA 1128: Lecture 02 1/22/2018 Exponents Scientific Notation 1 Exponents Exponents are used to indicate how many copies of a number are to be multiplied together. For example, I like to deal with the signs
More informationNaïve Bayes, Gaussian Distributions, Practical Applications
Naïve Bayes, Gaussian Distributions, Practical Applications Required reading: Mitchell draft chapter, sections 1 and 2. (available on class website) Machine Learning 10-601 Tom M. Mitchell Machine Learning
More informationMulti-objective Optimization
Jugal K. Kalita Single vs. Single vs. Single Objective Optimization: When an optimization problem involves only one objective function, the task of finding the optimal solution is called single-objective
More informationName Course Days/Start Time
Name Course Days/Start Time Mini-Project : The Library of Functions In your previous math class, you learned to graph equations containing two variables by finding and plotting points. In this class, we
More informationAnnouncements. Data Sources a list of data files and their sources, an example of what I am looking for:
Data Announcements Data Sources a list of data files and their sources, an example of what I am looking for: Source Map of Bangor MEGIS NG911 road file for Bangor MEGIS Tax maps for Bangor City Hall, may
More informationThe Continuous Genetic Algorithm. Universidad de los Andes-CODENSA
The Continuous Genetic Algorithm Universidad de los Andes-CODENSA 1. Components of a Continuous Genetic Algorithm The flowchart in figure1 provides a big picture overview of a continuous GA.. Figure 1.
More information