Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/904

Title: Mining Tree Queries in a Graph
Authors: GOETHALS, Bart
HOEKX, Eveline
Keywords: SQL
Canonical form
Conjunctive query
Equivalence checking
Redundancy checking
Tree query
Issue Date: 2005
Publisher: ACM Press
Citation: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. p. 61-69.
Abstract: We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes which are not counted when determining the number of occurrences of the pattern in the graph. Our algorithm has a number of provable optimality properties, which are based on the theory of conjunctive database queries. We propose a database-oriented implementation in SQL, and report upon some initial experimental results obtained with our implementation on graph data about food webs, about protein interactions, and about citation analysis.
URI: http://hdl.handle.net/1942/904
Link to publication: http://portal.acm.org/citation.cfm?doid=1081881
ISBN: 1-59593-135-X
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A129.05 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.