Mining globally distributed frequent subgraphs in a single labeled graph
Recent years have observed increasing efforts on graph mining and many algorithms have been developed for this purpose. However, most of the existing algorithms are designed for discovering frequent subgraphs in a set of labeled graphs only. Also, the few algorithms that find frequent subgraphs in a...
Saved in:
Main Authors: | JIANG, Xing, XIONG, Hui, WANG, Chen, TAN, Ah-hwee |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/5196 https://ink.library.smu.edu.sg/context/sis_research/article/6199/viewcontent/1_s2.0_S0169023X09000585_main.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Efficient mining of frequent XML query patterns with repeating-siblings
by: Yang, L.H., et al.
Published: (2013) -
GRAONTO: A graph-based approach for automatic construction of domain ontology
by: Hou, X., et al.
Published: (2014) -
Mining normalized weighted frequent sequential patterns with Time intervals algorithm
by: Trần Huy Dương, Vũ Đức Thi
Published: (2016) -
Compressed hierarchical mining of frequent closed patterns from dense data sets
by: Ji, L., et al.
Published: (2013) -
Discovering frequent weak XML patterns
by: ZHOU FENG
Published: (2019)