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

Anna Chen

dblp:145/8823 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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
2 papers
Information extraction and text analysis · 50% Planning, search and constraint satisfaction · 25% Reinforcement learning · 25%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
decision making under uncertainty
0.212016
Commitment Semantics for Sequential Decision Making under Reward Uncertainty · IJCAI 2016
Natural language and speech › Information extraction and text analysis › entity linking
entity disambiguation
0.212016
AOL's Named Entity Resolver: Solving Disambiguation via Document Strongly Connected Components and Ad-Hoc Edges Construction · SIGIR 2016
Natural language and speech › Information extraction and text analysis
entity linking
0.212016
AOL's Named Entity Resolver: Solving Disambiguation via Document Strongly Connected Components and Ad-Hoc Edges Construction · SIGIR 2016
Machine learning › Reinforcement learning
reward uncertainty
0.212016
Commitment Semantics for Sequential Decision Making under Reward Uncertainty · IJCAI 2016
Data integration and cleaning
entity resolution
0.112016
AOL's Named Entity Resolver: Solving Disambiguation via Document Strongly Connected Components and Ad-Hoc Edges Construction · SIGIR 2016

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

commitment semantics · 0.2
YearPublicationVenuePosition
2016 Commitment Semantics for Sequential Decision Making under Reward Uncertainty
Qi Zhang 0038, Edmund H. Durfee, Satinder Singh 0001, Anna Chen, Stefan J. Witwicki
IJCAI4
2016 AOL's Named Entity Resolver: Solving Disambiguation via Document Strongly Connected Components and Ad-Hoc Edges Construction
abstract
Named Entity Disambiguation is the task of disambiguating named entity mentions in unstructured text and linking them to their corresponding entries in a large knowledge base such as Freebase. Practically, each text match in a given document should be mapped to the correct entity out of the corresponding entities in the knowledge base or none of them if no correct entity is found (Empty Entry). The case of an empty entry makes the problem at hand more complex, but by solving it, one can successfully cope with missing and erroneous data as well as unknown entities. In this work we present AOL's Named Entity Resolver which was designed to handle real life scenarios including empty entries. As part of the automated news analysis platform, it processes over 500K news articles a day, entities from each article are extracted and disambiguated. According to our experiments, AOL's resolver shows much better results in disambiguating entities mapped to Wikipedia or Freebase compared to industry leading products.
Roni Wiener, Yonatan Ben-Simhon, Anna Chen
SIGIR3