Adil Bagirov
Adil Bagirov publishes mostly in Artificial Intelligence, Numerical Analysis and Computational Theory and Mathematics, on topics such as Advanced Optimization Algorithms Research, Advanced Clustering Algorithms Research and Optimization and Variational Analysis.
- World rank
- #788,302 of 7,710,434 ranked researchers
- Rank in Australia
- #26,346 of 140,210
- Works
- 248
- Citations
- 4.2k
- Citations per work
- 16.9
What does Adil Bagirov research?
Adil Bagirov's work is mostly in Computer Science (44%), Mathematics (14%), Engineering (9%).
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 Sciences16667.1%
- Computer Science11044.2%
- Mathematics3313.5%
- Engineering239.4%
- Everything else8232.9%
- 1Artificial Intelligence26% of their works
- 2Numerical Analysis14% of their works
- 3Computational Theory and Mathematics11% of their works
- 4Computer Vision and Pattern Recognition7% of their works
- 5Computational Mechanics6% of their works
- 6Control and Systems Engineering4% of their works
Research topics
- Advanced Optimization Algorithms Research
- Advanced Clustering Algorithms Research
- Optimization and Variational Analysis
- Face and Expression Recognition
- Metaheuristic Optimization Algorithms Research
- Sparse and Compressive Sensing Techniques
- Bayesian Methods and Mixture Models
- Neural Networks and Applications
Which keywords describe Adil Bagirov's research?
The keywords of their largest research topics: Global Optimization, Convex Optimization, Evolutionary Algorithms, Optimization Software, Semidefinite Programming, Clustering Algorithms, K-means and Sparse Representation.
- Self-Organizing Maps
- Mixture Models
- Signal Recovery
- Particle Swarm Optimization
- Face Recognition
- Nonlinear Operators
- Sparse Representation
- Clustering Algorithms
- Optimization Software
- Convex Optimization
- Global Optimization
- Evolutionary Algorithms
- Semidefinite Programming
- K-means
- Iterative Algorithms
- Dimensionality Reduction
- Differential Evolution
- Compressed Sensing
- Clustering
- Neural Networks
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 20 words, with their numbers
- Global Optimization992 topics
- Convex Optimization982 topics
- Evolutionary Algorithms882 topics
- Optimization Software741 topic
- Semidefinite Programming741 topic
- Clustering Algorithms631 topic
- K-means631 topic
- Sparse Representation592 topics
- Iterative Algorithms361 topic
- Nonlinear Operators361 topic
- Dimensionality Reduction351 topic
- Face Recognition351 topic
- Differential Evolution251 topic
- Particle Swarm Optimization251 topic
- Compressed Sensing241 topic
- Signal Recovery241 topic
- Clustering181 topic
- Mixture Models181 topic
- Neural Networks171 topic
- Self-Organizing Maps171 topic
Where does Adil Bagirov work?
Adil Bagirov's main affiliation in the publication record is Federation University, Australia.
How many publications and citations does Adil Bagirov have?
OpenAlex counts 248 works and 4,187 citations for Adil Bagirov, an h-index of 34, ranking #788,302 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 Adil Bagirov. 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.