Show simple item record

dc.contributor.author Cuzzocrea, Alfredo
dc.contributor.author Jiang, Fan
dc.contributor.author Leung, Carson K.
dc.date.accessioned 2016-03-08T22:14:41Z
dc.date.available 2016-03-08T22:14:41Z
dc.date.issued 2015
dc.identifier.citation A. Cuzzocrea, F. Jiang, & C.K. Leung. Frequent subgraph mining from streams of linked graph structured data. In Proc. EDBT/ICDT Workshops 2015, pp. 237-244. en_US
dc.identifier.other http://ceur-ws.org/Vol-1330/paper-37.pdf
dc.identifier.uri http://hdl.handle.net/1993/31152
dc.description A. Cuzzocrea, F. Jiang, & C.K. Leung. Frequent subgraph mining from streams of linked graph structured data. In Proc. EDBT/ICDT Workshops 2015, pp. 237-244. This paper is published in the Workshop Proceedings of the EDBT/ICDT 2015 Joint Conference (March 27, 2015, Brussels, Belgium) on CEUR-WS.org (ISSN 1613-0073) under the terms of the Creative Commons license CC-by-nc-nd 4.0 (http://creativecommons.org/licenses/by-nc-nd/4.0). en_US
dc.description.abstract Nowadays, high volumes of high-value data (e.g., semantic web data) can be generated and published at a high velocity. A collection of these data can be viewed as a big, interlinked, dynamic graph structure of linked resources. Embedded in them are implicit, previously unknown, and potentially useful knowledge. Hence, efficient knowledge discovery algorithms for mining frequent subgraphs from these dynamic, streaming graph structured data are in demand. Some existing algorithms require very large memory space to discover frequent subgraphs; some others discover collections of frequently co-occurring edges (which may be disjoint). In contrast, we propose---in this paper---algorithms that use limited memory space for discovering collections of frequently co-occurring connected edges. Evaluation results show the effectiveness of our algorithms in frequent subgraph mining from streams of linked graph structured data. en_US
dc.description.sponsorship Natural Sciences and Engineering Research Council of Canada (NSERC); University of Manitoba en_US
dc.language.iso en en_US
dc.publisher CEUR Workshop Proceedings en_US
dc.relation.ispartofseries CEUR Workshop Proceedings (ISSN 1613-0073);Vol. 1330
dc.rights info:eu-repo/semantics/openAccess
dc.subject data mining en_US
dc.subject frequent patterns en_US
dc.subject graph structured data en_US
dc.subject linked data en_US
dc.subject extending database technology en_US
dc.subject database theory en_US
dc.title Frequent subgraph mining from streams of linked graph structured data en_US
dc.type Article en_US
dc.type info:eu-repo/semantics/article


Files in this item

This item appears in the following Collection(s)

  • Research Publications [1199]
    This collection contains full text research publications authored or co-authored by University of Manitoba researchers.

Show simple item record

View Statistics