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

Eldar Sadikov

dblp:78/1064 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none

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

Databases, data management, data science and information retrieval · 4 · 3 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-author

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
3 papers
Information retrieval · 53% Web and social media mining · 37% Data mining · 10%

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

TopicWeightPapersLastEvidence papers
Information retrieval
search engines
0.112012
Domain bias in web search · WSDM 2012
Web and social media mining
user behavior analysis
0.112012
Domain bias in web search · WSDM 2012
Web and social media mining › information diffusion
information cascade modeling
0.112011
Correcting for missing data in information cascades · WSDM 2011
Web and social media mining
information diffusion
0.112011
Correcting for missing data in information cascades · WSDM 2011
Data mining
clustering
0.112010
Clustering query refinements by user intent · WWW 2010
Information retrieval › query understanding
query clustering
0.112010
Clustering query refinements by user intent · WWW 2010
Information retrieval › query reformulation
query refinement
0.112010
Clustering query refinements by user intent · WWW 2010
Information retrieval › user behavior › search behavior
click behavior
0.012012
Domain bias in web search · WSDM 2012
Information retrieval
evaluation
0.012012
Domain bias in web search · WSDM 2012
Information retrieval › user behavior › search behavior › click model
position bias
0.012012
Domain bias in web search · WSDM 2012
Information retrieval
ranking
0.012012
Domain bias in web search · WSDM 2012
Information retrieval
query suggestion
0.012010
Clustering query refinements by user intent · WWW 2010

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

human judgment experiments · 0.1blind domain test · 0.1cascade graph modeling · 0.1random walk · 0.1markov graph · 0.1
YearPublicationVenuePosition
2012 Domain bias in web search
abstract
This paper uncovers a new phenomenon in web search that we call domain bias --- a user's propensity to believe that a page is more relevant just because it comes from a particular domain. We provide evidence of the existence of domain bias in click activity as well as in human judgments via a comprehensive collection of experiments. We begin by studying the difference between domains that a search engine surfaces and that users click. Surprisingly, we find that despite changes in the overall distribution of surfaced domains, there has not been a comparable shift in the distribution of clicked domains. Users seem to have learned the landscape of the internet and their click behavior has thus become more predictable over time. Next, we run a blind domain test, akin to a Pepsi/Coke taste test, to determine whether domains can shift a user's opinion of which page is more relevant. We find that domains can actually flip a user's preference about 25% of the time. Finally, we demonstrate the existence of systematic domain preferences, even after factoring out confounding issues such as position bias and relevance, two factors that have been used extensively in past work to explain user behavior. The existence of domain bias has numerous consequences including, for example, the importance of discounting click activity from reputable domains.
Samuel Ieong, Nina Mishra, Eldar Sadikov, Li Zhang 0001
WSDM3
2011 Correcting for missing data in information cascades
abstract
Transmission of infectious diseases, propagation of information, and spread of ideas and influence through social networks are all examples of diffusion. In such cases we say that a contagion spreads through the network, a process that can be modeled by a cascade graph. Studying cascades and network diffusion is challenging due to missing data. Even a single missing observation in a sequence of propagation events can significantly alter our inferences about the diffusion process.
Eldar Sadikov, Montserrat Medina, Jure Leskovec, Hector Garcia-Molina
WSDM1
2010 Clustering query refinements by user intent
abstract
We address the problem of clustering the refinements of a user search query. The clusters computed by our proposed algorithm can be used to improve the selection and placement of the query suggestions proposed by a search engine, and can also serve to summarize the different aspects of information relevant to the original user query. Our algorithm clusters refinements based on their likely underlying user intents by combining document click and session co-occurrence information. At its core, our algorithm operates by performing multiple random walks on a Markov graph that approximates user search behavior. A user study performed on top search engine queries shows that our clusters are rated better than corresponding clusters computed using approaches that use only document click or only sessions co-occurrence information.
Eldar Sadikov, Jayant Madhavan, Alon Y. Halevy
WWW1
2009 Blogs as Predictors of Movie Success
Eldar Sadikov, Aditya G. Parameswaran, Petros Venetis
ICWSM1
2006 Loudmouth: : modifying text-to-speech synthesis in noise
abstract
Current speech synthesis technology is difficult to understand in everyday noise situations. Although there is a significant body of work on how humans modify their speech in noise, the results have yet to be implemented in a synthesizer. Algorithms capable of processing and incorporating these modifications may lead to improved speech intelligibility of assistive communication aids and more generally of spoken dialogue systems. We describe our efforts in building the Loudmouth synthesizer which emulates human modifications to speech in noise. A perceptual experiment indicated that Loudmouth achieved a statistically significant gain in intelligibility compared to a standard synthesizer in noise.
Rupal Patel, Michael Everett, Eldar Sadikov
ASSETS3