Rui Liu 0007

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 Quanye Jia

> Home > Persons > Rui Liu 0007

Publications

2021
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/cncl/JiaLL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cncl/JiaLL21
Quanye Jia, Rui Liu, Jianying Lin:
Using Query Expansion in Manifold Ranking for Query-Oriented Multi-document Summarization. CCL 2021: 97-111
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2108-01441
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2108-01441
Quanye Jia, Rui Liu, Jianying Lin:
Using Query Expansion in Manifold Ranking for Query-Oriented Multi-Document Summarization. CoRR abs/2108.01441 (2021)
2019
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1907-03224
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1907-03224
Jianying Lin, Rui Liu, Quanye Jia:
Joint Lifelong Topic Model and Manifold Ranking for Document Summarization. CoRR abs/1907.03224 (2019)
2017
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/cse/LinLJZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cse/LinLJZ17
Jianying Lin, Rui Liu, Quanye Jia, Yahui Zhao:
From Top to Down Hierarchical Classification Process with the Candidates' Strategy. CSE/EUC (1) 2017: 15-22

a service of

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.