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

Eric H. Huang

dblp:63/10489 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 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
3 papers
Representation and self-supervised learning · 56% Information extraction and text analysis · 41% Learning paradigms · 4%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › word representation
word embedding
0.112012
Improving Word Representations via Global Context and Multiple Word Prototypes · ACL (1) 2012
Machine learning › Representation and self-supervised learning
word representation
0.112012
Improving Word Representations via Global Context and Multiple Word Prototypes · ACL (1) 2012
Natural language and speech › Information extraction and text analysis › text similarity
paraphrase identification
0.112011
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection · NIPS 2011
Machine learning › Representation and self-supervised learning › text embedding
phrase embedding
0.112011
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection · NIPS 2011
Machine learning › Representation and self-supervised learning › hierarchical representation
recursive autoencoder
0.112011
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection · NIPS 2011
Natural language and speech › Information extraction and text analysis › text similarity › semantic similarity
sentence similarity
0.112011
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection · NIPS 2011
Natural language and speech › Information extraction and text analysis
sentiment analysis
0.112011
Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions · EMNLP 2011
Natural language and speech › Information extraction and text analysis
word sense disambiguation
0.012012
Improving Word Representations via Global Context and Multiple Word Prototypes · ACL (1) 2012
Machine learning › Learning paradigms
semi-supervised learning
0.012011
Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions · EMNLP 2011
Machine learning › Representation and self-supervised learning › representation learning
unsupervised representation learning
0.012011
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection · NIPS 2011

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

recursive autoencoder · 0.2multiple word prototypes · 0.1global context · 0.1dynamic pooling · 0.1
YearPublicationVenuePosition
2012 Improving Word Representations via Global Context and Multiple Word Prototypes
Eric H. Huang, Richard Socher, Christopher D. Manning, Andrew Y. Ng
ACL (1)1
2011 Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions
Richard Socher, Jeffrey Pennington, Eric H. Huang, Andrew Y. Ng, Christopher D. Manning
EMNLP3
2011 Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection
abstract
Paraphrase detection is the task of examining two sentences and determining whether they have the same meaning. In order to obtain high accuracy on this task, thorough syntactic and semantic analysis of the two statements is needed. We introduce a method for paraphrase detection based on recursive autoencoders (RAE). Our unsupervised RAEs are based on a novel unfolding objective and learn feature vectors for phrases in syntactic trees. These features are used to measure the word- and phrase-wise similarity between two sentences. Since sentences may be of arbitrary length, the resulting matrix of similarity measures is of variable size. We introduce a novel dynamic pooling layer which computes a fixed-sized representation from the variable-sized matrices. The pooled representation is then used as input to a classifier. Our method outperforms other state-of-the-art approaches on the challenging MSRP paraphrase corpus.
Richard Socher, Eric H. Huang, Jeffrey Pennington, Andrew Y. Ng, Christopher D. Manning
NIPS2