GraphSig : A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases

Sep 12, 2014

30 likes | 266 Views

GraphSig : A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases. Sayan Ranu , Ambuj K. Singh Department of Computer Science University of California, Santa Barbara ICDE 2009. Outline.

Share Presentation

Embed Code

Link

department
scalable approach
santa barbara
sayan ranu
mining significant subgraphs
computer science university

jag

Download Presentation

GraphSig : A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

GraphSig : A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases Sayan Ranu , Ambuj K. Singh Department of Computer Science University of California, Santa Barbara ICDE 2009
Outline

Graph Sparsification by Effective Resistances

Graph Sparsification by Effective Resistances. Daniel Spielman Nikhil Srivastava Yale. Sparsification. Approximate any graph G by a sparse graph H . Nontrivial statement about G H is faster to compute with than G. G. H. Cut Sparsifiers [Benczur-Karger’96]. H approximates G if

1.39k views • 76 slides

SE561 Math Foundations Week 11 Graphs I

SE561 Math Foundations Week 11 Graphs I. Agenda –Graphs . Graph basics and definitions Vertices/nodes, edges, adjacency, incidence Degree, in-degree, out-degree Degree, in-degree, out-degree Subgraphs, unions, isomorphism Adjacency matrices Types of Graphs Trees Undirected graphs

1.35k views • 90 slides

The Software Infrastructure for Electronic Commerce

The Software Infrastructure for Electronic Commerce. Databases and Data Mining Lecture 3: An Introduction To Data Mining (I) Johannes Gehrke johannes@cs.cornell.edu http://www.cs.cornell.edu/johannes. Lectures Three and Four. Data preprocessing Multidimensional data analysis Data mining

1.08k views • 85 slides

Data Mining: Concepts and Techniques — Slides for Textbook — — Chapter 6 —

Data Mining: Concepts and Techniques — Slides for Textbook — — Chapter 6 —. © Jiawei Han and Micheline Kamber Intelligent Database Systems Research Lab School of Computing Science Simon Fraser University, Canada http://www.cs.sfu.ca. Chapter 6: Mining Association Rules in Large Databases.

1.94k views • 82 slides

Data Mining

Data Mining. Outline. What is data mining? Data Mining Tasks Association Classification Clustering Data mining Algorithms Are all the patterns interesting?. What is Data Mining:.

1.49k views • 117 slides

The Bar Graph or Bar Chart

The Bar Graph or Bar Chart. What is it? How to Draw it. What is a Bar Graph?. A bar graph is a graph that displays the frequency or numerical distribution of a categorical variable, showing values for each bar next to each other for easy comparison. Alternate Name: Bar Chart .

1.26k views • 72 slides

Towards Scalable and Energy-Efficient Memory System Architectures

Towards Scalable and Energy-Efficient Memory System Architectures. Rajeev Balasubramonian , Al Davis, Ani Udipi , Kshitij Sudan, Manu Awasthi , Nil Chatterjee , Seth Pugsley , Manju Shevgoor School of Computing University of Utah. Towards Scalable and Energy-Efficient

1.07k views • 86 slides

Scalable Methods for Graph-Based Unsupervised and Semi-Supervised Learning

Scalable Methods for Graph-Based Unsupervised and Semi-Supervised Learning. Frank Lin Language Technologies Institute School of Computer Science Carnegie Mellon University PhD Thesis Proposal October 8, 2010, Pittsburgh, PA, USA Thesis Committee

1.19k views • 97 slides

Mining Billion-Node Graphs: Patterns and Algorithms

Mining Billion-Node Graphs: Patterns and Algorithms. Christos Faloutsos CMU. Thank you!. Dr. Ching-Hao (Eric) Mao Prof. Kenneth Pao. Our goal:. Open source system for mining huge graphs: PEGASUS project (PEta GrAph mining System) www.cs.cmu.edu/~pegasus code and papers. Outline.

1.34k views • 119 slides

Scalable many-light methods

Scalable many-light methods. Jaroslav Křivánek Charles University in Prague. Instant radiosity. Approximate indirect illumination by Virtual Point Lights (VPLs). Render with VPLs. Generate VPLs. Instant radiosity with glossy surfaces. Large number of VPLs required

1.43k views • 126 slides

Math 160

Math 160. 2.2/2.5 – Graphs and Transformations of Functions. Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1. Graph . Ex 1.

1.29k views • 101 slides

Data Mining: Concepts and Techniques — Chapter 5 — Mining Frequent Patterns

Data Mining: Concepts and Techniques — Chapter 5 — Mining Frequent Patterns. Slide credits: Jiawei Han and Micheline Kamber George Kollios. Chapter 5: Mining Frequent Patterns, Association and Correlations. Basic concepts Efficient and scalable frequent itemset mining methods

2.03k views • 126 slides

Introduction to Graph Data Structure Applications Graph Searching Minimum Spanning Trees

Introduction to Graph Data Structure Applications Graph Searching Minimum Spanning Trees Shortest Path problems. Graph Definitions. A graph G is denoted by G = (V, E) where V is the set of vertices or nodes of the graph E is the set of edges or arcs connecting the vertices in V

5.21k views • 133 slides

Alignment of large genomic sequences

Alignment of large genomic sequences. Fragment-based alignment approach ( DIALIGN ) useful for alignment of genomic sequences. Possible applications: Detection of regulatory elements Identification of pathogenic microorganisms Gene prediction. The DIALIGN approach.

1.82k views • 158 slides

Chapter 19: Distributed Databases

Chapter 19: Distributed Databases. Heterogeneous and Homogeneous Databases Distributed Data Storage Distributed Transactions Commit Protocols Concurrency Control in Distributed Databases Availability Distributed Query Processing Heterogeneous Distributed Databases Directory Systems.

1.36k views • 102 slides

Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques. These slides have been adapted from Han, J., Kamber, M., & Pei, Y. Data Mining: Concepts and Technique. Chapter 4: Data Cube Technology. Efficient Computation of Data Cubes Exploration and Discovery in Multidimensional Databases Summary.

2.01k views • 144 slides

Mining Billion-node Graphs: Patterns, Generators and Tools

Mining Billion-node Graphs: Patterns, Generators and Tools. Christos Faloutsos CMU (on sabbatical at google). Our goal:. Open source system for mining huge graphs: PEGASUS project (PEta GrAph mining System) www.cs.cmu.edu/~pegasus code and papers. Outline. Introduction – Motivation

1.54k views • 138 slides

Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques. These slides have been adapted from Han, J., Kamber, M., & Pei, Y. Data Mining: Concepts and Technique. Chapter 5: Mining Frequent Patterns, Association and Correlations. Basic concepts and a road map Scalable frequent itemset mining methods

1.59k views • 106 slides

Association Rule Mining

Association Rule Mining. Chapter 5: Mining Frequent Patterns, Association and Correlations. Basic concepts and a road map Efficient and scalable frequent itemset mining methods Mining various kinds of association rules From association mining to correlation analysis

1.93k views • 92 slides

HAPTER 4

HAPTER 4. Relational Databases. INTRODUCTION. Questions to be addressed in this chapter: How are databases different than file-based legacy systems? Why are databases important and what is their advantage? What is the difference between logical and physical views of a database?

1.11k views • 96 slides

15-826: Multimedia Databases and Data Mining

15-826: Multimedia Databases and Data Mining. Lecture #25: Time series mining and forecasting Christos Faloutsos. Must-Read Material.

2.04k views • 180 slides

More Related