Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Density-Based Clustering over an Evolving Data Stream with Noise
2006631 citationsFeng Cao, Weining Qian et al.profile →
TFB: Towards Comprehensive and Fair Benchmarking of Time Series Forecasting Methods
202449 citationsChenjuan Guo, Aoying Zhou et al.Proceedings of the VLDB Endowmentprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Aoying Zhou's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Aoying Zhou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aoying Zhou more than expected).
This network shows the impact of papers produced by Aoying Zhou. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Aoying Zhou. The network helps show where Aoying Zhou may publish in the future.
Co-authorship network of co-authors of Aoying Zhou
This figure shows the co-authorship network connecting the top 25 collaborators of Aoying Zhou.
A scholar is included among the top collaborators of Aoying Zhou based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Aoying Zhou. Aoying Zhou is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Guo, Chenjuan, et al.. (2024). TFB: Towards Comprehensive and Fair Benchmarking of Time Series Forecasting Methods. Proceedings of the VLDB Endowment. 17(9). 2363–2377.49 indexed citations breakdown →
He, Xiaofeng, et al.. (2013). Multi-Stage Malicious Click Detection on Large Scale Web Advertising Data.. Very Large Data Bases. 67–72.3 indexed citations
14.
Tian, Xiuxia, Xiaoling Wang, & Aoying Zhou. (2013). DSP Re-encryption Based Access Control Enforcement Management Mechanism in DaaS. International journal of network security. 15. 28–41.6 indexed citations
15.
Cai, Peng, Wei Gao, Aoying Zhou, & Kam‐Fai Wong. (2011). Query Weighting for Ranking Model Adaptation. Singapore Management University Institutional Knowledge (InK) (Singapore Management University). 112–122.7 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.