Jon Kleinberg

Jon Kleinberg
Born Jon Michael Kleinberg
1971 (age 44–45)
Boston, Massachusetts
Nationality American
Fields Computer Science
Institutions
Alma mater Cornell University; Massachusetts Institute of Technology
Thesis Approximation algorithms for disjoint paths problems (1996)
Doctoral advisor Michel Goemans[1]
Doctoral students
  • Debra Goldberg
  • David Kempe
  • Amit Kumar
  • Daniel Romero

[1]

Known for HITS algorithm
Notable awards
Website
videolectures.net/jon_kleinberg
www.cs.cornell.edu/home/kleinber

Jon Michael Kleinberg is an American computer scientist and the Tisch University Professor of Computer Science at Cornell University known for his work in algorithms and networks.[3][4][5][6][7][8][9] He is a recipient of the Nevanlinna Prize by the International Mathematical Union.

Early life and education

Jon Kleinberg was born in 1971 in Boston, Massachusetts. He received a Bachelor of Science degree in computer science from Cornell University in 1993 and a Ph.D., from Massachusetts Institute of Technology in 1996. He is the older brother of fellow Cornell computer scientist Robert Kleinberg.

Career

Since 1996 Kleinberg has been a professor in the Department of Computer Science at Cornell, as well as a visiting scientist at IBM's Almaden Research Center. His work has been supported by an NSF Career Award, an ONR Young Investigator Award, a MacArthur Foundation Fellowship, a Packard Foundation Fellowship, a Sloan Foundation Fellowship, and grants from Google, Yahoo!, and the NSF. He is a member of the National Academy of Engineering and the American Academy of Arts and Sciences. In 2011, he was elected to the United States National Academy of Sciences.[10][11] In 2013 he became a fellow of the Association for Computing Machinery.[12]

Research

Kleinberg is best known for his work on networks and particularly for his HITS algorithm, developed while he was at IBM. HITS is an algorithm for web search that builds on the eigenvector-based methods used in algorithms and served as the full-scale model for PageRank by recognizing that web pages or sites should be considered important not only if they are linked to by many others (as in PageRank), but also if they link to many others. Search engines themselves are examples of sites that are important because they link to many others. Kleinberg realized that this generalization implies two different classes of important web pages, which he called "hubs" and "authorities". The HITS algorithm is an algorithm for automatically identifying the leading hubs and authorities in a network of hyperlinked pages.

Kleinberg is also known for his work on algorithmic aspects of the small world experiment.[13] He was one of the first to realize that Stanley Milgram's famous "six degrees" letter-passing experiment implied not only that there are short paths between individuals in social networks but also that people seem to be good at finding those paths, an apparently simple observation that turns out to have profound implications for the structure of the networks in question.

Kleinberg has written numerous papers and articles as well as a textbook on computer algorithms, Algorithm Design, co-authored the first edition with Éva Tardos and sole authored the second edition.[5][14] Among other honors, he received a MacArthur Foundation Fellowship also known as the "genius grant" in 2005 and the Nevanlinna Prize in 2006, an award that is given out once every four years along with the Fields Medal as the premier distinction in Computational Mathematics.[15] His new book is entitled "Networks, Crowds, and Markets: Reasoning About a Highly Connected World", published by Cambridge University Press in 2010.[16]

Cornell's Association of Computer Science Undergraduates awarded him the "Faculty of the Year" award in 2002.[17]

References

  1. 1 2 Jon Kleinberg at the Mathematics Genealogy Project
  2. ↑ http://awards.acm.org/2008/acm-infosys-award.cfm
  3. ↑ Kleinberg, J. M. (1999). "Authoritative sources in a hyperlinked environment". Journal of the ACM 46 (5): 604. doi:10.1145/324133.324140.
  4. ↑ Kleinberg, J. M. (2000). "Navigation in a small world". Nature 406 (6798): 845. doi:10.1038/35022643. PMID 10972276.
  5. 1 2 Kleinberg, Jon; Tardos, Éva (2006). Algorithm Design. Addison–Wesley, Boston. ISBN 0-321-29535-8.
  6. ↑ Jon Kleinberg's publications indexed by the DBLP Bibliography Server at the University of Trier
  7. ↑ Jon Kleinberg's publications indexed by the Scopus bibliographic database, a service provided by Elsevier.
  8. ↑ Jon Kleinberg from the Association for Computing Machinery (ACM) Digital Library
  9. ↑ Kempe, D.; Kleinberg, J.; Tardos, É. (2003). "Maximizing the spread of influence through a social network". Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '03. p. 137. doi:10.1145/956750.956769. ISBN 1581137370.
  10. ↑ Members and Foreign Associates Elected, National Academy of Sciences, May 3, 2011.
  11. ↑ Greuel, Gert-Martin; Hopcroft, John E.; Wright, Margaret H. (June–July 2007). "The Mathematical Work of Jon Kleinberg" (PDF). Notices of the American Mathematical Society 54 (6): 740–743. Retrieved 2008-01-15. Cite uses deprecated parameter |coauthors= (help)
  12. ↑ ACM Names Fellows for Computing Advances that Are Transforming Science and Society, Association for Computing Machinery, accessed 2013-12-10.
  13. ↑ Kleinberg, J. (2000). "The small-world phenomenon". Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00. p. 163. doi:10.1145/335305.335325. ISBN 1581131844.
  14. ↑ Algorithm Design: 9780132131087: Computer Science Books @ Amazon.com
  15. ↑ http://www.news.cornell.edu/stories/Aug06/NB.Kleinberg.Nevanlinna.ws.html
  16. ↑ Jon Kleinberg; David Easley (2010). Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge, UK: Cambridge University Press. ISBN 0-521-19533-0.
  17. ↑ "Cornell CS Faculty Awards". Cornell University.

External links

This article is issued from Wikipedia - version of the Saturday, April 23, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.