Ganlin Shan
Ganlin Shan publishes mostly in Artificial Intelligence, Control and Systems Engineering and Aerospace Engineering, on topics such as Target Tracking and Data Fusion in Sensor Networks, Distributed Sensor Networks and Detection Algorithms and Advanced Algorithms and Applications.
- World rank
- #4,961,441 of 7,710,434 ranked researchers
- Rank in China
- #742,420 of 978,568
- Works
- 71
- Citations
- 280
- Citations per work
- 3.9
What does Ganlin Shan research?
Ganlin Shan's work is mostly in Engineering (45%), Computer Science (43%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences6287.7%
- Engineering3244.6%
- Computer Science3143.1%
- Everything else912.3%
- 1Artificial Intelligence26% of their works
- 2Control and Systems Engineering20% of their works
- 3Aerospace Engineering15% of their works
- 4Electrical and Electronic Engineering10% of their works
- 5Computer Networks and Communications9% of their works
- 6Computer Vision and Pattern Recognition8% of their works
Research topics
- Target Tracking and Data Fusion in Sensor Networks
- Distributed Sensor Networks and Detection Algorithms
- Advanced Algorithms and Applications
- Advanced Measurement and Detection Methods
- Infrared Target Detection Methodologies
- Advanced Computational Techniques and Applications
- Fault Detection and Control Systems
- Face and Expression Recognition
Which keywords describe Ganlin Shan's research?
The keywords of their largest research topics: Nonlinear Estimation, Particle Filters, Wireless Sensor Networks, Detection, Support Vector Machines, Machine Learning, Sparse Representation and Decentralized Estimation.
- Dimensionality Reduction
- Process Monitoring
- Expert Systems
- Infrared
- Optoelectronic
- Measurement
- Decentralized Estimation
- Machine Learning
- Detection
- Particle Filters
- Nonlinear Estimation
- Wireless Sensor Networks
- Support Vector Machines
- Sparse Representation
- Distributed Detection
- Neural Networks
- PID Control
- Small Target
- Fault Detection
- Wavelet Analysis
- Face Recognition
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 21 words, with their numbers
- Nonlinear Estimation321 topic
- Particle Filters321 topic
- Wireless Sensor Networks262 topics
- Detection232 topics
- Support Vector Machines172 topics
- Machine Learning162 topics
- Sparse Representation162 topics
- Decentralized Estimation141 topic
- Distributed Detection141 topic
- Measurement121 topic
- Neural Networks121 topic
- Optoelectronic121 topic
- PID Control121 topic
- Infrared111 topic
- Small Target111 topic
- Expert Systems81 topic
- Fault Detection81 topic
- Process Monitoring81 topic
- Wavelet Analysis81 topic
- Dimensionality Reduction51 topic
- Face Recognition51 topic
Where does Ganlin Shan work?
Ganlin Shan's main affiliation in the publication record is Ordnance Engineering College, China.
How many publications and citations does Ganlin Shan have?
OpenAlex counts 71 works and 280 citations for Ganlin Shan, an h-index of 10, ranking #4,961,441 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Ganlin Shan. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.