Sciweavers

194 search results - page 6 / 39
» Sequence Labeling with Reinforcement Learning and Ranking Al...
Sort
View
ICML
2001
IEEE
15 years 10 months ago
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hid...
John D. Lafferty, Andrew McCallum, Fernando C. N. ...
91
Voted
ECML
2003
Springer
15 years 2 months ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
IJCAI
2003
14 years 10 months ago
A Learning Algorithm for Localizing People Based on Wireless Signal Strength that Uses Labeled and Unlabeled Data
This paper summarizes a probabilistic approach for localizing people through the signal strengths of a wireless IEEE 802.11b network. Our approach uses data labeled by ground trut...
Sebastian Thrun, Geoffrey J. Gordon, Frank Pfennin...
ICMCS
2006
IEEE
125views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Label Disambiguation and Sequence Modeling for Identifying Human Activities from Wearable Physiological Sensors
Wearable physiological sensors can provide a faithful record of a patient’s physiological states without constant attention of caregivers. A computer program that can infer huma...
Wei-Hao Lin, Alexander G. Hauptmann
CIKM
2009
Springer
15 years 4 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...