loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
Full Perfect Extension Pruning for Frequent Graph Mining
Hong Kong, China
December 18-December 22
ISBN: 0-7695-2702-7
ASCII Text
x 
 
Christian Borgelt, Thorsten Meinl, "Full Perfect Extension Pruning for Frequent Graph Mining," Data Mining Workshops, International Conference on, pp. 263-268, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ICDMW.2006.82,
author = {Christian Borgelt and Thorsten Meinl},
title = {Full Perfect Extension Pruning for Frequent Graph Mining},
journal ={Data Mining Workshops, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2702-7},
pages = {263-268},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDMW.2006.82},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Mining Workshops, International Conference on
TI - Full Perfect Extension Pruning for Frequent Graph Mining
SN - 0-7695-2702-7
SP263
EP268
A1 - Christian Borgelt,
A1 - Thorsten Meinl,
PY - 2006
KW - null
VL - 0
JA - Data Mining Workshops, International Conference on
ER -
 
Christian Borgelt, European Center for Soft Computing, Spain
Thorsten Meinl, University of Konstanz
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algorithms and to enhance their capability to find meaningful graph fragments. Here we present a method to achieve the former, namely an improvement of what we called ?perfect extension pruning? in an earlier paper [2]. With it the number of generated fragments and visited search tree nodes can be reduced, thus accelerating the search.
Citation:
Christian Borgelt, Thorsten Meinl, "Full Perfect Extension Pruning for Frequent Graph Mining," icdmw, pp.263-268, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.