Domain-aware biased random walks improve k-NN accuracy on AIFB by routing walks through affiliation edges, but the gain is tied to the target relation being present in the graph and is not replicated on BGS.
Kernel methods for mining instance data in ontologies
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Graph Node Embeddings using Domain-Aware Biased Random Walks
Domain-aware biased random walks improve k-NN accuracy on AIFB by routing walks through affiliation edges, but the gain is tied to the target relation being present in the graph and is not replicated on BGS.