Caleb Belth

Hello! I'm Caleb, a PhD student at the University of Michigan, where I work with Danai Koutra. Some of my interests are streaming algorithms, graph summarization, information theory, and philosophy.

My research leverages ideas from information theory and linguistics to contribute methods to concisely represent unbounded graphs, such as networks that evolve continually and indefinitely.

I try my best to be responsible with my research, and continually consider whether my work will be constructive or destructive to society.

A current musing: are flocks of birds Turing Complete?

Prior to Michigan, I received a B.Sc. in Computer Science from Purdue University, where I was fortunate to work with Jennifer Neville, Dan Goldwasser, and Daisuke Kihara.

Feel free to contact me at cbelth@umich.edu.
In case you are wondering, the name of this website ("quickshift") is a nod to my life-long love of road trips, driving, and cars in general.

Publications

• Personalized Knowledge Graph Summarization: From the Cloud to Your Pocket
  Tara Safavi, Caleb Belth, Lukas Faber, Davide Mottin, Emmanuel Muller, Danai Koutra
  IEEE International Conference on Data Mining (ICDM), 2019 (acceptance rate: 9%) [pdf]
• When to Remember Where You Came from: Node Representation Learning in Higher-order Networks
  Caleb Belth, Fahad Kamran, Donna Tjandra, Danai Koutra
  IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2019 (acceptance rate: 15%) [pdf] [slides]
  Also accepted for presentation at the 15th SIGKDD International Workshop on Mining and Learning with Graphs.

Essays

Minds, Brains, and Maybe Programs. And also elephants. [pdf]

×