Advanced graph mining

© All Rights Reserved

1 views

Advanced graph mining

© All Rights Reserved

- Less Conservative Consensus of Multi-agent Systems with Generalized Lipschitz Nonlinear Dynamics
- Maths_SQP.pdf
- Matrices(Form 5)
- Spm Mm Ans (Kedah)
- Lab 01 Introduction to Matlab
- Introduction to Maxima (Richard H. Rand)
- r059210502 Mathematical Foundation of Computer Science
- Berkeley
- Final Report
- ms_series_math
- Untitled
- Cs0353 Software Testing (1)
- Qualitative Analysis of Linear Autonomous Systems With Constant Coefficients
- MR 2 2013 Solutions
- Course Outline Part a (1)
- Syllabus Xi Xii Pcmbe
- 2015-Rph Matematik Bm
- ecc_lab
- M.sc_. Statistics 2014-15
- Bai-Tap-buoi-1-B.pdf

You are on page 1of 19

Frequent Substructures from Graph Data

AGM

to

efficiently

mine

the

association

rules

among

the

frequently appearing sub-structures

in a given graph data set.

A graph transaction is represented by

an adjacency matrix, and the

frequent patterns appearing in the

matrices are mined through the

extended algorithm of the basket

analysis.

size of a graph G is the number of

vertices in V (G), i.e., k in Definition 1.

Definition 4 (Graph Transaction and

Graph Data) A graph G = (V (G),

E(G),L(V (G)), L(E(G))) is a transaction,

and graph data GD is a set of the

transactions, where GD = {G1,G2,

Gn}

Matrix) The adjacency matrix Xk of

the graph G(Xk) is vertex-sorted if

num(lb(vi)) < num(lb(vi+1)) for i = 1,

2,.... k 1.

elements along the columns at the upper

triangular part of Xk.

induced if Es contains all the edges

of E that connect vertices in Vs.

This algorithm extends subgraphs by

adding one vertex at each step.

elements of the matrices except for

the elements of the k-th row and the

k-th column, then they are joined to

generate Zk+1.

0

1

0

0

1

0

0

0

1

1

0

0

1

0

0

0

1

0

0

0

1

0

0

0

1

0

0

0

1

0

0

0

1

1

0

0

1

0

0 1 1 0 0 0

1 0 0 0 1 1

1 0 0 1 0 0

0

0

1

0

0

0 0 1 0 0 0

0 1 0 0 0 0

0 1 0 0 0 0

0

1

0

0

0

to each edge label lb or 0 corresponding to the case that

no edge exists between vk and vk+1.

In case of an undirected graph, zk;k+1 and zk+1;k must

have an identical value.

This join procedure of Xk and Yk creates multiple Zk+1s

for all possible value pairs of zk,k+1 and zk+1,k.

Note that when the labels of the k-th vertices vk of G(Xk)

and G(Yk) are the same, exchanging Xk and Yk (i.e.,

taking Yk as the first matrix and Xk as the second

matrix), produces redundant adjacent matrices.

In order to avoid this redundant generation, the two

adjacency matrices are joined only when Eq.(3) is

satisfied. The vertex-sorted adjacency matrix generated

under this condition is called a normal form".

code(the first matrix) <code(the second matrix)

(3)

representation is in general not

unique for a graph.

For instance, the following two

matrices which are both normal

forms represent an identical

undirected graph with a unique link

label.

representation independently, it has to be summed

up to obtain the correct support value for the

corresponding graph.

To perform this summation efficiently, all normal

forms for an identical induced subgraph must be

indexed.

For this purpose, canonical form is defined for

normal forms of adjacency matrices representing

an identical induced subgraph, and an efficient

method to index each normal form to its canonical

form is introduced.

induced subgraphs in a graph

database that satisfy a certain

minimum support constraint.

- Less Conservative Consensus of Multi-agent Systems with Generalized Lipschitz Nonlinear DynamicsUploaded byInternational Journal of Research in Engineering and Science
- Maths_SQP.pdfUploaded byNirvana Adithya Visiobibliophobiatic Guy
- Matrices(Form 5)Uploaded byNurul Aini Arnis
- Spm Mm Ans (Kedah)Uploaded bySimPor
- Lab 01 Introduction to MatlabUploaded bySalman Khan
- Introduction to Maxima (Richard H. Rand)Uploaded bydennisgabil
- r059210502 Mathematical Foundation of Computer ScienceUploaded byandhracolleges
- BerkeleyUploaded bykskumar84
- Final ReportUploaded byvijayakumarvarma
- ms_series_mathUploaded bySarath Htaras
- UntitledUploaded bymr_nick09
- Cs0353 Software Testing (1)Uploaded byhossein_eskandar
- Qualitative Analysis of Linear Autonomous Systems With Constant CoefficientsUploaded byChristian Sarmiento
- MR 2 2013 SolutionsUploaded bywebbos
- Course Outline Part a (1)Uploaded bydavy123
- Syllabus Xi Xii PcmbeUploaded bysecret2016
- 2015-Rph Matematik BmUploaded bystudentmbs
- ecc_labUploaded bykhinhkha
- M.sc_. Statistics 2014-15Uploaded bydixson1965
- Bai-Tap-buoi-1-B.pdfUploaded byDang Cong San
- Mathematical Modelling of Laminated PlatUploaded byjamil
- Ramanujan(1).1Uploaded byVinay Kumar
- Course Outline NeuUploaded byKashif Amjad
- Lab 1%2c2%2c3%2c4 ControlUploaded byKathlyn Yanguez
- aninda comp.docxUploaded byabhinav anand
- ComputerScienceandInformationTechnology_62Uploaded byLokesh Sai Kumar Dasari
- ME372.pdfUploaded bySham Varughese
- 02_The-Basics_Part1.pdfUploaded byamila_vithanage
- introUploaded byodimuthu
- 2015 Finite Element KumarUploaded byDr. Ashok Kr Dargar

- TransportationModel Handout1 Introduction NWCM MMCMUploaded byM Yasin Memon
- Summerprojectreport( Sriram.G IITKanpur)Uploaded byakinojohnkennedy
- Percept Implementation Character RecognitionUploaded byJalil Ramirez
- Partial Differentiation - GATE Study Material in PDFUploaded byTestbook Blog
- Normal CurveUploaded byGina Sabas Dela Vega
- ESMUploaded byAniket Raut
- ch6Uploaded byPradeep Joshi
- hemh109Uploaded byreet_26
- group9Uploaded byd_k_Ü
- Equillibrium of Coplanar Concurrent ForcesUploaded bysalman husain
- unit 2 the concept of congruence study guideUploaded byapi-294397535
- A-Math Formula List - Additional Math (4047) Updated 6th Apr 2015Uploaded byChong Jing Ting Victoria
- mathsUploaded byKalikivayi Shiva
- Gator Mathematics Competition 2013 Tests and SolutionsUploaded byAndrew Hua
- 9709_s14_qp_12Uploaded bySaqib359
- Term Paper MathsUploaded byNavneet Singh
- Coordinate Geometry Loney SLUploaded byDivyaGoel1
- haukurReportUploaded byParthasarathy P
- Einstein Fields EquationsUploaded bydendi231
- Coordinate AllenUploaded byabhishek0909
- Algorithm and Computation ComplexityUploaded bykrupanick24
- Do Cum en ToUploaded byFrekes Villas
- DeterminantsUploaded byDharti
- Linear Methods for ClassificationUploaded byelcebir
- Weightage AnalysisUploaded byResonance Kota
- 100aHW3SolnUploaded byadeeysf
- Complex Numbers SolUploaded bySovan Samanta
- Lecture 2006Uploaded byCarlos Reyes
- Simplex Method Steven Sons)Uploaded byDhaval Thakkar
- KeyConcept_SC0x_SV.pdfUploaded byAnup Mohapatra

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.