Sciweavers

2300 search results - page 196 / 460
» Learning Dialogue POMDP Models from Data
Sort
View
136
Voted
COLT
1999
Springer
15 years 9 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
ACL
2009
15 years 2 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 10 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
TIP
2010
145views more  TIP 2010»
14 years 11 months ago
Joint Manifolds for Data Fusion
The emergence of low-cost sensing architectures for diverse modalities has made it possible to deploy sensor networks that capture a single event from a large number of vantage po...
Mark A. Davenport, Chinmay Hegde, Marco F. Duarte,...
KDD
2005
ACM
147views Data Mining» more  KDD 2005»
15 years 10 months ago
Combining proactive and reactive predictions for data streams
Mining data streams is important in both science and commerce. Two major challenges are (1) the data may grow without limit so that it is difficult to retain a long history; and (...
Ying Yang, Xindong Wu, Xingquan Zhu