Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Tunkelang

dblp:53/5940 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 2 first-authorTheory of computation · 2 · 2 first-authorArtificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 85% Web and social media mining · 10% Query processing and optimization · 5%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › search engines › semantic search › entity retrieval
people search
0.212014
The role of network distance in linkedin people search · SIGIR 2014
Information retrieval › user behavior
search behavior
0.212014
The role of network distance in linkedin people search · SIGIR 2014
Information retrieval
interactive information retrieval
0.112009
Design for interaction · SIGMOD Conference 2009
Web and social media mining
social network analysis
0.112014
The role of network distance in linkedin people search · SIGIR 2014

Methods — techniques the papers use, named apart from their topics

user study · 0.2log analysis · 0.2
YearPublicationVenuePosition
2014 The role of network distance in linkedin people search
abstract
LinkedIn is the world's largest professional network, with over 300 million members. One of the primary activities on the site is people search, for which LinkedIn members are both the users and the corpus. This paper presents insights about people search behavior on LinkedIn, based on a log analysis and a user study. In particular, it examines the role that network distance plays in name searches and non-name searches. For name searches, users primarily click on only one of the results, and closer network distance leads to higher click-through rates. In contrast, for non-name searches, users are more likely to click on multiple results that are not in their existing connections, but with whom they have shared connections. The results show that, while network distance contributes significantly to LinkedIn search engagement in general, its role varies dramatically depending on the type of search query.
Shih-Wen Huang, Daniel Tunkelang, Karrie Karahalios
SIGIR2
2013 Introduction to special issue on human-computer information retrieval
Ryen W. White, Robert G. Capra, Gene Golovchinsky, Bill Kules, Catherine L. Smith, Daniel Tunkelang
Inf. Process. Manag.6
2011 Recommendations as a conversation with the user
abstract
Recommender systems provide users with products or content intended to satisfy their information needs. The primary evaluation measures for recommender systems emphasize either the perceived relevance of the recommendations or the actions driven by those recommendations (e.g., purchases on ecommerce sites or clicks on news and social networking sites). Unfortunately, this transactional emphasis neglects the inherently interactive nature of the user experience.
Daniel Tunkelang
RecSys1
2009 Design for interaction
abstract
Research in information retrieval has focused on presenting the most relevant results to a user in response to a free-text search query. Research in database systems assumes a model where the user enters a formal query, and the results are exactly those the user requested. Neither community has emphasized user interaction—a critical concern for practical information access.
Daniel Tunkelang
SIGMOD Conference1
2004 Processing search queries in a distributed environment
abstract
Endeca's approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using a master-slave architecture, we are able to support classic search as well as more advanced features. We avoid bottlenecking the master with excessive computation or communication by limiting the information from the slaves in the expected case.
Frederick Knabe, Daniel Tunkelang
CIKM2
1998 JIGGLE: Java Interactive Graph Layout Environment
Daniel Tunkelang
GD1
1997 Lexical Navigation: Using Incremental Graph Drawing for Query Refinement
Daniel Tunkelang, Roy J. Byrd, James W. Cooper
GD1