PPT-Node Similarity, Graph Similarity and Matching:

Theory and Applications Danai Koutra CMU Tina EliassiRad Rutgers Christos Faloutsos CMU SDM 2014 Friday April 25 th 2014 Philadelphia PA Who we are Danai Koutra CMU Node and graph similarity. Nima Sarshar, Ph.D.. INTUIT . Inc. ,. Nima_sarshar@intuit.com . Intuit, . Graphs and Me. Me: . Large-scale graph data processing, complex networks analysis, graph algorithms … . Intuit: . QuickBooks, TurboTax, . Given:. A query image. A database of images with known locations. Two types of approaches:. Direct matching. : directly match image features to 3D points (high memory requirement). Retrieval based. : retrieve a short list of most similar images and perform image matching. Adapted from UMD Jimmy Lin’s slides, which . is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 United . States. See . http://. creativecommons.org. /licenses/by-. nc. -. from . GOMMA. Michael . Hartung. , Lars Kolb, . Anika. . Groß. , Erhard Rahm. Database . Research Group. University of . Leipzig. 9th . Intl. . . Conf. . on Data Integration. in . the. Life . Sciences. Arijit Khan, . Yinghui. Wu, Xifeng Yan. Department of Computer Science. University of California, Santa Barbara. {. arijitkhan. , . yinghui. , . xyan. }@. cs.ucsb.edu. Graph Data. 2. Graphs are everywhere.. Philip A. Bernstein Microsoft Corp.. Jayant . Madhavan. Google. Erhard Rahm Univ. of Leipzig. Copyright © 2011 Microsoft Corp.. The . problem of generating . correspondences between . a Multi-Layered Indexing Approach. Yongjiang Liang, . Peixiang Zhao. CS @ FSU. zhao@cs.fsu.edu. Outline. Introduction. State-of-the-art solutions. ML-Index & similarity search. Experiments. Conclusion. ISQS3358, Spring 2016. Graph Database. A . graph database is a database that uses graph structures for semantic queries with nodes, edges and properties to represent and store data. .. Graph databases employ nodes, properties, and edges.. R. Srikant. ECE/CSL. UIUC. Coauthor. Joseph . Lubars. Problem Statement. Given two correlated graphs…. One with known node identities, . One with unknown (or incorrect) node identities… . Goal: Infer the identities of the nodes in the second graph. Principle Component Analysis. (PCA. ). . Jiali. . zhang. , . X. iaohong. . Liu . MS Statistics Student. SAN JOSE STATE UNIVERSITY . 12/10/2015. T. he . D. efinition of Image . Outline. Link Analysis Concepts. Metrics for Analyzing Networks. PageRank. HITS. Link Prediction. 2. Link Analysis Concepts. Link. A relationship between two entities. Network or Graph. A collection of entities and links between them. Matching Algorithms and Networks Algorithms and Networks: Matching 2 This lecture Matching: problem statement and applications Bipartite matching (recap) Matching in arbitrary undirected graphs: Edmonds algorithm Quiz. Which pair of words exhibits the greatest similarity?. 1. Deer-elk. 2. Deer-horse. 3. Deer-mouse. 4. Deer-roof. Quiz Answer. Which pair of words exhibits the greatest similarity?. 1. Deer-elk. 2. Deer-horse. Li, Mark Drew. School of Computing Science, . Simon . Fraser University, . Vancouver. , B.C., Canada. {zza27, . li. , mark}@. cs.sfu.ca. Learning Image Similarities via Probabilistic Feature Matching.