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

Dan Sommerfield

dblp:39/3417 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial intelligence and machine learning · 4Databases, data management, data science and information retrieval · 4

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.

Software engineering, system software, and programming languages
1 paper
Empirical software engineering · 100%
Human-computer interaction and pervasive computing
1 paper
Usability and user experience research · 100%
Databases, data mining, and information retrieval
2 papers
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Usability and user experience research › experimental design
online controlled experiments
0.112007
Practical guide to controlled experiments on the web: listen to your customers not to the hippo · KDD 2007
Empirical software engineering › controlled experiment › online controlled experiments
a/b testing
0.112007
Practical guide to controlled experiments on the web: listen to your customers not to the hippo · KDD 2007
Empirical software engineering › controlled experiment
online controlled experiments
0.112007
Practical guide to controlled experiments on the web: listen to your customers not to the hippo · KDD 2007
Data mining › predictive modeling
classification
0.011998
Targeting Business Users with Decision Table Classifiers · KDD 1998
Data mining › dimensionality reduction
feature selection
0.011995
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology · KDD 1995
Data mining
overfitting
0.011995
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology · KDD 1995
Data mining › dimensionality reduction › feature selection
wrapper methods
0.011995
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology · KDD 1995

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

randomized experiment · 0.1hashing · 0.1factorial design · 0.1data mining · 0.1decision table · 0.0wrapper methods · 0.0dynamic search space topology · 0.0
YearPublicationVenuePosition
2009 Controlled experiments on the web: survey and practical guide
abstract
The web provides an unprecedented opportunity to evaluate ideas quickly using controlled experiments, also called randomized experiments, A/B tests (and their generalizations), split tests, Control/Treatment tests, MultiVariable Tests (MVT) and parallel flights. Controlled experiments embody the best scientific design for establishing a causal relationship between changes and their influence on user-observable behavior. We provide a practical guide to conducting online experiments, where end-users can help guide the development of features. Our experience indicates that significant learning and return-on-investment (ROI) are seen when development teams listen to their customers, not to the Highest Paid Person’s Opinion (HiPPO). We provide several examples of controlled experiments with surprising results. We review the important ingredients of running controlled experiments, and discuss their limitations (both technical and organizational). We focus on several areas that are critical to experimentation, including statistical power, sample size, and techniques for variance reduction. We describe common architectures for experimentation systems and analyze their advantages and disadvantages. We evaluate randomization and hashing techniques, which we show are not as simple in practice as is often assumed. Controlled experiments typically generate large amounts of data, which can be analyzed using data mining techniques to gain deeper understanding of the factors influencing the outcome of interest, leading to new hypotheses and creating a virtuous cycle of improvements. Organizations that embrace controlled experiments with clear evaluation criteria can evolve their systems with automated optimizations and real-time analyses. Based on our extensive practical experience with multiple systems and organizations, we share key lessons that will help practitioners in running trustworthy controlled experiments.
Ron Kohavi, Roger Longbotham, Dan Sommerfield, Randal M. Henne
Data Min. Knowl. Discov.3
2007 Practical guide to controlled experiments on the web: listen to your customers not to the hippo
abstract
The web provides an unprecedented opportunity to evaluate ideas quickly using controlled experiments, also called randomized experiments (single factor or factorial designs), A/B tests (and their generalizations), split tests, Control/Treatment tests, and parallel flights. Controlled experiments embody the best scientific design for establishing a causal relationship between changes and their influence on user-observable behavior. We provide a practical guide to conducting online experiments, where end-users can help guide the development of features. Our experience indicates that significant learning and return-on-investment (ROI) are seen when development teams listen to their customers, not to the Highest Paid Person's Opinion (HiPPO). We provide several examples of controlled experiments with surprising results. We review the important ingredients of running controlled experiments, and discuss their limitations (both technical and organizational). We focus on several areas that are critical to experimentation, including statistical power, sample size, and techniques for variance reduction. We describe common architectures for experimentation systems and analyze their advantages and disadvantages. We evaluate randomization and hashing techniques, which we show are not as simple in practice as is often assumed. Controlled experiments typically generate large amounts of data, which can be analyzed using data mining techniques to gain deeper understanding of the factors influencing the outcome of interest, leading to new hypotheses and creating a virtuous cycle of improvements. Organizations that embrace controlled experiments with clear evaluation criteria can evolve their systems with automated optimizations and real-time analyses. Based on our extensive practical experience with multiple systems and organizations, we share key lessons that will help practitioners in running trustworthy controlled experiments.
Ron Kohavi, Randal M. Henne, Dan Sommerfield
KDD3
1998 Targeting Business Users with Decision Table Classifiers
Ron Kohavi, Dan Sommerfield
KDD2
1996 Data Mining Using MLC++: A Machine Learning Library in C++
abstract
Data mining algorithms including machine learning, statistical analysis, and pattern recognition techniques can greatly improve our understanding of data warehouses that are now becoming more widespread. In this paper, we focus on classification algorithms and review the need for multiple classification algorithms. We describe a system called /spl Mscr//spl Lscr//spl Cscr/++ which was designed to help choose the appropriate classification algorithm for a given dataset by making it easy to compare the utility of different algorithms on a specific dataset of interest. /spl Mscr//spl Lscr//spl Cscr/++ not only provides a work-bench for such comparisons, but also provides a library of C++ classes to aid in the development of new algorithms, especially hybrid algorithms and multi-strategy algorithms. Such algorithms are generally hard to code from scratch. We discuss design issues, interfaces to other programs, and visualization of the resulting classifiers.
Ron Kohavi, Dan Sommerfield, James Dougherty
ICTAI2
1995 Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
Ron Kohavi, Dan Sommerfield
KDD2