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

Zhengyan He

dblp:127/0165 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author

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 · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › entity linking › entity disambiguation
collective entity disambiguation
0.212013
Efficient Collective Entity Linking with Stacking · EMNLP 2013
Natural language and speech › Information extraction and text analysis
entity linking
0.212013
Efficient Collective Entity Linking with Stacking · EMNLP 2013

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

stacking · 0.2learning to rank · 0.2global coherence features · 0.2
YearPublicationVenuePosition
2013 Efficient Collective Entity Linking with Stacking
abstract
Entity disambiguation works by linking ambiguous mentions in text to their corresponding real-world entities in knowledge base.Recent collective disambiguation methods enforce coherence among contextual decisions at the cost of non-trivial inference processes.We propose a fast collective disambiguation approach based on stacking.First, we train a local predictor g 0 with learning to rank as base learner, to generate initial ranking list of candidates.Second, top k candidates of related instances are searched for constructing expressive global coherence features.A global predictor g 1 is trained in the augmented feature space and stacking is employed to tackle the train/test mismatch problem.The proposed method is fast and easy to implement.Experiments show its effectiveness over various algorithms on several public datasets.By learning a rich semantic relatedness measure between entity categories and context document, performance is further improved.
Zhengyan He, Shujie Liu 0001, Yang Song 0021, Mu Li 0001, Ming Zhou 0001, Houfeng Wang
EMNLP1
2012 A Comparison and Improvement of Online Learning Algorithms for Sequence Labeling
Zhengyan He, Houfeng Wang
COLING1