Na Zhou

dblp:66/7773 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
6since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 6 · 2 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
0.912025
TRACE: Contrastive learning for multi-trial time series data in neuroscience · NeurIPS 2025
Bioinformatics and computational biology › neuroscience › neuroinformatics
neural data analysis
0.912025
TRACE: Contrastive learning for multi-trial time series data in neuroscience · NeurIPS 2025
Bioinformatics and computational biology › neuroscience › neuroinformatics › neural data analysis
neural population decoding
0.912025
TRACE: Contrastive learning for multi-trial time series data in neuroscience · NeurIPS 2025

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

neighbor embedding · 1.7contrastive learning · 1.7
YearPublicationVenuePosition
2026 Logic-Driven Network for long-term action anticipation
Na Zhou, Renjie Yang, Zhigang Tu 0001
Eng. Appl. Artif. Intell.1
2026 An integrative analysis reveals the mechanism of plastic stabilizers inducing breast cancer
abstract
Plastic stabilizers (PSs) are chemical additives that are widely used to inhibit the degradation of plastics. However, their safety concerns and potential carcinogenic risks remain unclear. This study employed network toxicology strategies to elucidate the potential toxic effects and underlying molecular mechanisms of representative PSs, including 2,6-di-tert-butylphenol (2,6-DTB), tert-butylhydroquinone (TBHQ), and 2-(2H-benzotriazol-2-yl)-4,6-di-tert-pentylphenol (UV-328) in breast cancer (BC). Herein, we identified 69 potential genes related to PSs exposure and BC, and optimized five core targets: GSK3B, MAPK14, PARP1, PIM1, and TRDMT1, through subsequent LASSO and SVM algorithms. Based on these core genes, we constructed risk score and nomogram models, both of which revealed that high expression of these five core genes predicts poor prognosis in BC patients. Additionally, molecular docking and dynamic simulations indicated high-affinity interactions between PSs and these core targets (binding energies < -5 kcal/mol). Further correlation analysis with prediction analysis of microarray 50 (PAM50) revealed increased expression of all core genes in the basal-like subtype, especially PIM1 and TRDMT1, which also exhibited the highest risk scores. In vitro, PSs transcriptionally upregulated MAPK14, PIM1, and TRDMT1, with STAT3 mediating their transcription. Importantly, cell counting kit-8 and wound healing assays demonstrated that PSs promote BC cell proliferation and migration. Our research re-evaluates the carcinogenic risks of plastic stabilizers and suggests that PSs may enhance breast cancer progression via targets such as MAPK14, PIM1, and TRDMT1. This study introduces a new approach for evaluating the safety of plastic additives and offers novel insights into the toxicological effects of PSs.
Xingfa Huo, Xueqin Duan, Xiaojuan Huang, Linyuan Xue, Lantao Zhao, Na Zhou
PLoS Comput. Biol.8
2025 TRACE: Contrastive learning for multi-trial time series data in neuroscience
abstract
Modern neural recording techniques such as two-photon imaging or Neuropixel probes allow to acquire vast time-series datasets with responses of hundreds or thousands of neurons. Contrastive learning is a powerful self-supervised framework for learning representations of complex datasets. Existing applications for neural time series rely on generic data augmentations and do not exploit the multi-trial data structure inherent in many neural datasets. Here we present TRACE, a new contrastive learning framework that averages across different subsets of trials to generate positive pairs. TRACE allows to directly learn a two-dimensional embedding, combining ideas from contrastive learning and neighbor embeddings. We show that TRACE outperforms other methods, resolving fine response differences in simulated data. Further, using in vivo recordings, we show that the representations learned by TRACE capture both biologically relevant continuous variation, cell-type-related cluster structure, and can assist data quality control.
Lisa Schmors, Dominic Gonschorek, Jan Niklas Böhm, Yongrong Qiu, Na Zhou, Dmitry Kobak, Andreas S. Tolias, Fabian H. Sinz, Jacob Reimer, Katrin Franke, Sebastian Damrich, Philipp Berens
NeurIPS5
2025 A two-stage knowledge graph completion based on LLMs' data augmentation and atrous spatial pyramid pooling
Na Zhou
Appl. Intell.1
2021 Higher-order Structure Based Anomaly Detection on Attributed Networks
abstract
Anomaly detection (such as telecom fraud detection and medical image detection) has attracted the increasing attention of people. The complex interaction between multiple entities widely exists in the network, which can reflect specific human behavior patterns. Such patterns can be modeled by higher-order network structures, thus benefiting anomaly detection on attributed networks. However, due to the lack of an effective mechanism in most existing graph learning methods, these complex interaction patterns fail to be applied in detecting anomalies, hindering the progress of anomaly detection to some extent. In order to address the aforementioned issue, we present a higher-order structure based anomaly detection (GUIDE) method. We exploit attribute autoencoder and structure autoencoder to reconstruct node attributes and higher-order structures, respectively. Moreover, we design a graph attention layer to evaluate the significance of neighbors to nodes through their higher-order structure differences. Finally, we leverage node attribute and higher-order structure reconstruction errors to find anomalies. Extensive experiments on five real-world datasets (i.e., ACM, Citation, Cora, DBLP, and Pubmed) are implemented to verify the effectiveness of GUIDE. Experimental results in terms of ROC-AUC, PR-AUC, and Recall@K show that GUIDE significantly outperforms the state-of-art methods.
Xu Yuan 0002, Na Zhou, Shuo Yu 0001, Huafei Huang 0001, Zhikui Chen, Feng Xia 0001
IEEE BigData2
2021 An Optimal Composite Service Selection Model based on Edge-Cloud Collaboration
abstract
In the age of the Internet of everything, the Edge-Cloud collaborative service support has become a very promising development direction in the application field of the Internet of things. However, when various service components are deployed both on the cloud and the edge, the subsidence and decentralization of computing resources also have a great impact on the performance of composite services. This paper proposes an optimal composite service selection model based on Petri nets. In order to compare the composite service paths, this paper adopts a dynamic evaluation model of composite service quality based on Petri nets. Firstly, all kinds of Petri net models for the implementation structure of composite services are constructed. And then the QoS computing rules corresponding to these structures are given based on the QoS of each service component on the edge of the cloud. Finally, the dynamic execution process of each composite service with a feasible path is simulated through Petri net, and the overall performance of the service is evaluated based on the dynamic simulation of its Petri net model, finally, the optimal service path is selected among the combined services that meet the user's requirements.. Through case analysis and comparison, the feasibility and effectiveness of the method are verified by an example analysis.
Yan Wang 0037, Na Zhou, Haixia Lang, Yunying Li
COMPSAC2
2020 Database design of regional music characteristic culture resources based on improved neural network in data mining
Na Zhou
Pers. Ubiquitous Comput.1
2015 Improved best match search method in depth recovery with descent images
Cai Meng, Na Zhou
Mach. Vis. Appl.2
2013 Homography-based depth recovery with descent images
Cai Meng, Na Zhou, Xiaoliang Xue
Mach. Vis. Appl.2