Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/904
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GOETHALS, Bart | - |
dc.contributor.author | HOEKX, Eveline | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2006-01-23T13:24:24Z | - |
dc.date.available | 2006-01-23T13:24:24Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. p. 61-69. | - |
dc.identifier.isbn | 1-59593-135-X | - |
dc.identifier.uri | http://hdl.handle.net/1942/904 | - |
dc.description.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. | - |
dc.format.extent | 132146 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | ACM Press | - |
dc.subject | SQL | - |
dc.subject | Canonical form | - |
dc.subject | Conjunctive query | - |
dc.subject | Equivalence checking | - |
dc.subject | Graph | - |
dc.subject | Levelwise | - |
dc.subject | Redundancy checking | - |
dc.subject | Tree query | - |
dc.title | Mining Tree Queries in a Graph | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.conferencename | Conference on Knowledge Discovery in Data | - |
local.bibliographicCitation.conferenceplace | Chicago, Illinois, USA | - |
dc.identifier.epage | 69 | - |
dc.identifier.spage | 61 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C2 | - |
dc.identifier.url | http://portal.acm.org/citation.cfm?doid=1081881 | - |
local.bibliographicCitation.btitle | Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining | - |
item.accessRights | Open Access | - |
item.fulltext | With Fulltext | - |
item.fullcitation | GOETHALS, Bart; HOEKX, Eveline & VAN DEN BUSSCHE, Jan (2005) Mining Tree Queries in a Graph. In: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining. p. 61-69.. | - |
item.contributor | GOETHALS, Bart | - |
item.contributor | HOEKX, Eveline | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
chicago.pdf | 129.05 kB | Adobe PDF | View/Open |
Page view(s)
92
checked on Nov 7, 2023
Download(s)
146
checked on Nov 7, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.