Sciweavers

4591 search results - page 123 / 919
» Learning from Dyadic Data
Sort
View
KDD
2010
ACM
257views Data Mining» more  KDD 2010»
15 years 7 months ago
Multi-task learning for boosting with application to web search ranking
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
Olivier Chapelle, Pannagadatta K. Shivaswamy, Srin...
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 4 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
IJCAI
2001
15 years 5 months ago
Using Case-Base Data to Learn Adaptation Knowledge for Design
One advantage of Case-Based Reasoning (CBR) is the relative ease of constructing and maintaining CBR systems, especially as a number of commercial CBR tools are available. However...
Jacek Jarmulak, Susan Craw, Ray Rowe
ISWC
2006
IEEE
15 years 9 months ago
Towards Less Supervision in Activity Recognition from Wearable Sensors
Activity Recognition has gained a lot of interest in recent years due to its potential and usefulness for context-aware wearable computing. However, most approaches for activity r...
Tâm Huynh, Bernt Schiele
ICASSP
2011
IEEE
14 years 7 months ago
A non-negative approach to semi-supervised separation of speech from noise with the use of temporal dynamics
We present a semi-supervised source separation methodology to denoise speech by modeling speech as one source and noise as the other source. We model speech using the recently pro...
Gautham J. Mysore, Paris Smaragdis