George Karypis

University of Minnesota

Papers

1

Total Citations

3

H-Index

1

About

George Karypis is a leading figure in data mining, bioinformatics, and high-performance computing, renowned for his foundational contributions to graph partitioning and clustering algorithms. His work on the METIS and ParMETIS libraries revolutionized parallel graph partitioning, enabling scalable processing of large-scale networks and scientific simulations. With over 100,000 citations, Karypis’s research has profoundly impacted fields ranging from computational biology to social network analysis. He is particularly celebrated for developing the Chameleon clustering algorithm, which adaptively models cluster structures, and for pioneering methods in collaborative filtering that underpin modern recommendation systems. His notable achievements include receiving the ACM SIGKDD Test of Time Award and being named a Fellow of the IEEE and ACM. Karypis’s early work on randomized parallel search for robot motion planning, though less cited, laid groundwork for efficient exploration in high-dimensional spaces. Through his prolific publication record and open-source software, Karypis continues to shape how researchers analyze complex, interconnected data across scientific disciplines.

Research Focus

Key Achievements

1
H-Index
1
Papers
3
Total Citations
3
Avg Citations/Paper
🏆 Most Cited Paper
Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning
3 citations · 2003
📈 Most Prolific Year: 2003 (1 Papers)
🤝 Key Collaborators: 3
🏛 Institutions: University of Minnesota

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 12 days ago