Sciweavers

2100 search results - page 165 / 420
» Learning to rank on graphs
Sort
View
ECML
1998
Springer
15 years 10 months ago
First-Order Learning for Web Mining
We present compelling evidence that the World Wide Web is a domain in which applications can benefit from using first-order learning methods, since the graph structure inherent in ...
Mark Craven, Seán Slattery, Kamal Nigam
ICDM
2005
IEEE
134views Data Mining» more  ICDM 2005»
16 years 3 days ago
A Preference Model for Structured Supervised Learning Tasks
The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, su...
Fabio Aiolli
AUSDM
2007
Springer
100views Data Mining» more  AUSDM 2007»
16 years 20 days ago
Determining Termhood for Learning Domain Ontologies using Domain Prevalence and Tendency
In the course of reviewing existing automatic term recognition techniques for applications in ontology learning, we came across four issues which can be improved upon. We proposed...
Wilson Wong, Wei Liu, Mohammed Bennamoun
ICML
2003
IEEE
16 years 7 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
HT
2007
ACM
15 years 10 months ago
Toward interactive learning by concept ordering
In this paper we present a visual education tool for efficient and effective learning. The toolkit is based on a simple premise: simple concepts should be learned before advanced ...
Shantanu Godbole, Sachindra Joshi, Sameep Mehta, G...