3441 search results - page 271 / 689 » Intelligent Computation of Presentation Documents |
219
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. When faced with the task of building accurate classifiers, active learning is often a beneficial tool for minimizing the requisite costs of human annotation. Traditional ...
181
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
215
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
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....
190
click to vote
SIGIR
2006
ACM
16 years 1 months ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
215
click to vote
SIGIR
2005
ACM
16 years 26 days ago
2005
ACM
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...