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

Shuang Ni

dblp:271/5554 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
8since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
1 paper
Representation and self-supervised learning · 87% Kernel, tree and ensemble methods · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%
Computer networks
1 paper
Network optimization and economics · 44% Cellular and mobile networks · 44% Vehicular, aerial and satellite networks · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction
0.912025
Random Forest Autoencoders for Guided Representation Learning · NeurIPS 2025
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning
0.912025
Random Forest Autoencoders for Guided Representation Learning · NeurIPS 2025
Network optimization and economics
resource allocation
0.512021
Joint optimization of user association and resource allocation in cache-enabled terrestrial-satellite integrating network · Sci. China Inf. Sci. 2021
Cellular and mobile networks
user association
0.512021
Joint optimization of user association and resource allocation in cache-enabled terrestrial-satellite integrating network · Sci. China Inf. Sci. 2021
High-performance computing
performance optimization at scale
0.512021
Accelerating all-electron ab initio simulation of raman spectra for biological systems · SC 2021
High-performance computing
quantum mechanical simulation
0.512021
Accelerating all-electron ab initio simulation of raman spectra for biological systems · SC 2021
High-performance computing
scientific computing systems
0.512021
Accelerating all-electron ab initio simulation of raman spectra for biological systems · SC 2021
Machine learning › Kernel, tree and ensemble methods › ensemble learning › tree ensembles
random forest
0.312025
Random Forest Autoencoders for Guided Representation Learning · NeurIPS 2025
Computational science and engineering › computational chemistry
molecular simulation
0.112021
Accelerating all-electron ab initio simulation of raman spectra for biological systems · SC 2021
Vehicular, aerial and satellite networks
satellite networks
0.112021
Joint optimization of user association and resource allocation in cache-enabled terrestrial-satellite integrating network · Sci. China Inf. Sci. 2021

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

many-core architecture optimization · 1.0random forest · 0.9kernel extension · 0.9autoencoder · 0.9RF-PHATE · 0.9
YearPublicationVenuePosition
2025 Random Forest Autoencoders for Guided Representation Learning
abstract
Extensive research has produced robust methods for unsupervised data visualization. Yet supervised visualization—where expert labels guide representations—remains underexplored, as most supervised approaches prioritize classification over visualization. Recently, RF-PHATE, a diffusion-based manifold learning method leveraging random forests and information geometry, marked significant progress in supervised visualization. However, its lack of an explicit mapping function limits scalability and its application to unseen data, posing challenges for large datasets and label-scarce scenarios. To overcome these limitations, we introduce Random Forest Autoencoders (RF-AE), a neural network-based framework for out-of-sample kernel extension that combines the flexibility of autoencoders with the supervised learning strengths of random forests and the geometry captured by RF-PHATE. RF-AE enables efficient out-of-sample supervised visualization and outperforms existing methods, including RF-PHATE's standard kernel extension, in both accuracy and interpretability. Additionally, RF-AE is modality-agnostic, demonstrates strong robustness to hyperparameters, supports both classification and regression, and natively accommodates missing feature values. Our code is available at https://github.com/JakeSRhodesLab/RF-AE.
Adrien Aumon, Shuang Ni, Myriam Lizotte, Guy Wolf, Kevin J. Moon, Jake S. Rhodes
NeurIPS2
2025 Intent-Driven Multi-level Augmentation with Contrastive Learning for Sequential Recommendation
Shuang Ni, Wei Zhou 0028, Fengji Luo, Yihao Zhang 0002, Jun Zeng 0003, Junhao Wen 0001
Knowl. Based Syst.1
2023 Enhancing sequential recommendation with contrastive Generative Adversarial Network
Shuang Ni, Wei Zhou 0028, Junhao Wen 0001, Linfeng Hu, Shutong Qiao
Inf. Process. Manag.1
2023 Adversarial learning based residual variational graph normalized autoencoder for network representation
Zhengran Shen, Xiaoxin Guo, Hangyuan Cheng, Shuang Ni, Hongliang Dong
Inf. Sci.5
2023 Enhanced contrastive learning with multi-aspect information for recommender systems
Linfeng Hu, Wei Zhou 0028, Fengji Luo, Shuang Ni, Junhao Wen 0001
Knowl. Based Syst.4
2023 Multi-perspective enhanced representation for effective session-based recommendation
Shutong Qiao, Wei Zhou 0028, Junhao Wen 0001, Linfeng Hu, Shuang Ni
Knowl. Based Syst.6
2021 Accelerating all-electron ab initio simulation of raman spectra for biological systems
abstract
Raman spectroscopy provides chemical and compositional information that can serve as a structural fingerprint for various materials. Therefore, simulations of Raman spectra, including both quantum perturbation analyses and ground-state calculations are of significant interest. However, highly accurate full quantum mechanical (QM) simulations of Raman spectra have previously been confined to small systems. For large systems such as biological materials, the computational cost of full QM simulations is extremely high, and their extension to such systems remains challenging. In the work described here, by employing robust new algorithms and advances in implementation for the many-core architectures, we are able to perform fast, accurate, and massively parallel full ab initio simulations of the Raman spectra of biological systems with excellent strong and weak scaling, thereby providing a starting point for applying QM approaches to structural studies of such systems.
Honghui Shang, Yunquan Zhang, Ying Liu 0055, Mingchuan Wu, Yangjun Wu, Di Wei, Huimin Cui, Xin Liu 0081, Fei Wang 0096, Yuxi Ye, Yingxiang Gao, Shuang Ni, Xin Chen 0023, Dexun Chen
SC14
2021 Joint optimization of user association and resource allocation in cache-enabled terrestrial-satellite integrating network
Shuang Ni, Junyu Liu, Min Sheng, Jiandong Li 0001, Xiaona Zhao
Sci. China Inf. Sci.1
2020 Towards Effective Tradeoff Between Content Caching and Retrieving in Dense Small Cell Network
abstract
Although the joint design of content caching and retrieving has the potential of relieving the backhaul pressure, either caching or retrieving would significantly influence the distribution of interference in caching-enabled small cell network (CSCN). The complicated interference, if not properly managed, would inversely deteriorate the network performance. In this work, we further investigate the tradeoff of content caching and retrieving in term of network spatial throughput (ST). Specifically, the analysis manifests that, compared to the condition of caching less content, ST is more likely to be reduced with increasing amount of retrieving content when more content is pre-cached by small cell base station (SBS). To maximize the ST, we formulate an optimization problem, which is solved by the joint design of content caching and retrieving. Moreover, a critical SBS density is derived from the optimization result, beyond which less content should be retrieving if more content is pre-cached by SBS. Therefore, the tradeoff between content caching and retrieving could be captured. More importantly, it is shown that a backhaul-free region exists, where the maximization of ST under joint optimization is identical to that under caching optimization. This indicates that the backhaul pressure can be significantly relieved through caching optimization in dense CSCN.
Xiaona Zhao, Junyu Liu, Min Sheng, Jiandong Li 0001, Shuang Ni
ICC5