default search action
Yan Xu 0013
Person information
- affiliation: Peking University, Software Institute, China
Other persons with the same name
- Yan Xu (aka: Xu Yan) — disambiguation page
- Yan Xu 0001
— Beihang University, Beijing Advanced Innovation Center for Biomedical Engineering, Beijing, China (and 1 more)
- Yan Xu 0002
- Yan Xu 0003
- Yan Xu 0004
- Yan Xu 0005
- Yan Xu 0006
- Yan Xu 0007
- Yan Xu 0008
- Yan Xu 0009
- Yan Xu 0010 — University of Surrey, Guildford, UK
- Yan Xu 0011 — Intel Labs, Santa Clara, CA, USA (and 2 more)
- Yan Xu 0012
- Yan Xu 0014
- Yan Xu 0015
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c8]Yunchuan Chen, Lili Mou, Yan Xu, Ge Li, Zhi Jin:
Compressing Neural Language Models by Sparse Word Representations. ACL (1) 2016 - [c7]Lili Mou, Rui Men, Ge Li, Yan Xu, Lu Zhang, Rui Yan, Zhi Jin:
Natural Language Inference by Tree-Based Convolution and Heuristic Matching. ACL (2) 2016 - [c6]Lili Mou, Ran Jia, Yan Xu, Ge Li, Lu Zhang, Zhi Jin:
Distilling Word Embeddings: An Encoding Approach. CIKM 2016: 1977-1980 - [c5]Yan Xu, Ran Jia, Lili Mou, Ge Li, Yunchuan Chen, Yangyang Lu, Zhi Jin:
Improved relation classification by deep recurrent neural networks with data augmentation. COLING 2016: 1461-1470 - [c4]Lili Mou, Zhao Meng, Rui Yan, Ge Li, Yan Xu, Lu Zhang, Zhi Jin:
How Transferable are Neural Networks in NLP Applications? EMNLP 2016: 479-489 - [i8]Yan Xu, Ran Jia, Lili Mou, Ge Li, Yunchuan Chen, Yangyang Lu, Zhi Jin:
Improved Relation Classification by Deep Recurrent Neural Networks with Data Augmentation. CoRR abs/1601.03651 (2016) - [i7]Lili Mou, Zhao Meng, Rui Yan, Ge Li, Yan Xu, Lu Zhang, Zhi Jin:
How Transferable are Neural Networks in NLP Applications? CoRR abs/1603.06111 (2016) - [i6]Yunchuan Chen, Lili Mou, Yan Xu, Ge Li, Zhi Jin:
Compressing Neural Language Models by Sparse Word Representations. CoRR abs/1610.03950 (2016) - 2015
- [c3]Yan Xu, Lili Mou, Ge Li, Yunchuan Chen, Hao Peng, Zhi Jin:
Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Paths. EMNLP 2015: 1785-1794 - [c2]Lili Mou, Hao Peng, Ge Li, Yan Xu, Lu Zhang, Zhi Jin:
Discriminative Neural Sentence Modeling by Tree-Based Convolution. EMNLP 2015: 2315-2325 - [i5]Lili Mou, Hao Peng, Ge Li, Yan Xu, Lu Zhang, Zhi Jin:
Tree-based Convolution: A New Neural Architecture for Sentence Modeling. CoRR abs/1504.01106 (2015) - [i4]Lili Mou, Ge Li, Yan Xu, Lu Zhang, Zhi Jin:
Distilling Word Embeddings: An Encoding Approach. CoRR abs/1506.04488 (2015) - [i3]Yan Xu, Lili Mou, Ge Li, Yunchuan Chen, Hao Peng, Zhi Jin:
Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Path. CoRR abs/1508.03720 (2015) - [i2]Lili Mou, Rui Men, Ge Li, Yan Xu, Lu Zhang, Rui Yan, Zhi Jin:
Recognizing Entailment and Contradiction by Tree-based Convolution. CoRR abs/1512.08422 (2015) - 2014
- [j1]Yan Xu, Ge Li, Lili Mou, Yangyang Lu:
Learning Non-Taxonomic Relations on Demand for Ontology Extension. Int. J. Softw. Eng. Knowl. Eng. 24(8): 1159-1176 (2014) - [i1]Lili Mou, Ge Li, Yuxuan Liu, Hao Peng, Zhi Jin, Yan Xu, Lu Zhang:
Building Program Vector Representations for Deep Learning. CoRR abs/1409.3358 (2014) - 2011
- [c1]Ge Li, Zhi Jin, Yan Xu, Yangyang Lu:
An Engineerable Ontology Based Approach for Requirements Elicitation in Process Centered Problem Domain. KSEM 2011: 208-220
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 19:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: