Minimal vertex unique labelled subgraph mining

7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper introduces the concept of Vertex Unique Labelled Subgraph Mining (VULSM), a specialised form of subgraph mining. A VULS is a subgraph defined by a set of edge labels that has a unique vertex labelling associated with it. A minimal VULS is then a VULS which is not a supergraph of any other VULS. The application considered in this paper, for evaluation purposes, is error prediction with respect to sheet metal forming. The minimum BFS Right-most Extension Unique Subgraph Mining (Min-BFS-REUSM) algorithm is introduced for identifying minimal VULS using a Breadth First Search(BFS) strategy. © 2013 Springer-Verlag GmbH.

Author supplied keywords

Cite

CITATION STYLE

APA

Yu, W., Coenen, F., Zito, M., & El Salhi, S. (2013). Minimal vertex unique labelled subgraph mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8057 LNCS, pp. 317–326). https://doi.org/10.1007/978-3-642-40131-2_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free