Daniel Tunkelang

High-Class Consultant

Daniel Tunkelang

Welcome to my CMU home page, which I update sporadically. You're better off looking at my LinkedIn profile, my posts on Medium, or my Query Understanding blog. You can also find me on Twitter and Quora.

About Me

I studied computer science and math at MIT and have a PhD in computer science from CMU. I was a founding employee and chief scientist of Endeca, a search pioneer that Oracle acquired for $1.1B. I then led a local search team at Google. After that, I was a director of data science and engineering at LinkedIn, where I established their query understanding team. I also wrote a book on faceted search.

Today I'm Chief Search Evangelist for Twiggle and a consultant at large. I help companies make decisions around algorithms, architecture, product strategy, hiring, and organizational structure.

Conferences and Workshops

In 2007, I created the symposium on Human-Computer Interaction and Information Retrieval (HCIR), which has evolved into CHIIR.

I organized industry tracks and workshops at SIGIR 2009, WSDM 2010, CIKM 2011, and RecSys 2012.

I spoke at SDM 2002, CIKM 2004, SIGIR 2006, SIGIR 2007, ECIR 2008, SIGMOD 2009, ISSS 2009, RecSys 2011, RecSys 2012, CIKM 2012. SIGIR 2013, CIKM 2013, WebSci 2014, and KDD 2016.

Finally, I've participated in industry practitioner conferences, including O'Reilly Strata and QCon.

Graph Layout

Before discovering the joys of search and data science, I worked on graph layout (aka graph drawing), which can generously be called information visualization.

Please feel free to read my dissertation on "A Numerical Optimization Approach to General Graph Drawing", and better yet download the source code.

The source code is available for both non-commercial and commercial use; I only ask that you acknowledge the use of the software and let me know that you are using it. Besides, you might actually get me to help you with it that way!

You might also be interested my earlier paper describing a practical approach to drawing undirected graphs.