Show simple item record

dc.contributor.convenorJan-Olof Eklundh, Yuichi Ohta, Steven Tanimoto
dc.contributor.authorDahm, Nicholas
dc.contributor.authorBunke, Horst
dc.contributor.authorCaelli, Terry
dc.contributor.authorGao, Yongsheng
dc.contributor.editorIAPR
dc.date.accessioned2017-05-03T14:13:07Z
dc.date.available2017-05-03T14:13:07Z
dc.date.issued2012
dc.date.modified2013-08-22T23:30:59Z
dc.identifier.isbn978-1-4673-2216-4
dc.identifier.issn1051-4651
dc.identifier.refurihttp://www.icpr2012.org/index.html
dc.identifier.urihttp://hdl.handle.net/10072/52321
dc.description.abstractIn this paper we tackle the problem of subgraph isomorphism detection on large graphs, which may commonly be intractable, even with state of the art algorithms. Rather than competing with other matching algorithms, we define enhancements that can be used by (almost) any subgraph isomorphism algorithm, both current and future. These enhancements consist of a number of topological features to be added to the nodes, and a technique which we term "iterative node elimination". The fusion of these enhancements is shown to be able to reduce subgraph isomorphism matching times by a factor of over 4,500.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent85584 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoeng
dc.publisherInternational Association for Pattern Recognition
dc.publisher.placeJapan
dc.publisher.urihttp://www.icpr2012.org/index.html
dc.publisher.urihttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6460344&tag=1
dc.relation.ispartofstudentpublicationY
dc.relation.ispartofconferencename21st International Conference on Pattern Recognition (ICPR)
dc.relation.ispartofconferencetitle2012 21ST INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR 2012)
dc.relation.ispartofdatefrom2012-11-11
dc.relation.ispartofdateto2012-11-15
dc.relation.ispartoflocationUniv Tsukuba, Tsukuba, JAPAN
dc.relation.ispartofpagefrom1164
dc.relation.ispartofpagefrom4 pages
dc.relation.ispartofpageto1167
dc.relation.ispartofpageto4 pages
dc.rights.retentionY
dc.subject.fieldofresearchPattern Recognition and Data Mining
dc.subject.fieldofresearchcode080109
dc.titleTopological Features and Iterative Node Elimination for Speeding up Subgraph Isomorphism Detection
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
gro.facultyGriffith Sciences, Griffith School of Engineering
gro.rights.copyright© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
gro.date.issued2012
gro.hasfulltextFull Text
gro.griffith.authorCaelli, Terrence M.
gro.griffith.authorGao, Yongsheng
gro.griffith.authorDahm, Nicholas


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record