Matches in SemOpenAlex for { <https://semopenalex.org/work/W4313143765> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W4313143765 endingPage "471" @default.
- W4313143765 startingPage "457" @default.
- W4313143765 abstract "Owing to their versatility, graph structures admit representations of intricate relationships between the separate entities comprising the data. We formalise the notion of connection between two vertex sets in terms of edge and vertex features by introducing graph-walking programs. We give two algorithms for mining of deterministic graph-walking programs that yield programs in the order of increasing length. These programs characterise linear long-distance relationships between the given two vertex sets in the context of the whole graph." @default.
- W4313143765 created "2023-01-06" @default.
- W4313143765 creator A5033912158 @default.
- W4313143765 creator A5078339613 @default.
- W4313143765 date "2022-01-01" @default.
- W4313143765 modified "2023-10-01" @default.
- W4313143765 title "Deterministic Graph-Walking Program Mining" @default.
- W4313143765 cites W1655078475 @default.
- W4313143765 cites W182321187 @default.
- W4313143765 cites W19046872 @default.
- W4313143765 cites W2017099446 @default.
- W4313143765 cites W2034574601 @default.
- W4313143765 cites W2072335343 @default.
- W4313143765 cites W2086254934 @default.
- W4313143765 cites W2133011836 @default.
- W4313143765 cites W2135282325 @default.
- W4313143765 cites W2626990892 @default.
- W4313143765 cites W2768510408 @default.
- W4313143765 cites W2901330051 @default.
- W4313143765 cites W2953054522 @default.
- W4313143765 cites W3174357804 @default.
- W4313143765 cites W4246238740 @default.
- W4313143765 cites W4252043682 @default.
- W4313143765 cites W4253977062 @default.
- W4313143765 doi "https://doi.org/10.1007/978-3-031-22064-7_33" @default.
- W4313143765 hasPublicationYear "2022" @default.
- W4313143765 type Work @default.
- W4313143765 citedByCount "0" @default.
- W4313143765 crossrefType "book-chapter" @default.
- W4313143765 hasAuthorship W4313143765A5033912158 @default.
- W4313143765 hasAuthorship W4313143765A5078339613 @default.
- W4313143765 hasBestOaLocation W43131437652 @default.
- W4313143765 hasConcept C132525143 @default.
- W4313143765 hasConcept C17169500 @default.
- W4313143765 hasConcept C203776342 @default.
- W4313143765 hasConcept C22149727 @default.
- W4313143765 hasConcept C2986651925 @default.
- W4313143765 hasConcept C41008148 @default.
- W4313143765 hasConcept C80444323 @default.
- W4313143765 hasConcept C80899671 @default.
- W4313143765 hasConceptScore W4313143765C132525143 @default.
- W4313143765 hasConceptScore W4313143765C17169500 @default.
- W4313143765 hasConceptScore W4313143765C203776342 @default.
- W4313143765 hasConceptScore W4313143765C22149727 @default.
- W4313143765 hasConceptScore W4313143765C2986651925 @default.
- W4313143765 hasConceptScore W4313143765C41008148 @default.
- W4313143765 hasConceptScore W4313143765C80444323 @default.
- W4313143765 hasConceptScore W4313143765C80899671 @default.
- W4313143765 hasLocation W43131437651 @default.
- W4313143765 hasLocation W43131437652 @default.
- W4313143765 hasOpenAccess W4313143765 @default.
- W4313143765 hasPrimaryLocation W43131437651 @default.
- W4313143765 hasRelatedWork W1568173680 @default.
- W4313143765 hasRelatedWork W2244358235 @default.
- W4313143765 hasRelatedWork W2555576355 @default.
- W4313143765 hasRelatedWork W2913687312 @default.
- W4313143765 hasRelatedWork W2977390748 @default.
- W4313143765 hasRelatedWork W3148301426 @default.
- W4313143765 hasRelatedWork W4236163602 @default.
- W4313143765 hasRelatedWork W4292947375 @default.
- W4313143765 hasRelatedWork W4313143765 @default.
- W4313143765 hasRelatedWork W2182281430 @default.
- W4313143765 isParatext "false" @default.
- W4313143765 isRetracted "false" @default.
- W4313143765 workType "book-chapter" @default.