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

Yulan Yan

dblp:71/6026 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
2since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 4 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-author · 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
4 papers
Reinforcement learning · 41% Language models and text generation · 26% Trustworthy machine learning · 20%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.512021
Learning Groupwise Explanations for Black-Box Models · IJCAI 2021
Machine learning › Reinforcement learning
model-based reinforcement learning
0.512021
Reinforcing Pretrained Models for Generating Attractive Text Advertisements · KDD 2021
Machine learning › Reinforcement learning › policy optimization
policy gradient
0.512021
Reinforcing Pretrained Models for Generating Attractive Text Advertisements · KDD 2021
Natural language and speech › Language models and text generation › text generation › domain-specific text generation
text advertisement generation
0.512021
Reinforcing Pretrained Models for Generating Attractive Text Advertisements · KDD 2021
Natural language and speech › Language models and text generation
pre-trained language model
0.112021
Reinforcing Pretrained Models for Generating Attractive Text Advertisements · KDD 2021
Natural language and speech › Information extraction and text analysis › relation extraction
open relation extraction
0.112009
Unsupervised Relation Extraction by Mining Wikipedia Texts Using Information from the Web · ACL/IJCNLP 2009
Natural language and speech › Information extraction and text analysis
relation extraction
0.112009
Unsupervised Relation Extraction by Mining Wikipedia Texts Using Information from the Web · ACL/IJCNLP 2009
Web and social media mining › web mining
web text mining
0.012009
Unsupervised Relation Extraction by Mining Wikipedia Texts Using Information from the Web · ACL/IJCNLP 2009

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

pre-trained language model · 0.5masked-sequence policy gradient · 0.5local explanation · 0.5distant supervision · 0.2partial pattern matching · 0.1
YearPublicationVenuePosition
2021 Learning Groupwise Explanations for Black-Box Models
abstract
We study two user demands that are important during the exploitation of explanations in practice: 1) understanding the overall model behavior faithfully with limited cognitive load and 2) predicting the model behavior accurately on unseen instances. We illustrate that the two user demands correspond to two major sub-processes in the human cognitive process and propose a unified framework to fulfill them simultaneously. Given a local explanation method, our framework jointly 1) learns a limited number of groupwise explanations that interpret the model behavior on most instances with high fidelity and 2) specifies the region where each explanation applies. Experiments on six datasets demonstrate the effectiveness of our method.
Jingyue Gao, Xiting Wang, Yasha Wang, Yulan Yan, Xing Xie 0001
IJCAI4
2021 Reinforcing Pretrained Models for Generating Attractive Text Advertisements
abstract
We study how pretrained language models can be enhanced by using deep reinforcement learning to generate attractive text advertisements that reach the high quality standard of real-world advertiser mediums. To improve ad attractiveness without hampering user experience, we propose a model-based reinforcement learning framework for text ad generation, which constructs a model for the environment dynamics and avoids large sample complexity. Based on the framework, we develop Masked-Sequence Policy Gradient, a reinforcement learning algorithm that integrates efficiently with pretrained models and explores the action space effectively. Our method has been deployed to production in Microsoft Bing. Automatic offline experiments, human evaluation, and online experiments demonstrate the superior performance of our method.
Xiting Wang, Xinwei Gu, Zihua Zhao, Yulan Yan, Bhuvan Middha, Xing Xie 0001
KDD5
2013 Minimally Supervised Method for Multilingual Paraphrase Extraction from Definition Sentences on the Web
Yulan Yan, Chikara Hashimoto, Kentaro Torisawa, Takao Kawai, Jun'ichi Kazama, Stijn De Saeger
HLT-NAACL1
2011 Relation Acquisition using Word Classes and Partial Patterns
Stijn De Saeger, Kentaro Torisawa, Masaaki Tsuchida, Jun'ichi Kazama, Chikara Hashimoto, Ichiro Yamada, Jong-Hoon Oh, István Varga, Yulan Yan
EMNLP9
2010 Multi-View Clustering with Web and Linguistic Features for Relation Extraction
abstract
Binary semantic relation extraction is particularly useful for various NLP and Web applications. Currently Web-based methods and Linguistic-based methods are two types of leading methods for semantic relation extraction task. With a novel view on integrating linguistic analysis on local text with Web frequent information, we propose a multi-view co-clustering approach for semantic relation extraction. One is feature clustering by automatically learning clustering functions for Web features, linguistic features simultaneously based on a subset of entity pairs. The other is relation clustering, using the feature clustering functions to define learning function for relation extraction. Our experiments demonstrate the superiority of our clustering approach comparing with several state-of-the-art clustering methods.
Yulan Yan, Haibo Li 0002, Yutaka Matsuo, Zhenglu Yang, Mitsuru Ishizuka
APWeb1
2010 Multi-view Bootstrapping for Relation Extraction by Exploring Web Features and Linguistic Features
Yulan Yan, Haibo Li 0002, Yutaka Matsuo, Mitsuru Ishizuka
CICLing1
2009 Unsupervised Relation Extraction by Mining Wikipedia Texts Using Information from the Web
Yulan Yan, Naoaki Okazaki, Yutaka Matsuo, Zhenglu Yang, Mitsuru Ishizuka
ACL/IJCNLP1
2008 Relation Classification for Semantic Structure Annotation of Text
abstract
Confronting the challenges of annotating naturally occurring text into a semantically structured form to facilitate automatic information extraction, current semantic role labeling (SRL) systems have been specifically examining a semantic predicate-argument structure. Based on the concept description language for natural language (CDL.nl) which is intended to describe the concept structure of text using a set of pre-defined semantic relations, we develop a parser to add a new layer of semantic annotation of natural language sentences as an extension of SRL. With the assumption that all relation instances are detected, we present a relation classification approach facing the challenges of CDL.nl relation extraction. Preliminary evaluation on a manual dataset, using support vector machine, shows that CDL.nl relations can be classified with good performance.
Yulan Yan, Yutaka Matsuo, Mitsuru Ishizuka, Toshio Yokoi
Web Intelligence1