Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hobie H.-B. Lee

dblp:395/2442 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Information extraction and text analysis · 67% Kernel, tree and ensemble methods · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › syntactic parsing
dependency parsing
0.912025
Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing · AAAI 2025
Machine learning › Kernel, tree and ensemble methods › ensemble learning
ensemble selection
0.912025
Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing · AAAI 2025
Natural language and speech › Information extraction and text analysis › syntactic parsing › dependency parsing
unsupervised dependency parsing
0.912025
Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing · AAAI 2025

Methods — techniques the papers use, named apart from their topics

error diversity · 0.9ensemble aggregation · 0.9
YearPublicationVenuePosition
2025 Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing
abstract
We address unsupervised dependency parsing by building an ensemble of diverse existing models through post hoc aggregation of their output dependency parse structures. We observe that these ensembles often suffer from low robustness against weak ensemble components due to error accumulation. To tackle this problem, we propose an efficient ensemble-selection approach that considers error diversity and avoids error accumulation. Results demonstrate that our approach outperforms each individual model as well as previous ensemble techniques. Additionally, our experiments show that the proposed ensemble-selection method significantly enhances the performance and robustness of our ensemble, surpassing previously proposed strategies, which have not accounted for error diversity.
Behzad Shayegh, Hobie H.-B. Lee, Xiaodan Zhu 0001, Jackie Chi Kit Cheung, Lili Mou
AAAI2