Sciweavers

1859 search results - page 84 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
ICML
2008
IEEE
16 years 5 months ago
Multiple instance ranking
This paper introduces a novel machine learning model called multiple instance ranking (MIRank) that enables ranking to be performed in a multiple instance learning setting. The mo...
Charles Bergeron, Jed Zaretzki, Curt M. Breneman, ...
ACL
2010
15 years 2 months ago
Distributional Similarity vs. PU Learning for Entity Set Expansion
Distributional similarity is a classic technique for entity set expansion, where the system is given a set of seed entities of a particular class, and is asked to expand the set u...
Xiaoli Li, Lei Zhang, Bing Liu, See-Kiong Ng
ICPR
2008
IEEE
15 years 11 months ago
Transductive optimal component analysis
We propose a new transductive learning algorithm for learning optimal linear representations that utilizes unlabeled data. We pose the problem of learning linear representations a...
Yuhua Zhu, Yiming Wu, Xiuwen Liu, Washington Mio
COLCOM
2008
IEEE
15 years 11 months ago
Learning Models of the Negotiation Partner in Spatio-temporal Collaboration
Abstract. We describe an approach for learning the model of the opponent in spatio-temporal negotiation. We use the Children in the Rectangular Forest canonical problem as an examp...
Yi Luo, Ladislau Bölöni
219
Voted
NIPS
2008
15 years 6 months ago
Optimization on a Budget: A Reinforcement Learning Approach
Many popular optimization algorithms, like the Levenberg-Marquardt algorithm (LMA), use heuristic-based "controllers" that modulate the behavior of the optimizer during ...
Paul Ruvolo, Ian R. Fasel, Javier R. Movellan