2026 Chris Ding: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	82	927	896	138	136	304	46847

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

927

896

138

136

304

46847

Research.com Recognitions

2025 - Research.com Computer Science in China Leader Award
2023 - Research.com Computer Science in China Leader Award
2022 - Research.com Computer Science in China Leader Award

Overview

Chris Ding is affiliated with the Chinese University of Hong Kong, Shenzhen in China. Their research primarily spans the fields of Computer Science and Engineering, with a focus on multiple subfields and topics related to artificial intelligence, computer vision, and biomedical applications.

The main fields of study for Chris Ding include:

Computer Science
Engineering

Their subfields of specialization cover:

Artificial Intelligence
Computer Vision and Pattern Recognition
Biomedical Engineering

Chris Ding's work addresses various key research topics relevant to contemporary computational methods:

Topic Modeling
Natural Language Processing Techniques
Advanced Text Analysis Techniques
Human Pose and Action Recognition
Gait Recognition and Analysis
Anomaly Detection Techniques and Applications

A recent paper authored by Chris Ding includes:

"Dense-connected Stacked Hourglass Networks for Human Pose Estimation," published in 2024 in Applied and Computational Engineering

Frequent co-authors contributing to their research are:

Lianwei Wu
Pusheng Liu
Linyong Wang
Hai Liu

Chris Ding has published predominantly in the venue Applied and Computational Engineering, indicating an interest in the intersection of computational methods with engineering applications.

Best Publications

Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy

Hanchuan Peng;Fuhui Long;C. Ding

12076
Citations
Minimum redundancy feature selection from microarray gene expression data.

Chris H. Q. Ding;Hanchuan Peng

3960
Citations
Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization

Feiping Nie;Heng Huang;Xiao Cai;Chris H. Ding

2020
Citations
K-means clustering via principal component analysis

Chris Ding;Xiaofeng He

1996
Citations
Convex and Semi-Nonnegative Matrix Factorizations

C.H.Q. Ding;Tao Li;M.I. Jordan

1576
Citations
Orthogonal nonnegative matrix t-factorizations for clustering

Chris Ding;Tao Li;Wei Peng;Haesun Park

1556
Citations
On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering.

Chris H. Q. Ding;Xiaofeng He

1305
Citations
A min-max cut algorithm for graph partitioning and data clustering

C.H.Q. Ding;Xiaofeng He;Xiaofeng He;Hongyuan Zha;Ming Gu

1201
Citations
Multi-class protein fold recognition using support vector machines and neural networks.

Chris H.Q. Ding;Inna Dubchak

1171
Citations
Spectral Relaxation for K-means Clustering

Hongyuan Zha;Xiaofeng He;Chris Ding;Ming Gu

851
Citations
R1-PCA: rotational invariant L 1 -norm principal component analysis for robust subspace factorization

Chris Ding;Ding Zhou;Xiaofeng He;Hongyuan Zha

776
Citations
PageRank: HITS and a Unified Framework for Link Analysis.

Chris H. Q. Ding;Xiaofeng He;Parry Husbands;Hongyuan Zha

547
Citations
Symmetric Nonnegative Matrix Factorization for Graph Clustering.

Da Kuang;Chris Ding;Haesun Park

498
Citations
Community discovery using nonnegative matrix factorization

Fei Wang;Tao Li;Xin Wang;Shenghuo Zhu

495
Citations
Bipartite graph partitioning and data clustering

Hongyuan Zha;Xiaofeng He;Chris Ding;Horst Simon

489
Citations
Adaptive dimension reduction for clustering high dimensional data

C. Ding;Xiaofeng He;Hongyuan Zha;H.D. Simon

431
Citations
On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic Indexing

Chris Ding;Tao Li;Wei Peng

417
Citations
Multi-document summarization via sentence-level semantic analysis and symmetric matrix factorization

Dingding Wang;Tao Li;Shenghuo Zhu;Chris Ding

397
Citations
The Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering

Tao Li;C. Ding

396
Citations
Robust nonnegative matrix factorization using L21-norm

Deguang Kong;Chris Ding;Heng Huang

380
Citations

Frequent Co-Authors

Heng Huang University of Pittsburgh

Feiping Nie Northwestern Polytechnical University

Tao Li Florida International University

Hua Wang Victoria University

Bin Luo Anhui University

Horst D. Simon Lawrence Berkeley National Laboratory

Hongyuan Zha Chinese University of Hong Kong, Shenzhen

Jin Tang Anhui University

Ya Zhang Shanghai Jiao Tong University

Hanchuan Peng Southeast University

External Links

Personal website of Chris Ding Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring computer science opens doors to a variety of related online degrees and career opportunities. Many students interested in technology also consider fields like environmental engineering and data science, which integrate computer skills with real-world problem solving.

For those conscious of budget, options such as an environmental engineering bachelor's degree online and the cheapest online mechanical engineering degree offer affordable pathways to careers intersecting technology and engineering. These programs provide flexibility for learners who may be balancing work or family commitments.

If your interests lean toward the fundamentals of science, online physics degrees are available and often include a strong computational element, preparing graduates for industries such as software, engineering, or research.

Data-driven roles are also in high demand. Pursuing the cheapest data science masters in usa can position you for careers in analytics, artificial intelligence, or big data, complementing a computer science background and enhancing career prospects.