Diffuse interface methods on graphs: Data clustering and Gamma-limits
|
|
- Mervin West
- 5 years ago
- Views:
Transcription
1 Diffuse interface methods on graphs: Data clustering and Gamma-limits Yves van Gennip joint work with Andrea Bertozzi, Jeff Brantingham, Blake Hunter Department of Mathematics, UCLA Research made possible by ONR grants N and N Graph Exploitation Symposium MIT Lincoln Laboratory April Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
2 Overview Graphs and data clustering Graph Laplacian and clustering Spectral clustering and street gangs Ginzburg-Landau for nonlinear clustering Γ-limits and nonlocal means Future work Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
3 Overview Graphs and data clustering Graph Laplacian and clustering Spectral clustering and street gangs Ginzburg-Landau for nonlinear clustering Γ-limits and nonlocal means Future work Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
4 The settings: graphs Data points are represented by nodes in an undirected graph. Similarity is encoded in edge weights ω ij. Data clustering is represented by node labels u i. u j u ω ij i Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
5 The goal Clustering: Label all the nodes with a k-valued label, u i {1,..., k}, such that an appropriate quantity is optimized. We choose to minimize normalized cut (Shi, Malik, 2). If V, the set of all nodes, is divided into k disjoint clusters C i : ratio(c i ) := i C i,j V \C i ω i,j ω i,j and Ncut := i C i,j V k ratio(c i ). i=1 Normalization is to avoid small clusters. Note: Here we prescribe the number of clusters k. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
6 Problem! Minimizing NCut is an NP-complete problem (Papadimitriou 1997). Practical solution: Solve a relaxed version of the problem. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
7 Overview Graphs and data clustering Graph Laplacian and clustering Spectral clustering and street gangs Ginzburg-Landau for nonlinear clustering Γ-limits and nonlocal means Future work Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
8 Graph Laplacians in the literature Unnormalized graph Laplacian ( u) i = ω ij (u i u j ) j Random walk graph Laplacian ( u) i = 1 d i ω ij (u i u j ) j with degree d i = ω ij j Symmetric normalized graph Laplacian ( ω ij u ( u) i = i u ) j j di di dj For an overview, see e.g. Von Luxburg (27). Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
9 Focus on the random walk Laplacian Adjacency matrix A and degree matrix D: ω ω 1m ω ω 2m A = D =... ω m1... ω mm. d 1... d d m The random walk Laplacian is then given by u = (1 D 1 A)u. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
10 Eigenvectors as solutions to a relaxed problem Shi, Malik (2), Von Luxburg (27) The solution to the NCut problem is given by the minimization of Tr(H (1 D 1 A)H) over all D-orthonormal matrices H whose columns are indicator functions of clusters. If we relax the condition on H to allow any real-valued D-orthonormal matrix, then the minimization of Tr(H H) is solved by the matrix H whose columns are the first k eigenvectors (ordered according to increasing eigenvalue) of = 1 D 1 A. Use the first k eigenvectors of the random walk Laplacian as approximations to the cluster indicator functions. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
11 Trivial, clean, example. A = = The eigenvalues are,, 1, 1, 1, 1 with (unnormalized) eigenvectors (next page) Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
12 Trivial, clean, example, cont d v 1 = 1 1 1, v 2 = 1 1 1, v 3 = 2 1 1, v 4 = 2 1 1, v 5 = 1 1, v 6 = 1 1 Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
13 Noisy example A = = Eigenvalues:,.2649,.8748, 1.112, , The (unnormalized) eigenvectors corresponding to and.2649: v 1 = 1 1, v 2 = Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
14 From approximation to indicator function How do we go from eigenvector to indicator function. Two often used options: Threshold the values in the eigenvector. Spectral clustering (Ng, Jordan, Weiss, 22): Use eigenvectors as basis for data points. Then use k-means to separate clusters in this space. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
15 Overview Graphs and data clustering Graph Laplacian and clustering Spectral clustering and street gangs Ginzburg-Landau for nonlinear clustering Γ-limits and nonlocal means Future work Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
16 Identify gang membership based on geosocial information This work with Jeff Brantingham and Blake Hunter started out as a REU project in the summer of 211. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
17 From gangs to graphs Given data: Average location of (nonviolent) stops, with pairwise distances d i,j (Anonymized) individuals involved in stop, with pairwise social interactions S i,j Gang affiliation is available as ground truth. Construct a graph via the adjacency/weight matrix with parameters α and σ. A i,j = αs i,j + (1 α)e d 2 i,j /σ2, Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
18 Eigenvectors for specific choice of S Eigenvector 2 Eigenvector 3 Eigenvector 4 Hotspots! Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
19 But The pies are the clusters we find, the colors indicate gang affiliation. Pie charts made with code from Traud, Frost, Mucha, Porter (29) Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
20 Possible explanations Sparse data? Social structures in reality do not follow gang affiliations? Wrong method? Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
21 Overview Graphs and data clustering Graph Laplacian and clustering Spectral clustering and street gangs Ginzburg-Landau for nonlinear clustering Γ-limits and nonlocal means Future work Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
22 The Ginzburg-Landau functional: phase separation From materials science and image analysis: Ginzburg-Landau functional GL ε (u) = ε u ε W (u) When minimized (under some extra constraint, e.g. fixed mass or fidelity to data): phase separation L 2 gradient flow Allen-Cahn equation: u t = ε u 1 ε W (u) (+ constraint) Use graph Laplacian to formulate AC equation on graphs. Double well W Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
23 Allen-Cahn as nonlinear relaxation The Allen-Cahn equation on graphs (u i ) t = ε( u) i + 1 ε W (u i ) (+ constraint) can be seen as a more stringent relaxation of the NCut minimization problem. (N.B. Sign convention: is a negative operator on graphs) The double well term involving W forces the solution to be close to binary. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
24 Application: Machine learning (Bertozzi, Flenner, 212) (u i ) t = ε( u) i + 1 ε W (u i ) + λ i (u i (u orig ) i ) λ i = { 1 i in original otherwise Original Image Image to Segment Training Region Segmented Image Vertices: the pixels from both images Edge weight: ω ij = e x i x j 2 /τ where τ is a scale parameter and x i is the feature vector of pixel i Constraint: fidelity to data in original image Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
25 Application: Data inpainting (Bertozzi, Flenner, 212) (u i ) t = ε( u) i + 1 ε W (u i ) + λ i (u i (u orig ) i ), λ i = Feature vector consisting of n votes: yes (1), no (-1), or did not vote (). n {8, 1, 12, 14, 16} { 1 known data otherwise Vertices: 435 members of the 1984 US House of Representatives Edge weight: ω ij = e x i x j 2 /τ where τ is a scale parameter and x i is the voting vector of individual i Constraint: fidelity to 5 individuals of known party affiliation (dem. or rep.) Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
26 Application: Data clustering (Bertozzi, Flenner, 212) (u i ) t = ε( u) i + 1 ε W (u i ) with mass constraint i u i = ±1) Vertices: points forming two 2D moons in R 1 (with noise) Edge weight dependent on distance between points Mass constraint Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
27 Overview Graphs and data clustering Graph Laplacian and clustering Spectral clustering and street gangs Ginzburg-Landau for nonlinear clustering Γ-limits and nonlocal means Future work Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
28 What about small ε? In the continuum case it is known that GL ε Γ-converges to the total variation functional on binary functions u: GL ε (u) Γ σ W u, as ε. This measures the interface between the two phases u = and u = 1, with surface tension σ W. (Modica, Mortola, 1977) What happens on graphs? GL ε (u) = ε? 4 ij ω ij (u i u j ) ε? W (u i ) i What scaling in ε to use? By going to a graph we have lost the intrinsic length scale in the gradient. Do we want to keep ε in the first term? Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
29 Why is Γ-convergence interesting? If GL ε Γ GL and a compactness property holds, then: If u ε minimizes GL ε and u ε u, then u minimizes GL Definitions, if you are interested: Γ-limit of sequence of functionals A sequence {F n } Γ-converges to F as n if, for all u Dom(F ) 1 u n u lim inf n F n(u n ) F (u) and 2 u n u lim sup n Compactness property F n (u n ) F (u). Compactness: F n (u n ) < C {u n } has a convergent subsequence. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
30 From GL to TV For a fixed general graph with edge weights ω ij independent of ε 1 4 ij ω ij (u i u j ) ε i W (u i ) Γ C W ω ij u i u j as ε, i,j where the limit functional is defined on binary functions u taking values in {, 1}. C W is a constant depending only on W. The total variation ω ij u i u j is related to graph cuts. i,j Dirichlet energy 1 4 ij ω ij (u i u j ) 2 does not scale with ε. Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
31 Graph based functional vs numerical discretization For a regular square grid (4-regular graph) of N N nodes on the torus T 2 we compare Graph based function with uniform edge weights ω ij = 1 N : GL g ε (u) = N 1 N i,j=1 (u i+1,j u i,j ) 2 + (u i,j+1 u i,j ) 2 + ε 1 N i,j=1 W (u i,j ) (The double subscripts denote horizontal and vertical directions.) Functional given by the discretization of the continuum GL functional: GL d ε (u) = ε N i,j=1 (u i+1,j u i,j ) 2 + (u i,j+1 u i,j ) 2 + ε 1 N 2 N i,j=1 W (u i,j ) Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
32 Results: Graph based functional By the earlier result, for fixed N and ε : GL g ε (u) Γ N 1 with u i,j {, 1} Then let N : N i,j=1... ( ui+1,j u i,j + u i,j+1 u i,j ), Γ u x + u y, u(x) {, 1}. Combine both limits via scaling ε = N α,n : N 1 N i,j=1 (u i+1,j u i,j ) 2 + (u i,j+1 u i,j ) 2 + N α N with u(x) {, 1}, if α is large enough. Γ i,j=1 W (u i,j ) u x + u y, Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
33 Results: Discretized functional Fix ε and let N : GL d ε (u) Γ ε u ε W (u). Then, by Modica-Mortola, if ε :... Γ ˆσ W u, with u(x) {, 1}. Combine both limits via ε = N α, N : N α N i,j=1 (u i+1,j u i,j ) 2 + (u i,j+1 u i,j ) 2 + N α 2 N with u(x) {, 1}, if α small enough. i,j=1 W (u i,j ), Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
34 Nonlocal means type functional Still consider square grid on T 2. Given f C (T 2 ) create completely connected graph with weights ω = e d 2 /σ 2 where σ > and d compares patches of L nodes by L nodes sampled from f. Then, for binary valued u, N 4 Γ ω i,j,k,l u i,j u k,l ω(x, y) u(x) u(y) dx dy, T 2 T 2 where i,j,k,l ω(x, y) = e 4L2 σ 2 ( f (x) f (y) ω(x, y) = e c2 S l ( f (x+z) f (y+z) where S l = {z T 2 : z 1 + z 2 l}. ) 2 if σ, L are fixed and N, ) 2 dz if σ = N/c and L/N l as N, Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
35 Overview Graphs and data clustering Graph Laplacian and clustering Spectral clustering and street gangs Ginzburg-Landau for nonlinear clustering Γ-limits and nonlocal means Future work Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
36 Some future work Generalize the asymptotic (graph to continuum) results, e.g. on graphs sampled from a manifold Apply Ginzburg-Landau to other data clustering or image segmentation problems See if and how other clustering/community detection methods fit into this framework, e.g. the multiplex method of Mucha, Richardson, Macon, Porter, Onnela (21) Look at other PDE and PDE questions translated onto graphs Thank you for your connectivity Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
37 Some future work Generalize the asymptotic (graph to continuum) results, e.g. on graphs sampled from a manifold Apply Ginzburg-Landau to other data clustering or image segmentation problems See if and how other clustering/community detection methods fit into this framework, e.g. the multiplex method of Mucha, Richardson, Macon, Porter, Onnela (21) Look at other PDE and PDE questions translated onto graphs Thank you for your connectivity Yves van Gennip (UCLA) Diffuse interface methods on graphs April / 36
DIFFUSE INTERFACE METHODS ON GRAPHS
DIFFUSE INTERFACE METHODS ON GRAPHS,,,and reconstructing data on social networks Andrea Bertozzi University of California, Los Angeles www.math.ucla.edu/~bertozzi Thanks to J. Dobrosotskaya, S. Esedoglu,
More informationSpectral Clustering. Spectral Clustering? Two Moons Data. Spectral Clustering Algorithm: Bipartioning. Spectral methods
Spectral Clustering Seungjin Choi Department of Computer Science POSTECH, Korea seungjin@postech.ac.kr 1 Spectral methods Spectral Clustering? Methods using eigenvectors of some matrices Involve eigen-decomposition
More informationMATH 567: Mathematical Techniques in Data Science Clustering II
This lecture is based on U. von Luxburg, A Tutorial on Spectral Clustering, Statistics and Computing, 17 (4), 2007. MATH 567: Mathematical Techniques in Data Science Clustering II Dominique Guillot Departments
More informationMachine Learning for Data Science (CS4786) Lecture 11
Machine Learning for Data Science (CS4786) Lecture 11 Spectral clustering Course Webpage : http://www.cs.cornell.edu/courses/cs4786/2016sp/ ANNOUNCEMENT 1 Assignment P1 the Diagnostic assignment 1 will
More informationCSE 291. Assignment Spectral clustering versus k-means. Out: Wed May 23 Due: Wed Jun 13
CSE 291. Assignment 3 Out: Wed May 23 Due: Wed Jun 13 3.1 Spectral clustering versus k-means Download the rings data set for this problem from the course web site. The data is stored in MATLAB format as
More informationLearning Spectral Graph Segmentation
Learning Spectral Graph Segmentation AISTATS 2005 Timothée Cour Jianbo Shi Nicolas Gogin Computer and Information Science Department University of Pennsylvania Computer Science Ecole Polytechnique Graph-based
More informationIntroduction to Spectral Graph Theory and Graph Clustering
Introduction to Spectral Graph Theory and Graph Clustering Chengming Jiang ECS 231 Spring 2016 University of California, Davis 1 / 40 Motivation Image partitioning in computer vision 2 / 40 Motivation
More informationMATH 829: Introduction to Data Mining and Analysis Clustering II
his lecture is based on U. von Luxburg, A Tutorial on Spectral Clustering, Statistics and Computing, 17 (4), 2007. MATH 829: Introduction to Data Mining and Analysis Clustering II Dominique Guillot Departments
More informationMATH 567: Mathematical Techniques in Data Science Clustering II
Spectral clustering: overview MATH 567: Mathematical Techniques in Data Science Clustering II Dominique uillot Departments of Mathematical Sciences University of Delaware Overview of spectral clustering:
More informationData Analysis and Manifold Learning Lecture 7: Spectral Clustering
Data Analysis and Manifold Learning Lecture 7: Spectral Clustering Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture 7 What is spectral
More informationSpectral Clustering. Zitao Liu
Spectral Clustering Zitao Liu Agenda Brief Clustering Review Similarity Graph Graph Laplacian Spectral Clustering Algorithm Graph Cut Point of View Random Walk Point of View Perturbation Theory Point of
More informationSpectral clustering. Two ideal clusters, with two points each. Spectral clustering algorithms
A simple example Two ideal clusters, with two points each Spectral clustering Lecture 2 Spectral clustering algorithms 4 2 3 A = Ideally permuted Ideal affinities 2 Indicator vectors Each cluster has an
More informationTHE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING
THE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING Luis Rademacher, Ohio State University, Computer Science and Engineering. Joint work with Mikhail Belkin and James Voss This talk A new approach to multi-way
More informationSpectral Clustering. Guokun Lai 2016/10
Spectral Clustering Guokun Lai 2016/10 1 / 37 Organization Graph Cut Fundamental Limitations of Spectral Clustering Ng 2002 paper (if we have time) 2 / 37 Notation We define a undirected weighted graph
More informationSpectral Clustering on Handwritten Digits Database
University of Maryland-College Park Advance Scientific Computing I,II Spectral Clustering on Handwritten Digits Database Author: Danielle Middlebrooks Dmiddle1@math.umd.edu Second year AMSC Student Advisor:
More informationCertifying the Global Optimality of Graph Cuts via Semidefinite Programming: A Theoretic Guarantee for Spectral Clustering
Certifying the Global Optimality of Graph Cuts via Semidefinite Programming: A Theoretic Guarantee for Spectral Clustering Shuyang Ling Courant Institute of Mathematical Sciences, NYU Aug 13, 2018 Joint
More informationLaplacian Eigenmaps for Dimensionality Reduction and Data Representation
Introduction and Data Representation Mikhail Belkin & Partha Niyogi Department of Electrical Engieering University of Minnesota Mar 21, 2017 1/22 Outline Introduction 1 Introduction 2 3 4 Connections to
More informationMLCC Clustering. Lorenzo Rosasco UNIGE-MIT-IIT
MLCC 2018 - Clustering Lorenzo Rosasco UNIGE-MIT-IIT About this class We will consider an unsupervised setting, and in particular the problem of clustering unlabeled data into coherent groups. MLCC 2018
More informationGrouping with Bias. Stella X. Yu 1,2 Jianbo Shi 1. Robotics Institute 1 Carnegie Mellon University Center for the Neural Basis of Cognition 2
Grouping with Bias Stella X. Yu, Jianbo Shi Robotics Institute Carnegie Mellon University Center for the Neural Basis of Cognition What Is It About? Incorporating prior knowledge into grouping Unitary
More informationA generalized MBO diffusion generated motion for constrained harmonic maps
A generalized MBO diffusion generated motion for constrained harmonic maps Dong Wang Department of Mathematics, University of Utah Joint work with Braxton Osting (U. Utah) Workshop on Modeling and Simulation
More informationModified Cheeger and Ratio Cut Methods Using the Ginzburg-Landau Functional for Classification of High-Dimensional Data
Modified Cheeger and Ratio Cut Methods Using the Ginzburg-Landau Functional for Classification of High-Dimensional Data Ekaterina Merkurjev *, Andrea Bertozzi **, Xiaoran Yan ***, and Kristina Lerman ***
More informationSparse Approximation: from Image Restoration to High Dimensional Classification
Sparse Approximation: from Image Restoration to High Dimensional Classification Bin Dong Beijing International Center for Mathematical Research Beijing Institute of Big Data Research Peking University
More informationRegularizing objective functionals in semi-supervised learning
Regularizing objective functionals in semi-supervised learning Dejan Slepčev Carnegie Mellon University February 9, 2018 1 / 47 References S,Thorpe, Analysis of p-laplacian regularization in semi-supervised
More informationGraphs in Machine Learning
Graphs in Machine Learning Michal Valko INRIA Lille - Nord Europe, France Partially based on material by: Ulrike von Luxburg, Gary Miller, Doyle & Schnell, Daniel Spielman January 27, 2015 MVA 2014/2015
More information8.1 Concentration inequality for Gaussian random matrix (cont d)
MGMT 69: Topics in High-dimensional Data Analysis Falll 26 Lecture 8: Spectral clustering and Laplacian matrices Lecturer: Jiaming Xu Scribe: Hyun-Ju Oh and Taotao He, October 4, 26 Outline Concentration
More information(Non)local phase transitions and minimal surfaces
Dipartimento di Matematica valdinoci@mat.uniroma2.it Italian-Japanese workshop Cortona, June 2011 Outline of the talk Outline of the talk ( ) s u = F 1( ξ 2s (Fu) ), where s (0, 1) and F is the Fourier
More informationData Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings
Data Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline
More informationSpectral Techniques for Clustering
Nicola Rebagliati 1/54 Spectral Techniques for Clustering Nicola Rebagliati 29 April, 2010 Nicola Rebagliati 2/54 Thesis Outline 1 2 Data Representation for Clustering Setting Data Representation and Methods
More informationConvergence of the Graph Allen-Cahn Scheme
Journal of Statistical Physics manuscript No. (will be inserted by the editor) Xiyang Luo Andrea L. Bertozzi Convergence of the Graph Allen-Cahn Scheme the date of receipt and acceptance should be inserted
More informationCS 664 Segmentation (2) Daniel Huttenlocher
CS 664 Segmentation (2) Daniel Huttenlocher Recap Last time covered perceptual organization more broadly, focused in on pixel-wise segmentation Covered local graph-based methods such as MST and Felzenszwalb-Huttenlocher
More informationMultislice community detection
Multislice community detection P. J. Mucha, T. Richardson, K. Macon, M. A. Porter, J.-P. Onnela Jukka-Pekka JP Onnela Harvard University NetSci2010, MIT; May 13, 2010 Outline (1) Background (2) Multislice
More informationSpectral Graph Theory and its Applications. Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity
Spectral Graph Theory and its Applications Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity Outline Adjacency matrix and Laplacian Intuition, spectral graph drawing
More informationA spectral clustering algorithm based on Gram operators
A spectral clustering algorithm based on Gram operators Ilaria Giulini De partement de Mathe matiques et Applications ENS, Paris Joint work with Olivier Catoni 1 july 2015 Clustering task of grouping
More informationSemi-Supervised Learning by Multi-Manifold Separation
Semi-Supervised Learning by Multi-Manifold Separation Xiaojin (Jerry) Zhu Department of Computer Sciences University of Wisconsin Madison Joint work with Andrew Goldberg, Zhiting Xu, Aarti Singh, and Rob
More informationGrouping with Directed Relationships
Grouping with Directed Relationships Stella. Yu Jianbo Shi Robotics Institute Carnegie Mellon University Center for the Neural Basis of Cognition Grouping: finding global structures coherence salience
More informationDownloaded 09/15/14 to Redistribution subject to SIAM license or copyright; see
SIAM J. APPL. MATH. Vol. 73, No., pp. 67 83 c 203 Society for Industrial and Applied Mathematics COMMUNITY DETECTION USING SPECTRAL CLUSTERING ON SPARSE GEOSOCIAL DATA YVES VAN GENNIP, BLAKE HUNTER, RAYMOND
More informationLimits of Spectral Clustering
Limits of Spectral Clustering Ulrike von Luxburg and Olivier Bousquet Max Planck Institute for Biological Cybernetics Spemannstr. 38, 72076 Tübingen, Germany {ulrike.luxburg,olivier.bousquet}@tuebingen.mpg.de
More informationCONVERGENCE ANALYSIS OF THE GRAPH ALLEN-CAHN SCHEME
CONVERGENCE ANALYSIS OF THE GRAPH ALLEN-CAHN SCHEME XIYANG LUO AND ANDREA L. BERTOZZI Abstract. Graph partitioning problems have a wide range of applications in machine learning. This work analyzes convergence
More information1 Matrix notation and preliminaries from spectral graph theory
Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster or community.
More information1 Matrix notation and preliminaries from spectral graph theory
Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster or community.
More informationCommunity detection in time-dependent, multiscale, and multiplex networks
Community detection in time-dependent, multiscale, and multiplex networks P. J. Mucha, T. Richardson, K. Macon, M. A. Porter, J.-P. Onnela Jukka-Pekka Onnela Harvard University MERSIH, November 13, 2009
More informationLearning gradients: prescriptive models
Department of Statistical Science Institute for Genome Sciences & Policy Department of Computer Science Duke University May 11, 2007 Relevant papers Learning Coordinate Covariances via Gradients. Sayan
More informationInverse Power Method for Non-linear Eigenproblems
Inverse Power Method for Non-linear Eigenproblems Matthias Hein and Thomas Bühler Anubhav Dwivedi Department of Aerospace Engineering & Mechanics 7th March, 2017 1 / 30 OUTLINE Motivation Non-Linear Eigenproblems
More informationUnsupervised Image Segmentation Using Comparative Reasoning and Random Walks
Unsupervised Image Segmentation Using Comparative Reasoning and Random Walks Anuva Kulkarni Carnegie Mellon University Filipe Condessa Carnegie Mellon, IST-University of Lisbon Jelena Kovacevic Carnegie
More informationAccess from the University of Nottingham repository:
van Gennip, Yves and Guillen, Nestor and Osting, Braxton and Bertozzi, Andrea L. (2014) Mean curvature, threshold dynamics, and phase field theory on finite graphs. Milan Journal of Mathematics, 82 (1).
More informationSegmentation with Pairwise Attraction and Repulsion
Segmentation with Pairwise Attraction and Repulsion Stella. Yu Jianbo Shi Robotics Institute Carnegie Mellon Universit {stella.u, jshi}@cs.cmu.edu Funded b DARPA HumanID ONR N4---95 Grouping: decomposition
More informationCMPSCI 791BB: Advanced ML: Laplacian Learning
CMPSCI 791BB: Advanced ML: Laplacian Learning Sridhar Mahadevan Outline! Spectral graph operators! Combinatorial graph Laplacian! Normalized graph Laplacian! Random walks! Machine learning on graphs! Clustering!
More informationGraph Metrics and Dimension Reduction
Graph Metrics and Dimension Reduction Minh Tang 1 Michael Trosset 2 1 Applied Mathematics and Statistics The Johns Hopkins University 2 Department of Statistics Indiana University, Bloomington November
More informationSpectra of Adjacency and Laplacian Matrices
Spectra of Adjacency and Laplacian Matrices Definition: University of Alicante (Spain) Matrix Computing (subject 3168 Degree in Maths) 30 hours (theory)) + 15 hours (practical assignment) Contents 1. Spectra
More informationDigraph Fourier Transform via Spectral Dispersion Minimization
Digraph Fourier Transform via Spectral Dispersion Minimization Gonzalo Mateos Dept. of Electrical and Computer Engineering University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/
More informationNONLINEAR DIFFUSION PDES
NONLINEAR DIFFUSION PDES Erkut Erdem Hacettepe University March 5 th, 0 CONTENTS Perona-Malik Type Nonlinear Diffusion Edge Enhancing Diffusion 5 References 7 PERONA-MALIK TYPE NONLINEAR DIFFUSION The
More informationFitting a Graph to Vector Data. Samuel I. Daitch (Yale) Jonathan A. Kelner (MIT) Daniel A. Spielman (Yale)
Fitting a Graph to Vector Data Samuel I. Daitch (Yale) Jonathan A. Kelner (MIT) Daniel A. Spielman (Yale) Machine Learning Summer School, June 2009 Given a collection of vectors x 1,..., x n IR d 1,, n
More informationA Nonlocal p-laplacian Equation With Variable Exponent For Image Restoration
A Nonlocal p-laplacian Equation With Variable Exponent For Image Restoration EST Essaouira-Cadi Ayyad University SADIK Khadija Work with : Lamia ZIAD Supervised by : Fahd KARAMI Driss MESKINE Premier congrès
More informationMean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs
Milan J. Math. Vol. 82 (2014) 3 65 DOI 10.1007/s00032-014-0216-8 Published online April 18, 2014 2014 The Author(s) This article is published with open access at Springerlink.com Milan Journal of Mathematics
More informationLecture 10: Dimension Reduction Techniques
Lecture 10: Dimension Reduction Techniques Radu Balan Department of Mathematics, AMSC, CSCAMM and NWC University of Maryland, College Park, MD April 17, 2018 Input Data It is assumed that there is a set
More informationCS 556: Computer Vision. Lecture 13
CS 556: Computer Vision Lecture 1 Prof. Sinisa Todorovic sinisa@eecs.oregonstate.edu 1 Outline Perceptual grouping Low-level segmentation Ncuts Perceptual Grouping What do you see? 4 What do you see? Rorschach
More informationWeighted Nonlocal Laplacian on Interpolation from Sparse Data
Noname manuscript No. (will be inserted by the editor) Weighted Nonlocal Laplacian on Interpolation from Sparse Data Zuoqiang Shi Stanley Osher Wei Zhu Received: date / Accepted: date Abstract Inspired
More informationAn indicator for the number of clusters using a linear map to simplex structure
An indicator for the number of clusters using a linear map to simplex structure Marcus Weber, Wasinee Rungsarityotin, and Alexander Schliep Zuse Institute Berlin ZIB Takustraße 7, D-495 Berlin, Germany
More informationGraph Partitioning Using Random Walks
Graph Partitioning Using Random Walks A Convex Optimization Perspective Lorenzo Orecchia Computer Science Why Spectral Algorithms for Graph Problems in practice? Simple to implement Can exploit very efficient
More informationSpectral Graph Theory
Spectral Graph Theory Aaron Mishtal April 27, 2016 1 / 36 Outline Overview Linear Algebra Primer History Theory Applications Open Problems Homework Problems References 2 / 36 Outline Overview Linear Algebra
More informationSpace-Variant Computer Vision: A Graph Theoretic Approach
p.1/65 Space-Variant Computer Vision: A Graph Theoretic Approach Leo Grady Cognitive and Neural Systems Boston University p.2/65 Outline of talk Space-variant vision - Why and how of graph theory Anisotropic
More informationNetworks and Their Spectra
Networks and Their Spectra Victor Amelkin University of California, Santa Barbara Department of Computer Science victor@cs.ucsb.edu December 4, 2017 1 / 18 Introduction Networks (= graphs) are everywhere.
More informationGraphs in Machine Learning
Graphs in Machine Learning Michal Valko Inria Lille - Nord Europe, France TA: Pierre Perrault Partially based on material by: Mikhail Belkin, Jerry Zhu, Olivier Chapelle, Branislav Kveton October 30, 2017
More informationORIE 4741: Learning with Big Messy Data. Spectral Graph Theory
ORIE 4741: Learning with Big Messy Data Spectral Graph Theory Mika Sumida Operations Research and Information Engineering Cornell September 15, 2017 1 / 32 Outline Graph Theory Spectral Graph Theory Laplacian
More informationSOS Boosting of Image Denoising Algorithms
SOS Boosting of Image Denoising Algorithms Yaniv Romano and Michael Elad The Technion Israel Institute of technology Haifa 32000, Israel The research leading to these results has received funding from
More informationNetwork Topology Inference from Non-stationary Graph Signals
Network Topology Inference from Non-stationary Graph Signals Rasoul Shafipour Dept. of Electrical and Computer Engineering University of Rochester rshafipo@ece.rochester.edu http://www.ece.rochester.edu/~rshafipo/
More informationSTA141C: Big Data & High Performance Statistical Computing
STA141C: Big Data & High Performance Statistical Computing Lecture 12: Graph Clustering Cho-Jui Hsieh UC Davis May 29, 2018 Graph Clustering Given a graph G = (V, E, W ) V : nodes {v 1,, v n } E: edges
More informationData Mining and Analysis: Fundamental Concepts and Algorithms
: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA 2 Department of Computer
More informationLecture 4 Colorization and Segmentation
Lecture 4 Colorization and Segmentation Summer School Mathematics in Imaging Science University of Bologna, Itay June 1st 2018 Friday 11:15-13:15 Sung Ha Kang School of Mathematics Georgia Institute of
More informationUndirected Graphical Models: Markov Random Fields
Undirected Graphical Models: Markov Random Fields 40-956 Advanced Topics in AI: Probabilistic Graphical Models Sharif University of Technology Soleymani Spring 2015 Markov Random Field Structure: undirected
More informationCholesky Decomposition Rectification for Non-negative Matrix Factorization
Cholesky Decomposition Rectification for Non-negative Matrix Factorization Tetsuya Yoshida Graduate School of Information Science and Technology, Hokkaido University N-14 W-9, Sapporo 060-0814, Japan yoshida@meme.hokudai.ac.jp
More informationUnsupervised Clustering of Human Pose Using Spectral Embedding
Unsupervised Clustering of Human Pose Using Spectral Embedding Muhammad Haseeb and Edwin R Hancock Department of Computer Science, The University of York, UK Abstract In this paper we use the spectra of
More informationCrime Modeling with Lévy Flights
Crime Modeling with Lévy Flights Jonah Breslau, 1 Sorathan (Tum) Chaturapruek, 2 Daniel Yazdi 3 Mentors: Professor Theodore Kolokolnikov, 4 Professor Scott McCalla 3 1 Pomona College 2 Harvey Mudd College
More informationCOMPSCI 514: Algorithms for Data Science
COMPSCI 514: Algorithms for Data Science Arya Mazumdar University of Massachusetts at Amherst Fall 2018 Lecture 8 Spectral Clustering Spectral clustering Curse of dimensionality Dimensionality Reduction
More informationNonlinear Diffusion. Journal Club Presentation. Xiaowei Zhou
1 / 41 Journal Club Presentation Xiaowei Zhou Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology 2009-12-11 2 / 41 Outline 1 Motivation Diffusion process
More informationGraphs in Machine Learning
Graphs in Machine Learning Michal Valko Inria Lille - Nord Europe, France TA: Pierre Perrault Partially based on material by: Ulrike von Luxburg, Gary Miller, Mikhail Belkin October 16th, 2017 MVA 2017/2018
More informationExploiting Sparse Non-Linear Structure in Astronomical Data
Exploiting Sparse Non-Linear Structure in Astronomical Data Ann B. Lee Department of Statistics and Department of Machine Learning, Carnegie Mellon University Joint work with P. Freeman, C. Schafer, and
More informationSpectral Clustering on Handwritten Digits Database Mid-Year Pr
Spectral Clustering on Handwritten Digits Database Mid-Year Presentation Danielle dmiddle1@math.umd.edu Advisor: Kasso Okoudjou kasso@umd.edu Department of Mathematics University of Maryland- College Park
More informationDoug Cochran. 3 October 2011
) ) School Electrical, Computer, & Energy Arizona State University (Joint work with Stephen Howard and Bill Moran) 3 October 2011 Tenets ) The purpose sensor networks is to sense; i.e., to enable detection,
More informationLecture: Some Statistical Inference Issues (2 of 3)
Stat260/CS294: Spectral Graph Methods Lecture 23-04/16/2015 Lecture: Some Statistical Inference Issues (2 of 3) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.
More informationLecture 14: Random Walks, Local Graph Clustering, Linear Programming
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 14: Random Walks, Local Graph Clustering, Linear Programming Lecturer: Shayan Oveis Gharan 3/01/17 Scribe: Laura Vonessen Disclaimer: These
More informationCS168: The Modern Algorithmic Toolbox Lectures #11 and #12: Spectral Graph Theory
CS168: The Modern Algorithmic Toolbox Lectures #11 and #12: Spectral Graph Theory Tim Roughgarden & Gregory Valiant May 2, 2016 Spectral graph theory is the powerful and beautiful theory that arises from
More informationData Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs
Data Analysis and Manifold Learning Lecture 9: Diffusion on Manifolds and on Graphs Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture
More informationEE 224 Lab: Graph Signal Processing
EE Lab: Graph Signal Processing In our previous labs, we dealt with discrete-time signals and images. We learned convolution, translation, sampling, and frequency domain representation of discrete-time
More informationRelations Between Adjacency And Modularity Graph Partitioning: Principal Component Analysis vs. Modularity Component Analysis
Relations Between Adjacency And Modularity Graph Partitioning: Principal Component Analysis vs. Modularity Component Analysis Hansi Jiang Carl Meyer North Carolina State University October 27, 2015 1 /
More informationSpectral Feature Selection for Supervised and Unsupervised Learning
Spectral Feature Selection for Supervised and Unsupervised Learning Zheng Zhao Huan Liu Department of Computer Science and Engineering, Arizona State University zhaozheng@asu.edu huan.liu@asu.edu Abstract
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec Stanford University Jure Leskovec, Stanford University http://cs224w.stanford.edu Task: Find coalitions in signed networks Incentives: European
More informationManifold Coarse Graining for Online Semi-supervised Learning
for Online Semi-supervised Learning Mehrdad Farajtabar, Amirreza Shaban, Hamid R. Rabiee, Mohammad H. Rohban Digital Media Lab, Department of Computer Engineering, Sharif University of Technology, Tehran,
More informationThe non-backtracking operator
The non-backtracking operator Florent Krzakala LPS, Ecole Normale Supérieure in collaboration with Paris: L. Zdeborova, A. Saade Rome: A. Decelle Würzburg: J. Reichardt Santa Fe: C. Moore, P. Zhang Berkeley:
More informationECE 521. Lecture 11 (not on midterm material) 13 February K-means clustering, Dimensionality reduction
ECE 521 Lecture 11 (not on midterm material) 13 February 2017 K-means clustering, Dimensionality reduction With thanks to Ruslan Salakhutdinov for an earlier version of the slides Overview K-means clustering
More informationLanguage Acquisition and Parameters: Part II
Language Acquisition and Parameters: Part II Matilde Marcolli CS0: Mathematical and Computational Linguistics Winter 205 Transition Matrices in the Markov Chain Model absorbing states correspond to local
More informationMachine Learning: Basis and Wavelet 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 Haar DWT in 2 levels
Machine Learning: Basis and Wavelet 32 157 146 204 + + + + + - + - 김화평 (CSE ) Medical Image computing lab 서진근교수연구실 7 22 38 191 17 83 188 211 71 167 194 207 135 46 40-17 18 42 20 44 31 7 13-32 + + - - +
More informationCommunities, Spectral Clustering, and Random Walks
Communities, Spectral Clustering, and Random Walks David Bindel Department of Computer Science Cornell University 26 Sep 2011 20 21 19 16 22 28 17 18 29 26 27 30 23 1 25 5 8 24 2 4 14 3 9 13 15 11 10 12
More informationLecture 13 Spectral Graph Algorithms
COMS 995-3: Advanced Algorithms March 6, 7 Lecture 3 Spectral Graph Algorithms Instructor: Alex Andoni Scribe: Srikar Varadaraj Introduction Today s topics: Finish proof from last lecture Example of random
More informationUNCERTAINTY QUANTIFICATION IN THE CLASSIFICATION OF HIGH DIMENSIONAL DATA
UNCERTAINTY QUANTIFICATION IN THE CLASSIFICATION OF HIGH DIMENSIONAL DATA ANDREA L BERTOZZI, XIYANG LUO, ANDREW M. STUART, AND KONSTANTINOS C. ZYGALAKIS Abstract. Classification of high dimensional data
More informationSpectral Generative Models for Graphs
Spectral Generative Models for Graphs David White and Richard C. Wilson Department of Computer Science University of York Heslington, York, UK wilson@cs.york.ac.uk Abstract Generative models are well known
More informationORIE 6334 Spectral Graph Theory September 22, Lecture 11
ORIE 6334 Spectral Graph Theory September, 06 Lecturer: David P. Williamson Lecture Scribe: Pu Yang In today s lecture we will focus on discrete time random walks on undirected graphs. Specifically, we
More informationAsymmetric Cheeger cut and application to multi-class unsupervised clustering
Asymmetric Cheeger cut and application to multi-class unsupervised clustering Xavier Bresson Thomas Laurent April 8, 0 Abstract Cheeger cut has recently been shown to provide excellent classification results
More informationReconstruction in the Generalized Stochastic Block Model
Reconstruction in the Generalized Stochastic Block Model Marc Lelarge 1 Laurent Massoulié 2 Jiaming Xu 3 1 INRIA-ENS 2 INRIA-Microsoft Research Joint Centre 3 University of Illinois, Urbana-Champaign GDR
More informationEfficient Solvers for Stochastic Finite Element Saddle Point Problems
Efficient Solvers for Stochastic Finite Element Saddle Point Problems Catherine E. Powell c.powell@manchester.ac.uk School of Mathematics University of Manchester, UK Efficient Solvers for Stochastic Finite
More information