Name
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 SearchBFS strategy. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-40131-2_28 | DaWaK |
Keywords | Field | DocType |
data mining | Data mining,Vertex (geometry),Computer science,Vertex (graph theory),Breadth-first search,Induced subgraph isomorphism problem,Epigraph,Subgraph isomorphism problem | Conference |
Citations | PageRank | References |
7 | 0.50 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wen Yu | 1 | 381 | 39.20 |
| Frans Coenen | 2 | 1283 | 131.80 |
| Michele Zito | 3 | 335 | 27.56 |
| Subhieh El-Salhi | 4 | 17 | 2.98 |