Hans-Peter Kriegel

Hans-Peter Kriegel (1 October 1948, Germany) is a German computer scientist and professor at the Ludwig Maximilian University of Munich and leading the Database Systems Group in the Department of Computer Science. He was previously professor at the University of Würzburg and the University of Bremen after habilitation at the Technical University of Dortmund and doctorate from Karlsruhe Institute of Technology.

Hans-Peter Kriegel
Born (1948-10-01) 1 October 1948
NationalityGerman
Alma materKarlsruhe Institute of Technology
Known forR*-tree, X-tree, DBSCAN, OPTICS, LOF
AwardsACM Fellow, IEEE ICDM Research Contributions Award, ACM SIGKDD Innovation Award
Scientific career
FieldsComputer Science (Data mining, spatial data management)
InstitutionsTechnical University of Dortmund, University of Bremen, University of Würzburg, Ludwig Maximilian University of Munich
ThesisErzeugung von Übersetzungen durch Grammatikpaare[1] (1976)
Doctoral advisorHermann Maurer
Doctoral studentsDaniel A. Keim, Arthur Zimek

Research

His most important contributions are the database index structures R*-tree, X-tree and IQ-Tree, the cluster analysis algorithms DBSCAN, OPTICS and SUBCLU and the anomaly detection method Local Outlier Factor (LOF).

His research is focused around correlation clustering, high-dimensional data indexing and analysis, spatial data mining and spatial data management as well as multimedia databases.

His research group developed a software framework titled ELKI that is designed for the parallel research of index structures, data mining algorithms and their interaction, such as optimized data mining algorithms based on databases indexes.

Awards

In 2009 the Association for Computing Machinery appointed Hans-Peter Kriegel a "fellow",[2] one of its highest honors. He has been honored in particular for his contributions to "knowledge discovery and data mining, similarity search, spatial data management, and access methods for high-dimensional data".

He received the 2013 IEEE ICDM Research Contributions Award for his research on data mining algorithm such as DBSCAN, OPTICS, Local Outlier Factor and his work on mining high-dimensional data.[3]

He was also awarded the 2015 ACM SIGKDD Innovation Award for his contributions to data mining in clustering, outlier detection and high-dimensional data analysis, in particular for density-based approaches.[4] DBSCAN also received the 2014 ACM SIGKDD test of time award.[5]

He is the most cited[6] German researcher in databases[7] and data mining.[8]

gollark: +rule no u
gollark: robot is rule a b c d e f
gollark: robot is rule potato
gollark: robot is help
gollark: Just use TIO or ABR.

References

  1. Hans-Peter Kriegel at the Mathematics Genealogy Project
  2. Association for Computing Machinery. "ACM Names 47 Fellows for Innovations in Computing, Information Technology". Archived from the original on 2017-02-13. Retrieved 2011-01-25.
  3. Wu, Xindong (2013-10-18). "2013 IEEE ICDM Research Contributions Award: Professor Hans-Peter Kriegel". IEEE International Conference on Data Mining. IEEE International Conference on Data Mining. Archived from the original on 23 October 2013. Retrieved 29 October 2013.
  4. "2015 SIGKDD Innovation Award". ACM SIGKDD. 2015-07-22. Archived from the original on 2015-08-16. Retrieved 2015-08-17.
  5. "2014 SIGKDD Test of Time Award". ACM SIGKDD. 2014-08-18. Archived from the original on 2014-08-26. Retrieved 2014-08-22.
  6. E. Rahm, A. Thor (2005). "Citation analysis of database publications" (PDF). SIGMOD Record. Association for Computing Machinery. 34 (4): 48–53. doi:10.1145/1107499.1107505. Retrieved 2010-05-10. Most cited database chair in Germany, Nr. 2 in Europe, Nr. 10 worldwide
  7. Microsoft Academic Search. "Top-ranked Authors in "Databases"". Archived from the original on 2010-12-04. Retrieved 2010-12-03. Rank 13 in Databases
  8. Microsoft Academic Search. "Top-ranked Authors in "Data Mining"". Archived from the original on 2010-11-29. Retrieved 2010-12-03. Rank 7 in Data Mining
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.