Yu Gong

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yao Wan 0001

> Home > Persons > Yu Gong

Publications

2019
[c40]
- view
  authority control:
- export record
  dblp key:
  - conf/naacl/ZhangZLWPGY19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/naacl/ZhangZLWPGY19
Jianguo Zhang, Pengcheng Zou, Zhao Li, Yao Wan, Xiuming Pan, Yu Gong, Philip S. Yu:
Multi-Modal Generative Adversarial Network for Short Product Title Generation in Mobile E-Commerce. NAACL-HLT (2) 2019: 64-72
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1904-01735
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1904-01735
Jianguo Zhang, Pengcheng Zou, Zhao Li, Yao Wan, Xiuming Pan, Yu Gong, Philip S. Yu:
Multi-Modal Generative Adversarial Network for Short Product Title Generation in Mobile E-Commerce. CoRR abs/1904.01735 (2019)
2018
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1811-04498
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1811-04498
Jianguo Zhang, Pengcheng Zou, Zhao Li, Yao Wan, Ye Liu, Xiuming Pan, Yu Gong, Philip S. Yu:
Product Title Refinement via Multi-Modal Generative Adversarial Learning. CoRR abs/1811.04498 (2018)

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.