Sciweavers

750 search results - page 133 / 150
» Learning SVMs from Sloppily Labeled Data
Sort
View
RSS
2007
198views Robotics» more  RSS 2007»
14 years 3 days ago
CRF-Matching: Conditional Random Fields for Feature-Based Scan Matching
— Matching laser range scans observed at different points in time is a crucial component of many robotics tasks, including mobile robot localization and mapping. While existing t...
Fabio T. Ramos, Dieter Fox, Hugh F. Durrant-Whyte
IR
2010
13 years 9 months ago
Adapting boosting for information retrieval measures
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
Qiang Wu, Christopher J. C. Burges, Krysta Marie S...
EMNLP
2011
12 years 10 months ago
Universal Morphological Analysis using Structured Nearest Neighbor Prediction
In this paper, we consider the problem of unsupervised morphological analysis from a new angle. Past work has endeavored to design unsupervised learning methods which explicitly o...
Young-Bum Kim, João Graça, Benjamin ...
UAI
2004
14 years 2 days ago
Active Model Selection
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
Omid Madani, Daniel J. Lizotte, Russell Greiner
VLDB
2003
ACM
165views Database» more  VLDB 2003»
14 years 11 months ago
Learning to match ontologies on the Semantic Web
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
AnHai Doan, Jayant Madhavan, Robin Dhamankar, Pedr...