Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Ranking Complex Relationships on the Semantic Web
IEEE Internet Computing
Variable-strength conditional preferences for ranking objects in ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Statistical Learning for Inductive Query Answering on OWL Ontologies
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Semantic matchmaking as non-monotonic reasoning: a description logic approach
Journal of Artificial Intelligence Research
Learning to rank individuals in description logics using kernel perceptrons
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Hi-index | 0.00 |
In the context of knowledge bases expressed in Description Logics, a method for learning functions that can predict the ranking of resources encoding some preference criteria implicitly encoded through examples of rated individuals. The method relies on a kernelized version of the PERCEPTRON RANKING algorithm which is suitable for batch but also online problem settings.