Measure Projection Analysis

Slides:



Advertisements
Similar presentations
CHAPTER 13: Alpaydin: Kernel Machines
Advertisements

Measure Projection Analysis: Practicum
Clustering.
Unsupervised Learning
Cluster Analysis: Basic Concepts and Algorithms
Data Mining Cluster Analysis Basics
Hierarchical Clustering, DBSCAN The EM Algorithm
© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ What is Cluster Analysis? l Finding groups of objects such that the objects in a group will.
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
Classical inference and design efficiency Zurich SPM Course 2014
Copyright ©2013 by SJTU, IWCT. Dongchuan Road #800, Minhang, Shanghai, All rights reserved. Indoor Localization with a Crowdsourcing based Fingerprints.
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries By : Surajid Chaudhuri Gautam Das Vivek Narasayya Presented by :Sayed.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Cluster Analysis.  What is Cluster Analysis?  Types of Data in Cluster Analysis  A Categorization of Major Clustering Methods  Partitioning Methods.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Cluster Analysis: Basic Concepts and Algorithms
Independent Component Analysis (ICA) and Factor Analysis (FA)
Cluster Analysis (1).
What is Cluster Analysis?
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
Go to Table of ContentTable of Content Analysis of Variance: Randomized Blocks Farrokh Alemi Ph.D. Kashif Haqqi M.D.
Radial Basis Function Networks
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
Chapter 9 Superposition and Dynamic Programming 1 Chapter 9 Superposition and dynamic programming Most methods for comparing structures use some sorts.
EEGLAB Workshop IV, June 26-29, 2007, Aspet, France: Scott Makeig – Component Clustering 1 Independent Component Clustering Why cluster components? EEGLAB.
DNA microarray technology allows an individual to rapidly and quantitatively measure the expression levels of thousands of genes in a biological sample.
CSC321: Neural Networks Lecture 12: Clustering Geoffrey Hinton.
Lecture 20: Cluster Validation
FMRI Methods Lecture7 – Review: analyses & statistics.
Digital Image Processing CCS331 Relationships of Pixel 1.
1 Motivation Web query is usually two or three words long. –Prone to ambiguity –Example “keyboard” –Input device of computer –Musical instruments How can.
Critical Issues with Respect to Clustering Lecture Notes for Chapter 8 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach, Kumar Introduction.
Quantitative analysis of 2D gels Generalities. Applications Mutant / wild type Physiological conditions Tissue specific expression Disease / normal state.
Supplementary PPT File for More detail explanation on SPSS Anova Results PY Cheng Nov., 2015.
Contrasts & Statistical Inference
CVPR2013 Poster Detecting and Naming Actors in Movies using Generative Appearance Models.
Two-Way (Independent) ANOVA. PSYC 6130A, PROF. J. ELDER 2 Two-Way ANOVA “Two-Way” means groups are defined by 2 independent variables. These IVs are typically.
Flat clustering approaches
Geo479/579: Geostatistics Ch7. Spatial Continuity.
Image enhancement Last update Heejune Ahn, SeoulTech.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 28 Nov 9, 2005 Nanjing University of Science & Technology.
Cluster Analysis What is Cluster Analysis? Types of Data in Cluster Analysis A Categorization of Major Clustering Methods Partitioning Methods.
Filters– Chapter 6. Filter Difference between a Filter and a Point Operation is that a Filter utilizes a neighborhood of pixels from the input image to.
DATA MINING: CLUSTER ANALYSIS Instructor: Dr. Chun Yu School of Statistics Jiangxi University of Finance and Economics Fall 2015.
CSE4334/5334 Data Mining Clustering. What is Cluster Analysis? Finding groups of objects such that the objects in a group will be similar (or related)
Methods of multivariate analysis Ing. Jozef Palkovič, PhD.
Clustering (2) Center-based algorithms Fuzzy k-means Density-based algorithms ( DBSCAN as an example ) Evaluation of clustering results Figures and equations.
Unsupervised Learning
PREDICT 422: Practical Machine Learning
Clustering CSC 600: Data Mining Class 21.
Data Mining Soongsil University
[Ran Manor and Amir B.Geva] Yehu Sapir Outlines Review
Data Mining K-means Algorithm
Parallel ODETLAP for Terrain Compression and Reconstruction
Simulation-Based Approach for Comparing Two Means
Clustering (3) Center-based algorithms Fuzzy k-means
Clustering Evaluation The EM Algorithm
Machine Learning Feature Creation and Selection
Jianping Fan Dept of CS UNC-Charlotte
Clustering Basic Concepts and Algorithms 1
REMOTE SENSING Multispectral Image Classification
REMOTE SENSING Multispectral Image Classification
Critical Issues with Respect to Clustering
Contrasts & Statistical Inference
Contrasts & Statistical Inference
Topological Signatures For Fast Mobility Analysis
Data Mining Cluster Analysis: Basic Concepts and Algorithms
Contrasts & Statistical Inference
Unsupervised Learning
Presentation transcript:

Measure Projection Analysis Nima Bigdely-Shamlo, Tim Mullen, Ozgur Yigit Balkan Swartz Center for Computational Neuroscience INC, UCSD, 2011

Current EEGLAB Workflow STUDY IC Clustering Issues with IC Clustering Outline Current EEGLAB Workflow STUDY IC Clustering Issues with IC Clustering Measure Projection method Practicum (please start copying the content of workshop USB driver to your computer)

Current EEGLAB Workflow Collect EEG Pre-Process (filter…) Remove artifacts Run ICA Look at ICs (maybe) Single Session Analysis Select dipolar ICs from all sessions Pre-compute EEG measures (ERP, ERSP, ITC…) Select clustering parameters Look at clusters Trying to produce ‘Nice clusters’ Study Analysis

Study IC Clustering Assumes there are functionally equivalent ICs across most subjects. Assumes these ICs have similar responses to experimental conditions across all measures (ERP, ERSP, ITC…) Creates Non-Overlapping partitions: each IC belongs only to one cluster.

Study IC Clustering Sometime clusters are spatially separate AND have distinct responses. In other cases, they have similar responses or they overlap spatially.

Conceptual Problems with Study IC Clustering Components may have similar responses for one measure (e.g. ERSP) but not for the other (e.g. ERP).

Conceptual Problems with Study IC Clustering Clustering boosts evidence by rejecting ICs that are in the same brain area but show different responses. This makes calculating significance values difficult. How can we make sure that we are not ‘imagining clusters’?

Practical problems with current methods of Study IC Clustering Large parameter space issue: many different clustering solutions can be produced by changing parameters and measure subsets. Which one should we choose? EEGLAB original clustering has ~12 parameters

Problems with multi-measure clustering What are the clusters according to location?

Problems with multi-measure clustering What are the clusters according to circle Size ?

Problems with multi-measure clustering What are the clusters according to both circle location and size? The answer highly depends on how much weight is given to each factor (measure).

Problems with multi-measure clustering Alternatively we could find local neighborhoods (on a grid) with significant (unlikely by chance) similarity in circle Size.

Problems with multi-measure clustering We can define a local-average circle size for each grid location and then cluster these values to form Domains. Domain 2 Domain 3 Domain 1

Measure Projection Instead of clustering, we assign to each location in the brain a unique EEG response. The response at each location is calculated as the weighted sum of IC responses in its neighborhood. Weights are assigned by passing the distance between the location and IC dipole through a Gaussian function. The std. of this function represent expected error in dipole localization and inter-subject variability.

Measure Projection IC Gaussian neighborhood (12 mm std.) Local Mean IC max min

Measure Projection Each EEG measure (ERP, ERSP..) is projected separately. Only has one (1) parameter: std. of Gaussian (which has a biological meaning). Bootstrap (permutation) statistics can be easily and quickly performed for each point in the brain. A regular grid is placed in the brain to investigate every area (with ~8 mm spacing).

Measure Projection Not all projected values are significant. Some are weighted means of ICs with very dissimilar responses. Only projected values in neighborhoods with convergent responses are significant. Convergence can be expressed as the mean of pair-wise similarities in a spatial neighborhood. The significance of convergence at each location can be calculated with bootstrapping (permutation).

Measure Projection For a neighborhood with a ‘fixed’ boundary, for each IC pair we can define a membership function: Where M(IC) is one (1) if IC is in the neighborhood and zero (0) otherwise. Convergence can then be defined: Where M is the neighborhood membership matrix and S is the pairwise similarity matrix. This is basically the mean of pairwise IC similarities around a location in the brain.

Measure Projection Now we can extend this concept of convergence to neighborhoods with ‘soft’ Gaussian boundaries, for each IC pair we modify the membership function: Where (d is distance from IC equiv. dipole to neighborhood center). Convergence can now be defined as: IC1 d1 d2 IC2 Where S is the pair-wise similarity matrix. This is basically the weighted mean of IC similarities around a location in the brain.

Measure Projection: RSVP Example To better visualize measure responses in areas with significant convergence, they can be summarized into different domains. The exact number of these domains depends on how similar their exemplars are allowed to be. Below you can see ERSP responses in an EEG experiment form three (3) domains. Domain 1 Domain 2 (P300 -like) Domain 3 Correlation threshold 0.8 Multi-dimensional scaling visualization of ERSP projections for convergent locations.

Measure Projection: RSVP Example Rapid Serial Visual Presentation Experiment 8 subjects 15 Sessions Visual target detection 257 components with equiv. dipoles inside the brain Time Subject input 1 s 4.1 s Burst of 49 clips at 12 Hz Fixation screen Non-target Target

Measure Projection: RSVP Example Clusters Domains

Measure Projection: RSVP Example

Subject Space Measure or dipole density similarity between each two EEG subjects (or sessions) may be averaged over a region of interest (ROI) and visualize using multi-dimensional scaling. Dipole density Projected ERSP at ROIs Projected ERSP at all brain locations

Measure Projection: Summary Enables us to compare subjects, groups and conditions at every brain location. Enables us to calculate significance on every step. Enables us to perform new types of analysis that we could not do with IC clusters (e.g. subject similarity space) All types of analysis that can be done on IC clusters, can also be performed in Measure Projection framework.

Measure Projection Toolbox Roadmap: Multiple ICA models for each session. Expansion of support for subject session comparison on regions of interest (ROIs). Operate on projections into anatomical regions (alternative to domains). May enable investigation of diverse group responses (that may not form domains since measures could be quite different across subjects)

Measure Projection: RSVP Example Areas in which convergence is significant (p<0.01). Gaussian std. = 12 mm Mean weighted correlation in neighborhood

Measure Projection: RSVP Example ERP and ERSP locations with significant convergence (p<0.01) ERSP ERP ERP and ERSP

Measure Projection: RSVP Example ERSP domains (exemplar similarity <0.8) Domain 1 Domain 2 Domain 3

Measure Projection: RSVP Example Subject-Session Similarity Space (S4), All domains Domain 1 (frontal) Cross-session classification ROC = 0.56 ROC = 0.88 ROC = 0.92 ROC = 0.95 ROC = 0.84 Domain 2 (occipital, P300-like)

Practical problems with current methods of Study IC Clustering Number of clusters has to be selected. Clustering is performed on a mixture of measure which makes clustering parameters less meaningful: one cannot provide thresholds for individual measures (e.g. ERPs has to be more correlated than 0.7) ERP ERSP Dipole