Haishan Liu 1, Gwen Frishkoff 2, Robert Frank 1, Dejing Dou 1 1 University of Oregon 2 Georgia State University.

Slides:



Advertisements
Similar presentations
NEMO ERP Analysis Toolkit ERP Metric Extraction An Overview.
Advertisements

Self-Organizing Maps Projection of p dimensional observations to a two (or one) dimensional grid space Constraint version of K-means clustering –Prototypes.
Original Figures for "Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring"
Haishan Liu.  to identify correspondences (“mappings”) between ERP patterns derived from:  different data decomposition methods (temporal PCA and spatial.
Relevance Feedback Retrieval of Time Series Data Eamonn J. Keogh & Michael J. Pazzani Prepared By/ Fahad Al-jutaily Supervisor/ Dr. Mourad Ykhlef IS531.
Region-based Querying of Solar Data Using Descriptor Signatures Authors: Juan M. Banda 1, Chang Liu 1 and Rafal A. Angryk 2 1 Montana State University,
1 Latent Semantic Mapping: Dimensionality Reduction via Globally Optimal Continuous Parameter Modeling Jerome R. Bellegarda.
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
February 11, 2011 Overview of All-Hands Meeting Agenda Gwen Frishkoff
A Similarity Retrieval System for Multimodal Functional Brain Images Rosalia F. Tungaraza Advisor: Prof. Linda G. Shapiro Ph.D. Defense Computer Science.
MAPPING RESULTS Experiments were performed on two simulated datasets, each using both metric sets. Cross spatial join: calculate the Euclidean distance.
OHBM Morning Workshop – June 20, 2009 Neurocognitive ontologies: Methods for sharing and integration of human brain data Neural ElectroMagnetic Ontologies.
Haishan Liu 1, Gwen Frishkoff 2, Robert Frank 1, Dejing Dou 1 1 University of Oregon 2 Georgia State University.
NEMO Data Analysis Workflow and MATLAB Tools
Rubber Hits the Road: Why NEMO needs RDF Paea LePendu Stanford Center for Biomedical Informatics Research National Center for Biomedical Ontology (NCBO)
Extraction and comparison of gene expression patterns from 2D RNA in situ hybridization images BIOINFORMATICS Gene expression Vol. 26, no. 6, 2010, pages.
Chapter 9 Structure Prediction. Motivation Given a protein, can you predict molecular structure Want to avoid repeated x-ray crystallography, but want.
February 26, 2010 NEMO All-Hands Meeting: Overview of Day 1
Slide 1 EE3J2 Data Mining EE3J2 Data Mining - revision Martin Russell.
Semi-Supervised Clustering Jieping Ye Department of Computer Science and Engineering Arizona State University
Using Relevance Feedback in Multimedia Databases
Feb 28, 2010 NEMO data meta-analysis: Application of NEMO analysis workflow to consortium datasets (redux)
A Multiresolution Symbolic Representation of Time Series
Xiaomeng Su & Jon Atle Gulla Dept. of Computer and Information Science Norwegian University of Science and Technology Trondheim Norway June 2004 Semantic.
The Neural ElectroMagnetic Ontology (NEMO) System: Design & Implementation of a Sharable EEG/MEG Database with ERP ontologies G. A. Frishkoff 1,3 D. Dou.
Lecture 09 Clustering-based Learning
Text Mining: Finding Nuggets in Mountains of Textual Data Jochen Dijrre, Peter Gerstl, Roland Seiffert Presented by Drew DeHaas.
Performance Evaluation of Grouping Algorithms Vida Movahedi Elder Lab - Centre for Vision Research York University Spring 2009.
Summarized by Soo-Jin Kim
1 Dejing Dou Computer and Information Science University of Oregon, Eugene, Oregon September, Kent State University.
FlowString: Partial Streamline Matching using Shape Invariant Similarity Measure for Exploratory Flow Visualization Jun Tao, Chaoli Wang, Ching-Kuang Shene.
SISAP’08 – Approximate Similarity Search in Genomic Sequence Databases using Landmark-Guided Embedding Ahmet Sacan and I. Hakki Toroslu
Phylogenetic Analysis. General comments on phylogenetics Phylogenetics is the branch of biology that deals with evolutionary relatedness Uses some measure.
Sequence Analysis CSC 487/687 Introduction to computing for Bioinformatics.
2 nd International Conference on Biomedical Ontology (ICBO’11) Ontology-Based Analysis of Event-Related Potentials Gwen Frishkoff 12, Robert Frank 2, Paea.
MATHEMATICS T THE NEW STPM SYLLABUS (CONTENT & SCHEME OF ASSESSMENT)
Conformational Space.  Conformation of a molecule: specification of the relative positions of all atoms in 3D-space,  Typical parameterizations:  List.
Discovering Deformable Motifs in Time Series Data Jin Chen CSE Fall 1.
Privacy Preserving Schema and Data Matching Scannapieco, Bertino, Figotin and Elmargarmid Presented by : Vidhi Thapa.
Efficient EMD-based Similarity Search in Multimedia Databases via Flexible Dimensionality Reduction / 16 I9 CHAIR OF COMPUTER SCIENCE 9 DATA MANAGEMENT.
ICDE, San Jose, CA, 2002 Discovering Similar Multidimensional Trajectories Michail VlachosGeorge KolliosDimitrios Gunopulos UC RiversideBoston UniversityUC.
Digital Image Processing Lecture 24: Object Recognition June 13, 2005 Prof. Charlene Tsai *From Gonzalez Chapter 12.
Event retrieval in large video collections with circulant temporal encoding CVPR 2013 Oral.
Point Pattern Analysis Point Patterns fall between the two extremes, highly clustered and highly dispersed. Most tests of point patterns compare the observed.
CZ5225: Modeling and Simulation in Biology Lecture 3: Clustering Analysis for Microarray Data I Prof. Chen Yu Zong Tel:
Rubber Hits the Road: How RDF benefits NEMO
A Multiresolution Symbolic Representation of Time Series Vasileios Megalooikonomou Qiang Wang Guo Li Christos Faloutsos Presented by Rui Li.
Introduction to Data Mining by Yen-Hsien Lee Department of Information Management College of Management National Sun Yat-Sen University March 4, 2003.
Xin Tong, Teng-Yok Lee, Han-Wei Shen The Ohio State University
Tutorial 8 Gene expression analysis 1. How to interpret an expression matrix Expression data DBs - GEO Clustering –Hierarchical clustering –K-means clustering.
Multiple Sequence Alignment Vasileios Hatzivassiloglou University of Texas at Dallas.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,
Particle Filter for Robot Localization Vuk Malbasa.
Mustafa Gokce Baydogan, George Runger and Eugene Tuv INFORMS Annual Meeting 2011, Charlotte A Bag-of-Features Framework for Time Series Classification.
4.0 - Data Mining Sébastien Lemieux Elitra Canada Ltd.
Development of NeuroElectroMagnetic Ontologies (NEMO): A Framework for Mining Brainwave Ontologies Dejing Dou 1, Gwen Frishkoff 2, Jiawei Rong 1, Robert.
PREDICT 422: Practical Machine Learning
Semi-Supervised Clustering
CZ5211 Topics in Computational Biology Lecture 3: Clustering Analysis for Microarray Data I Prof. Chen Yu Zong Tel:
Spatial statistics Topic 4 2/2/2007.
Expandable Group Identification in Spreadsheets
CSE572, CBS572: Data Mining by H. Liu
Digital Image Processing Lecture 24: Object Recognition
Group 9 – Data Mining: Data
CSE572: Data Mining by H. Liu
Fig. 1. Neighborhood map (N) and the Shouji bit-vector, for text T=GGTGCAGAGCTC and pattern P=GGTGAGAGTTGT for E =  Fig. 1. Neighborhood map (N)
Tantan Liu, Fan Wang, Gagan Agrawal The Ohio State University
Measuring the Similarity of Rhythmic Patterns
CoXML: A Cooperative XML Query Answering System
Presentation transcript:

Haishan Liu 1, Gwen Frishkoff 2, Robert Frank 1, Dejing Dou 1 1 University of Oregon 2 Georgia State University

 ERP (Event-Related Potentials): a direct measure of neural activity  Lack of meta-analysis across experiment  NEMO (Neural ElectroMagnetic Ontologies) for data sharing and integration  Goal of the presented study  Mapping alternative sets of ERP spatial and temporal measures

Alternative sets of ERP metrics

 Semi-structured data

 Uninformative column headers

 Semi-structured data  Uninformative column headers  Numerical values

 Value vector to point-sequence curve  Use clustering analysis to identify subsequences  Assign meaningful labels to subsequences  Align subsequences across different datasets  Sequence post-processing  Evaluate similarities of the curves to determine the mapping (cross-spatial join)

Cluster labels Meaningful labels Point-sequence curve

 Process all point- sequence curves  Calculate Euclidean distance between sequences in the Cartesian product set (Cross-spatial join) ● ● ●● ● ● Metric Set1 Metric Set2

 the two datasets contain the same or similar ERP patterns

 1-to-1 mapping between metrics

 the two datasets contain the same or similar ERP patterns  1-to-1 mapping between metrics  Minimum sum of distances >

Wrong Mappings. Precision = 9/13 Gold standard mapping falls along the diagonal cells

 3-Factor design of experiment data (Fully factorial: 2 x 2 x 2)  2 simulated “subject groups” (samples) ▪ SG1 = sample 1 ▪ SG2 = sample 2  2 data decompositions ▪ tPCA = temporal PCA decomposition ▪ sICA = spatial ICA decomposition  2 sets of alternative metrics ▪ m1 = metric set 1 ▪ m2 = metric set 2

Overall Precision: 84.6%

 We describe a method for identifying mappings between alternative sets of ERP measures.  Use of an ontology to assign meaningful labels to ERP patterns  Application of sequence similarity search in discovering mappings across alternative metrics  Extension of the instance-level approach in schema matching  Articulation of a global minimum heuristic

 Assuming datasets to contain the dissimilar ERP patterns  From 1-to-1 mapping to complex mapping  Approximation of the global minimum heuristics  More tests on real-world data

Questions and comments? Please contact Haishan Liu