BoostingAlgorithm

method ID: boostingalgorithm

Related Papers

Using Decision Trees to Construct a Practical Parser

Authors: nan

Publication: TIPSTER (1998)

DOI: nan

This paper describes novel and practical Japanese parsers that uses decision trees. First, we con- struct a single decision tree to estimate modifica- tion probabilities; how one phrase tends to …...

35099

Using Decision Trees to Construct a Practical Parser

Authors: nan

Publication: TIPSTER (1998)

DOI: nan

This l)al)er describes novel and practical .lal)anesc parsers that uses decision trees, l"irst, we COl> struct a single, decision tree to estimate modifica-- lion probabilities; how one phrase tends t.o …...

6825

Ranking Algorithms for Named Entity Extraction: Boosting and the VotedPerceptron

Authors: nan

Publication: TIPSTER (2002)

DOI: nan

This paper describes algorithms which rerank the top N hypotheses from a maximum-entropy tagger, the applica- tion being the recovery of named-entity boundaries in a corpus of web data. The …...

35003

A Comparative Study on Language Model Adaptation Techniques Using New Evaluation Metrics

Authors: nan

Publication: TIPSTER (2005)

DOI: nan

This paper presents comparative experimen- tal results on four techniques of language model adaptation, including a maximum a posteriori (MAP) method and three dis- criminative training methods, the boosting algorithm, …...

12741

Approximation Lasso Methods for Language Modeling

Authors: nan

Publication: TIPSTER (2006)

DOI: nan

Lasso is a regularization method for pa- rameter estimation in linear models. It op- timizes the model parameters with respect to a loss function subject to model com- plexities. This …...

6741

Fast Boosting-based Part-of-Speech Tagging and Text Chunking with Efficient Rule Representation for Sequential Labeling

Authors: nan

Publication: TIPSTER (2009)

DOI: nan

This paper proposes two techniques for fast sequential labeling such as part-of-speech (POS) tagging and text chunking. The first technique is a boosting-based al- gorithm that learns rules represented by …...

29537

A Boosted Semi-Markov Perceptron

Authors: nan

Publication: TIPSTER (2013)

DOI: nan

This paper proposes a boosting algorithm that uses a semi-Markov perceptron. The training algorithm repeats the training of a semi-Markov model and the update of the weights of training samples. …...

42210

A Boosting-based Algorithm for Classification of Semi-Structured Text using the Frequency of Substructures

Authors: nan

Publication: TIPSTER (2013)

DOI: nan

Research in text classification currently fo- cuses on challenging tasks such as sen- timent classification, modality identifica- tion, and so on. In these tasks, approaches that use a structural representation, …...

28993

Boosting Cross-Language Retrieval by Learning Bilingual Phrase Associations from Relevance Rankings

Authors: nan

Publication: TIPSTER (2013)

DOI: nan

We present an approach to learning bilin- gual n-gram correspondences from relevance rankings of English documents for Japanese queries. We show that directly optimizing cross-lingual rankings rivals and complements machine …...

34555

Identifying Phrasal Verbs Using Many Bilingual Corpora

Authors: nan

Publication: TIPSTER (2013)

DOI: nan

We address the problem of identifying mul- tiword expressions in a language, focus- ing on English phrasal verbs. Our poly- glot ranking approach integrates frequency statistics from translated corpora in …...

34912