In this paper we introduce DWRank, a two-staged bi-directional graph walk ranking algorithm for concepts in ontologies. DWRank characterises two features of a ...
Oct 17, 2014 · DWRank characterises two features of a concept in an ontology to determine its rank in a corpus, the centrality of the concept to the ontology ...
In this paper we introduce DWRank, a two-staged bi-directional graph walk ranking algorithm for concepts in ontologies.
DWRank characterises two features of a concept in an ontology to determine its rank in a corpus, the centrality of the concept to the ontology within which it ...
DWRank is introduced, a two-staged bi-directional graph walk ranking algorithm for concepts in ontologies that significantly outperforms the best ranking ...
In this paper we introduce DWRank, a two-staged bi-directional graph walk ranking algorithm for concepts in ontologies. DWRank characterises two features of a ...
DWRank characterises two features of a concept in an ontology to determine its rank in a corpus, the centrality of the concept to the ontology within which it ...
A free platform for explaining your research in plain language, and managing how you communicate around it – so you can understand how best to increase its ...
DWRank: Learning concept ranking for ontology search · List of references · Publications that cite this publication.
DWRank characterises two features of a concept in an ontology to determine its rank in a corpus, the centrality of the concept to the ontology within which it ...