VLDB 2026 Research / reviewers in the wild / expert
Nan Liu 0006
dblp:86/4643-6
· DBLP profile ↗
12ranked-venue papers
5as first author
5since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 4 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | TF-GCNNovo: A Peptide Sequence Prediction Model Integrating Transformer and Graph Convolutional Network
Nan Liu 0006, Xiaotian Jia, Binhai Zhu |
ISBRA (1) | 1 |
| 2024 | On the Existence of Parameterized Algorithms for the Shortest Common Supersequence and Related Problems
Muzhou Chen, Haitao Jiang 0005, Nan Liu 0006, Lusheng Wang 0001, Binhai Zhu |
AAIM (2) | 3 |
| 2024 | New approximation algorithms for RNA secondary structures prediction problems by local search
Aizhong Zhou, Haodi Feng, Jiong Guo, Haitao Jiang 0005, Nan Liu 0006, Binhai Zhu, Daming Zhu |
Theor. Comput. Sci. | 5 |
| 2023 | Position-aware graph neural network for session-based recommendation
Sheng Sang, Weihua Yuan, Zhijun Zhang 0002, Nan Liu 0006 |
Knowl. Based Syst. | 6 |
| 2022 | High-order attentive graph neural network for session-based recommendation
Sheng Sang, Nan Liu 0006, Zhijun Zhang 0002, Qianqian Qin, Weihua Yuan |
Appl. Intell. | 2 |
| 2020 | Personalized Course Recommendation Based on Eye-Tracking Technology and Deep LearningabstractWith the rapid development of online courses, the requirements of personalized course recommendation have been increasing. The traditional collaborative filtering algorithm confronts with the challenge of cold start, which is difficult to settle on online course recommendation effectively. In this paper, we propose a novel click through rate (CTR) model for personalized online course recommendation, with discriminative user features, item features and cross features. The feature representation ability of the CTR model is improved and the serious challenge of cold start is alleviated. Furthermore, transfer learning is introduced to deal with the problem of insufficient data in models training. More specially, eye tracking technology is applied to capture the users' cognitive styles, which are visualized with the heat map and fixation point trajectory. Finally, the recommendation interface sent to the learners, according to the user's cognitive style. The experiments show that the novel CTR model improves the performance of the personalized online course recommendation. Xiaomei Yu, Nan Liu 0006, Xiaoning Yuan |
DSAA | 3 |
| 2020 | Attention-based context-aware sequential recommendation model
Weihua Yuan, Hong Wang 0015, Xiaomei Yu, Nan Liu 0006 |
Inf. Sci. | 4 |
| 2017 | Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction
Aizhong Zhou, Haitao Jiang 0005, Jiong Guo, Haodi Feng, Nan Liu 0006, Binhai Zhu |
COCOON | 5 |
| 2016 | A Polynomial Time Solution for Permutation Scaffold Filling
Nan Liu 0006, Binhai Zhu |
COCOA | 1 |
| 2016 | A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling
Nan Liu 0006, Daming Zhu, Haitao Jiang 0005, Binhai Zhu |
Algorithmica | 1 |
| 2013 | An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
Nan Liu 0006, Haitao Jiang 0005, Daming Zhu, Binhai Zhu |
COCOON | 1 |
| 2013 | An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common AdjacenciesabstractScaffold filling is a new combinatorial optimization problem in genome sequencing. The one-sided scaffold filling problem can be described as given an incomplete genome I and a complete (reference) genome G, fill the missing genes into I such that the number of common (string) adjacencies between the resulting genome I' and G is maximized. This problem is NP-complete for genome with duplicated genes and the best known approximation factor is 1.33, which uses a greedy strategy. In this paper, we prove a better lower bound of the optimal solution, and devise a new algorithm by exploiting the maximum matching method and a local improvement technique, which improves the approximation factor to 1.25. For genome with gene repetitions, this is the only known NP-complete problem which admits an approximation with a small constant factor (less than 1.5). Nan Liu 0006, Haitao Jiang 0005, Daming Zhu, Binhai Zhu |
IEEE ACM Trans. Comput. Biol. Bioinform. | 1 |