2010
DOI: 10.1007/978-3-642-13769-3_70
|View full text |Cite
|
Sign up to set email alerts
|

Boosting Algorithm with Sequence-Loss Cost Function for Structured Prediction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…Additionally, the proposed feature extraction method will also be examined against the usage of global objective functions for classification. Yet another direction of future studies will be development of new ensemble algorithms, which would have network measures already incorporated, especially based on boosting concept [8].…”
Section: Discussionmentioning
confidence: 99%
“…Additionally, the proposed feature extraction method will also be examined against the usage of global objective functions for classification. Yet another direction of future studies will be development of new ensemble algorithms, which would have network measures already incorporated, especially based on boosting concept [8].…”
Section: Discussionmentioning
confidence: 99%