Sciweavers

7928 search results - page 1322 / 1586
» Human-Like Learning Methods for a
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
148
Voted
ICML
2006
IEEE
16 years 7 months ago
Categorization in multiple category systems
We explore the situation in which documents have to be categorized into more than one category system, a situation we refer to as multiple-view categorization. More particularly, ...
Éric Gaussier, Cyril Goutte, Françoi...
ICML
2006
IEEE
16 years 7 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
WWW
2009
ACM
16 years 7 months ago
Extracting article text from the web with maximum subsequence segmentation
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
Jeff Pasternack, Dan Roth
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 7 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
« Prev « First page 1322 / 1586 Last » Next »