Sciweavers

2100 search results - page 79 / 420
» Learning to rank on graphs
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Augmenting naive Bayes for ranking
Naive Bayes is an effective and efficient learning algorithm in classification. In many applications, however, an accurate ranking of instances based on the class probability is m...
Harry Zhang, Liangxiao Jiang, Jiang Su
UAI
2008
15 years 7 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
SAC
2008
ACM
15 years 5 months ago
Pattern ranking for semi-automatic ontology construction
When developing semantic applications, the construction of ontologies is a crucial part. We are developing a semiautomatic ontology construction approach, OntoCase, relying on ont...
Eva Blomqvist
ESSMAC
2003
Springer
15 years 11 months ago
Analysis of Some Methods for Reduced Rank Gaussian Process Regression
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
Joaquin Quiñonero Candela, Carl Edward Rasm...