Qiu, Jiezhong
7 papers on CoChatORCID 0000-0001-9514-0708
Most cited papers
- Verified
Pre-trained models: Past, present and future
Han, X., Zhang, Z., Ding, N., Gu, Y., Liu, X., Huo, Y., Qiu, J., Yao, Y., Zhang, A., Zhang, L., et al. (2021) · AI Open
Domain Adaptation and Few-Shot LearningTopic Modeling
Cited by 994
- Verified
Kimi K2.5: Visual Agentic Intelligence
Kimi Team, Bai, T., Bai, Y., Bao, Y., Cai, S. H., Cao, Y., Chai, Z., Charles, Y., Che, H. S., Chen, C., et al. (2026) · arXiv
Multimodal Machine Learning ApplicationsDomain Adaptation and Few-Shot Learning
Cited by 770
- Verified
DeepInf: Social Influence Prediction with Deep Learning
Qiu, J., Tang, J., Ma, H., Dong, Y., Wang, K., & Tang, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Complex Network Analysis TechniquesRecommender Systems and Techniques
Cited by 587
- Verified
A mutation-induced drug resistance database (MdrDB)
Yang, Z., Ye, Z., Qiu, J., Feng, R., Li, D., Hsieh, C., Allcock, J., & Zhang, S. (2023) · Communications Chemistry
Computational Drug Discovery MethodsProtein Structure and Dynamics
Cited by 24
- Verified
Chemist-X: Large Language Model-empowered Agent for Reaction Condition Recommendation in Chemical Synthesis
Chen, K., Lu, J., Li, J., Yang, X., Du, Y., Wang, K., Shi, Q., Yu, J., Li, L., Qiu, J., et al. (2023) · arXiv
Machine Learning in Materials ScienceVarious Chemistry Research Topics
Cited by 10
- Verified
Kimi Linear: An Expressive, Efficient Attention Architecture
Kimi Team, Zhang, Y., Lin, Z., Yao, X., Hu, J., Meng, F., Liu, C., Men, X., Yang, S., Li, Z., et al. (2025) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 1
- Verified
Kimi K3: Open Frontier Intelligence
Kimi Team, Bai, T., Bai, Y., Bao, Y., C., M., Cai, J., Cai, X., Cao, P., Cao, Y., Chai, Z., et al. (2026) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 0
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free