Jon Kleinberg

Jon Kleinberg is a person.

• See: Network Analysis.

---

---

References

• Personal Homepage: http://www.cs.cornell.edu/home/kleinber/
• DBLP Page: http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/k/Kleinberg:Jon_M=.html
• Wikipedia Page: http://en.wikipedia.org/wiki/Jon_Kleinberg

2010

• (Leskovec et al., 2010) ⇒ Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. (2010). “Kronecker Graphs: An approach to modeling networks.” In: The Journal of Machine Learning Research, 11.

2009

• (Leskovec et al., 2009) ⇒ Jure Leskovec, Lars Backstrom, and Jon Kleinberg. (2009). “Meme-Tracking and the Dynamics of the News Cycle.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557077
• (Backstrom et al., 2009) ⇒ Lars Backstrom, Ravi Kumar, and Jon Kleinberg. (2009). “Optimizing Web Traffic via the Media Scheduling Problem.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557036

2006

• (Backstrom et al., 2006) ⇒ Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, and Xiangyang Lan. (2006). “Group Formation in Large Social Networks: membership, growth, and evolution.” In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2006). doi:10.1145/1150402.1150412

2005

• (Klinberg & Tardos, 2005) ⇒ Jon Kleinberg, and Éva Tardos. (2005). “Algorithm Design." Addison-Wesley. ISBN:0-321-29535-8

2003

• (Kempe et al., 2003) ⇒ David Kempe, Jon Kleinberg, and Éva Tardos, (2003). “Maximizing the Spread of Influence Through a Social Network.” In: Proceedings of SIGKDD Conference (KDD-2003). doi:10.1145/956750.956769
• (Liben-Nowell & Kleinberg. 2003) ⇒ David Liben-Nowell, and Jon Kleinberg. (2003). “The Link Prediction Problem for Social Networks.” In: Proceedings of the twelfth International Conference on Information and knowledge management (CIKM 2003). doi:10.1145/956863.956972

2000

• (Kleinberg, 2000) ⇒ Jon Kleinberg (2000). “The Small-World Phenomenon: an algorithmic perspective.” In: 32nd ACM Symposium on Theory of Computing. doi:10.1145/335305.335325

1999

• (Kleinberg, 1999) ⇒ Jon Kleinberg. (1999). “Authoritative Sources in a Hyperlinked Environment.” In: Journal of the ACM (JACM), 46(5) doi:10.1145/324133.324140
• (Kleinberg & Tardos, 1999) ⇒ Jon Kleinberg, and Éva Tardos. (1999). “Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields.” In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science.

1998

• (Gibson et al., 1998) ⇒ David Gibson, Jon Kleinberg, and Prabhakar Raghavan. (1998). “Inferring Web communities from link topology.” In: Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems doi:10.1145/276627.276652
• (Chakrabarti et al., 1998a) ⇒ Soumen Chakrabarti, Byron Dom, Prabhakar Raghavan, Sridhar Rajagopalan, David Gibson, and Jon Kleinberg. (1998). “Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.” In: Proceedings of the seventh International Conference on World Wide Web 7.
  • Cited by ~676

---