Frequent Subgraph Mining

Brent E. Harrison; Jason C. Smith; Stephen G. Ware; Hsiao Wei Chen; Wenbin Chen; Anjali Khatri

doi:10.1201/b15352-11

Frequent Subgraph Mining

Brent E. Harrison, Jason C. Smith, Stephen G. Ware, Hsiao Wei Chen, Wenbin Chen, Anjali Khatri

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

1 Scopus citations

Abstract

Frequent Subgraph Mining (FSM) is the process of discovering subgraphs that occur often in a database of other graphs. In this context, often means that the graph in question occurs more than some arbitrary threshold number of times.

Original language	English
Title of host publication	Practical Graph Mining with R
Pages	167-204
Number of pages	38
ISBN (Electronic)	9781439860854
DOIs	https://doi.org/10.1201/b15352-11
State	Published - Jan 1 2013

Bibliographical note

Publisher Copyright:
© 2014 by Taylor and Francis Group, LLC.

ASJC Scopus subject areas

Economics, Econometrics and Finance (all)
Business, Management and Accounting (all)
Computer Science (all)

Access to Document

10.1201/b15352-11

Cite this

@inbook{2e33b9a7493e43e4977933ded591a87f,

title = "Frequent Subgraph Mining",

abstract = "Frequent Subgraph Mining (FSM) is the process of discovering subgraphs that occur often in a database of other graphs. In this context, often means that the graph in question occurs more than some arbitrary threshold number of times.",

author = "Harrison, {Brent E.} and Smith, {Jason C.} and Ware, {Stephen G.} and Chen, {Hsiao Wei} and Wenbin Chen and Anjali Khatri",

note = "Publisher Copyright: {\textcopyright} 2014 by Taylor and Francis Group, LLC.",

year = "2013",

month = jan,

day = "1",

doi = "10.1201/b15352-11",

language = "English",

isbn = "9781439860847",

pages = "167--204",

booktitle = "Practical Graph Mining with R",

}

TY - CHAP

T1 - Frequent Subgraph Mining

AU - Harrison, Brent E.

AU - Smith, Jason C.

AU - Ware, Stephen G.

AU - Chen, Hsiao Wei

AU - Chen, Wenbin

AU - Khatri, Anjali

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Frequent Subgraph Mining (FSM) is the process of discovering subgraphs that occur often in a database of other graphs. In this context, often means that the graph in question occurs more than some arbitrary threshold number of times.

AB - Frequent Subgraph Mining (FSM) is the process of discovering subgraphs that occur often in a database of other graphs. In this context, often means that the graph in question occurs more than some arbitrary threshold number of times.

UR - http://www.scopus.com/inward/record.url?scp=85070795702&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85070795702&partnerID=8YFLogxK

U2 - 10.1201/b15352-11

DO - 10.1201/b15352-11

M3 - Chapter

AN - SCOPUS:85070795702

SN - 9781439860847

SP - 167

EP - 204

BT - Practical Graph Mining with R

ER -

Frequent Subgraph Mining

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this