Data science faculty ranked among top CS researchers in the world
Guide2Research recently released its 2021 rankings of top scientists in computer science and electronics. This year, two data science graduate faculty members—Vipin Kumar (#69) and George Karypis (#262)—were included in the list of the top 1,000 computer science researchers in the world.
Two additional faculty ranked among the top 1,000 researchers in the United States, namely Shashi Shekhar (#1185 world, #707 US) and the Data Science Director of Undergradyate Students Jaideep Srivastava (#1493 world, #871 US).
These rankings, based on H-index and DBLP publications, were designed to offer the academic community more visibility and exposure to the influential research contributions made by leading institutions at the forefront of computer science.
Overall, the University of Minnesota was once again ranked as the #26 computer science university in the United States (and #40 in the world) for 2021.
Faculty in top 1,000 worldwide rankings
Vipin Kumar (ranked #69 in the world, #45 in the US)
Kumar's research spans data mining, high performance computing, and applications in climate/ecosystems and healthcare. His work has resulted in the development of the concept of isoefficiency metric for evaluating the scalability of parallel algorithms, as well as highly efficient parallel algorithms and software for sparse matrix factorization (PSPASES) and graph partitioning (METIS, ParMetis, hMetis). His current focus is on bringing the power of big data and machine learning to understand the impact of human induced changes on the Earth and its environment.
George Karypis (ranked #262 in the world, #165 in the US)
Karypis' research interests are concentrated in the areas of data mining, recommender systems, learning analytics, high performance computing, and chemical informatics. Within these areas, his research focuses in developing novel algorithms for solving important existing and/or emerging problems, and on developing practical software tools implementing some of these algorithms. The results from this research have been presented in various conferences and published in leading peer reviewed journals and highly selective conference proceedings.