Are All Brains Wired Equally Danai Koutra Yu GongJoshua VogelsteinChristos Faloutsos Motivation Connectomics -- creation of brain connectivity maps. Analysing.

Slides:



Advertisements
Similar presentations
Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
Advertisements

Statistical perturbation theory for spectral clustering Harrachov, 2007 A. Spence and Z. Stoyanov.
Context-based object-class recognition and retrieval by generalized correlograms by J. Amores, N. Sebe and P. Radeva Discussion led by Qi An Duke University.
School of Computer Science Carnegie Mellon University Duke University DeltaCon: A Principled Massive- Graph Similarity Function Danai Koutra Joshua T.
Population Population
The Connectivity and Fault-Tolerance of the Internet Topology
Using Sparse Matrix Reordering Algorithms for Cluster Identification Chris Mueller Dec 9, 2004.
ECE738 Advanced Image Processing Face Recognition by Elastic Bunch Graph Matching IEEE Trans. PAMI, July 1997.
AGE ESTIMATION: A CLASSIFICATION PROBLEM HANDE ALEMDAR, BERNA ALTINEL, NEŞE ALYÜZ, SERHAN DANİŞ.
IDEAL 2005, 6-8 July, Brisbane Multiresolution Analysis of Connectivity Atul Sajjanhar, Deakin University, Australia Guojun Lu, Monash University, Australia.
Texture Segmentation Based on Voting of Blocks, Bayesian Flooding and Region Merging C. Panagiotakis (1), I. Grinias (2) and G. Tziritas (3)
Endend endend Carnegie Mellon University Korea Advanced Institute of Science and Technology VoG: Summarizing and Understanding Large Graphs Danai Koutra.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
CMU SCS C. Faloutsos (CMU)#1 Large Graph Algorithms Christos Faloutsos CMU McGlohon, Mary Prakash, Aditya Tong, Hanghang Tsourakakis, Babis Akoglu, Leman.
Lecture 21: Spectral Clustering
Communities in Heterogeneous Networks Chapter 4 1 Chapter 4, Community Detection and Mining in Social Media. Lei Tang and Huan Liu, Morgan & Claypool,
SCS CMU Joint Work by Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, Philip S. Yu, Christos Faloutsos Speaker: Hanghang Tong Aug , 2008, Las Vegas.
Locally Constraint Support Vector Clustering
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
Principal Component Analysis
Raster Data. The Raster Data Model The Raster Data Model is used to model spatial phenomena that vary continuously over a surface and that do not have.
Pattern Recognition Topic 1: Principle Component Analysis Shapiro chap
Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Feature Extraction for Outlier Detection in High- Dimensional Spaces Hoang Vu Nguyen Vivekanand Gopalkrishnan.
Exploring Microarray data Javier Cabrera. Outline 1.Exploratory Analysis Steps. 2.Microarray Data as Multivariate Data. 3.Dimension Reduction 4.Correlation.
E.G.M. PetrakisDimensionality Reduction1  Given N vectors in n dims, find the k most important axes to project them  k is user defined (k < n)  Applications:
Invariant SPHARM Shape Descriptors for Complex Geometry in MR Region of Interest Analysis Ashish Uthama 1 Rafeef Abugharbieh 1 Anthony Traboulsee 2 Martin.
Demonstration of Statistical Software Eugene Tseytlin Department of BioMedical Informatics, University of Pittsburgh.
INTRODUCTION Problem: Damage condition of residential areas are more concerned than that of natural areas in post-hurricane damage assessment. Recognition.
Segmentation via Graph Cuts
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Gender and 3D Facial Symmetry: What’s the Relationship ? Xia BAIQIANG (University Lille1/LIFL) Boulbaba Ben Amor (TELECOM Lille1/LIFL) Hassen Drira (TELECOM.
Hubert CARDOTJY- RAMELRashid-Jalal QURESHI Université François Rabelais de Tours, Laboratoire d'Informatique 64, Avenue Jean Portalis, TOURS – France.
Spectral coordinate of node u is its location in the k -dimensional spectral space: Spectral coordinates: The i ’th component of the spectral coordinate.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
1 Graph Embedding (GE) & Marginal Fisher Analysis (MFA) 吳沛勳 劉冠成 韓仁智
BACKGROUND LEARNING AND LETTER DETECTION USING TEXTURE WITH PRINCIPAL COMPONENT ANALYSIS (PCA) CIS 601 PROJECT SUMIT BASU FALL 2004.
A Clustering Algorithm based on Graph Connectivity Balakrishna Thiagarajan Computer Science and Engineering State University of New York at Buffalo.
DATA MINING LECTURE 13 Pagerank, Absorbing Random Walks Coverage Problems.
Multimodal Information Analysis for Emotion Recognition
TEMPLATE DESIGN © Zhiyao Duan 1,2, Lie Lu 1, and Changshui Zhang 2 1. Microsoft Research Asia (MSRA), Beijing, China.2.
Object Recognition in Images Slides originally created by Bernd Heisele.
BARCODE IDENTIFICATION BY USING WAVELET BASED ENERGY Soundararajan Ezekiel, Gary Greenwood, David Pazzaglia Computer Science Department Indiana University.
Feature based deformable registration of neuroimages using interest point and feature selection Leonid Teverovskiy Center for Automated Learning and Discovery.
References: [1]S.M. Smith et al. (2004) Advances in functional and structural MR image analysis and implementation in FSL. Neuroimage 23: [2]S.M.
Optimal Component Analysis Optimal Linear Representations of Images for Object Recognition X. Liu, A. Srivastava, and Kyle Gallivan, “Optimal linear representations.
Gaussian Mixture Models and Expectation-Maximization Algorithm.
 In the previews parts we have seen some kind of segmentation method.  In this lecture we will see graph cut, which is a another segmentation method.
HYPOTHESIS TESTING FOR DIFFERENCES BETWEEN MEANS AND BETWEEN PROPORTIONS.
SCS CMU Speaker Hanghang Tong Colibri: Fast Mining of Large Static and Dynamic Graphs Speaking Skill Requirement.
1 8. Estimating the cluster tree of a density from the MST by Runt Pruning Problem: 1-nn density estimate is very noisy --- singularity at each observation.
BRAIN GRAPHS OF WOMEN AND MEN Balázs Szalkai, ELTE Institute of Mathematics.
Mining Coherent Dense Subgraphs across Multiple Biological Networks Vahid Mirjalili CSE 891.
EE368 Final Project Spring 2003
CHAPTER 1 Exploring Data
Experience Report: System Log Analysis for Anomaly Detection
Exploring Microarray data
Network analysis.
NetMine: Mining Tools for Large Graphs
A New Approach to Track Multiple Vehicles With the Combination of Robust Detection and Two Classifiers Weidong Min , Mengdan Fan, Xiaoguang Guo, and Qing.
Presented by: Yang Yu Spatiotemporal GMM for Background Subtraction with Superpixel Hierarchy Mingliang Chen, Xing Wei, Qingxiong.
Noémi Gaskó, Rodica Ioana Lung, Mihai Alexandru Suciu
CHAPTER 1 Exploring Data
CHAPTER 1 Exploring Data
3.3 Network-Centric Community Detection
Scale-Space Representation for Matching of 3D Models
Volume 3, Issue 1, Pages (July 2016)
Fig. 4 Visualization of the 20 occipital lobe models, trained to predict EmoNet categories from brain responses to emotional images. Visualization of the.
Inferring Cellular Processes from Coexpressing Genes
Presentation transcript:

Are All Brains Wired Equally Danai Koutra Yu GongJoshua VogelsteinChristos Faloutsos Motivation Connectomics -- creation of brain connectivity maps. Analysing the maps to understand how the brain functions. Are there differences between different people Female VS male High math skills VS normal ….. If parts of the brain are more connected Left hemisphere Right hemisphere Experimental Results Methodology CONCLUSIONS Novel approach: analyze some invariants of numerous huge brain graphs (connectomes) in order to do clustering and classification Obeservations: The size (number of edges), as well as the maximum eigenvalues of the brain graphs differ significantly between males and females. The degree distribution, and the number of tri-angles are features that can contribute towards the classification of the scans by gender. Datasets Our Approach 1 2 Scalar Features Analysis ①number of nodes ②number of edges ③largest eigenvalue ④number of triangles ⑤number Connected components ⑥maximum pagerank ⑦minimum pagerank Vector Features ①degree distribution ②pagerank distribution ③radius distribution ④approximate radius distribution ⑤first n-th eigenvalues distribution ⑥Triangle distribution Step 1: Brain Difference F G = … Connectomes of 114people Obtained by Multimodal Magnetic Resonance Imaging The connectomes consist of 492K-916K voxels and 9.14M M connections Attributes for each person(e.g., age, gender, IQ, creativity index) Each connectome is represented as unweighted undirected graph Toolkit PEGASUS Networkx Degree Distribution Observation: the extreme cases of female and male connectomes are well separated while it cannot separate connectomes with respect to to the mastery of math. Observation: the extreme cases of female and male connectomes are well separated while it cannot separate connectomes with respect to to the mastery of math. Triangles Plots Observation: Although triangle distribution don’t separate any groups. Total number of triangles succeed in females and male separation while failed for math skill separation. Observation: Although triangle distribution don’t separate any groups. Total number of triangles succeed in females and male separation while failed for math skill separation. Connected Components Observation: The connected components distributions of female and male connectomes do not have significant difference The number of edges and nodes in the giant connected component (gcc) of each brain scan, reveals two clusters corresponding to males and f-males Observation: The connected components distributions of female and male connectomes do not have significant difference The number of edges and nodes in the giant connected component (gcc) of each brain scan, reveals two clusters corresponding to males and f-males Largest Eigenvalue of Graph Matrix References Gray W., ’Magnetic resonance connectome automated pipeline:An overview’, Pulse, IEEE, vol. 3, no. 2, pp. 4248, Kang U, ’PEGASUS: A Peta-Scale Graph Mining System -Implementation and Observations.’, IEEE International Confer-ence on Data Mining (ICDM), Miami, Florida, USA, Koutra D., ’DeltaCon: A Principled Massive-Graph Similar-ity Function’, SIAM International Conference in Data Mining(SDM), Austin, Texas, USA, Brain Graph Shavving Feature extraction m n12...n graphsgraphs Useful features Connectomics Graphs are unweighed undirected Graphs are unweighed undirected analyse TODO: add pegasus and netwrokx logo here Manually divide the graphs into different groups according to labeled attributes p-value significance Plot according graphs based on #nodes to see if the groups can separate for each feature d n12...n graphsgraphs the single vector feature nxk U kxk Eigenass ay uiui S sisi Singular Value kxd vivi Eigengen e VTVT u1u1 u2u2 SVD Plot out u 1 VS u 2 u1u1 u2u2 u1u1 u2u2 The feature cannot distinguish different groups Possible conclusion 1 distinguish different groups got distinguished on the feature Possible conclusion 2 TODO: don’t know what to fill here Preliminaries 114 connectomes, groups can be divided in two ways 1.Gender 50 females are represented by red does and 64 males are represented by green dots 2.Subject Type: relates to math skills, normal, low and high math skill connectomes are represented by green red and blue dots respectively u 1 VS u 2 of the matrix of the connected components distribution The two genders differ significantly in this feature (p-value ) Remove the nodes or edges which may be the noise Efficient in separating different groups Interest sub graphs