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

Ron Kohavi

dblp:k/RonKohavi · also Ronny Kohavi · DBLP profile ↗
← Back
47ranked-venue papers
34as first author
2since 2021 · last 2024
0000-0003-1623-4963ORCID · corroborated

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

Artificial intelligence and machine learning · 37 · 26 first-author · 2 since 2021Databases, data management, data science and information retrieval · 30 · 22 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Software engineering, system software, and programming languages
9 papers
Empirical software engineering · 100%
Human-computer interaction and pervasive computing
6 papers
Usability and user experience research · 100%
Databases, data mining, and information retrieval
11 papers
Data mining · 56% Web and social media mining · 17% Information retrieval · 16%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 67% Cloud and datacenter computing · 33%

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

TopicWeightPapersLastEvidence papers
Empirical software engineering › controlled experiment
online controlled experiments
2.592024
False Positives in A/B Tests · KDD 2024
A/B Testing Intuition Busters: Common Misunderstandings in Online Controlled Experiments · KDD 2022
A/B Testing at Scale: Accelerating Software Innovation · SIGIR 2017
Empirical software engineering › controlled experiment › online controlled experiments
a/b testing
2.172024
False Positives in A/B Tests · KDD 2024
A/B Testing Intuition Busters: Common Misunderstandings in Online Controlled Experiments · KDD 2022
Online Controlled Experiments: Lessons from Running A/B/n Tests for 12 Years · KDD 2015
Usability and user experience research › experimental design
online controlled experiments
1.852024
False Positives in A/B Tests · KDD 2024
A/B Testing Intuition Busters: Common Misunderstandings in Online Controlled Experiments · KDD 2022
Online Controlled Experiments: Lessons from Running A/B/n Tests for 12 Years · KDD 2015
Performance modeling and evaluation
online controlled experiments
0.212013
Improving the sensitivity of online controlled experiments by utilizing pre-experiment data · WSDM 2013
Performance modeling and evaluation › simulation
variance reduction
0.212013
Improving the sensitivity of online controlled experiments by utilizing pre-experiment data · WSDM 2013
Empirical software engineering
controlled experiment
0.112009
Seven pitfalls to avoid when running controlled experiments on the web · KDD 2009
Information retrieval
evaluation
0.112017
A/B Testing at Scale: Accelerating Software Innovation · SIGIR 2017
Data mining
e-commerce data mining
0.122001
Mining e-commerce data: the good, the bad, and the ugly · KDD 2001
Integrating E-Commerce and Data Mining: Architecture and Challenges · ICDM 2001
Web and social media mining
web mining
0.122001
Mining e-commerce data: the good, the bad, and the ugly · KDD 2001
Web mining for e-commerce (workshop session - title only) · KDD 2000
Data mining › predictive modeling
classification
0.021998
Targeting Business Users with Decision Table Classifiers · KDD 1998
Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid · KDD 1996
Machine learning › Kernel, tree and ensemble methods
decision tree
0.021997
Option Decision Trees with Majority Votes · ICML 1997
Oblivious Decision Trees, Graphs, and Top-Down Pruning · IJCAI 1995
Data mining › pattern mining
association rule mining
0.012001
Real world performance of association rule algorithms · KDD 2001
Data mining › pattern mining › itemset mining
frequent itemset mining
0.012001
Real world performance of association rule algorithms · KDD 2001
Data mining
pattern mining
0.012001
Real world performance of association rule algorithms · KDD 2001
Web and social media mining › web usage mining
web server log mining
0.012001
Mining e-commerce data: the good, the bad, and the ugly · KDD 2001
Machine learning › Trustworthy machine learning
accuracy estimation
0.021998
The Case against Accuracy Estimation for Comparing Induction Algorithms · ICML 1998
A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection · IJCAI 1995
Data integration and cleaning
data preprocessing
0.022001
Supervised and Unsupervised Discretization of Continuous Features · ICML 1995
Integrating E-Commerce and Data Mining: Architecture and Challenges · ICDM 2001
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.011997
Option Decision Trees with Majority Votes · ICML 1997
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
feature selection
0.011997
Wrappers for Feature Subset Selection · Artif. Intell. 1997
Machine learning › Kernel, tree and ensemble methods › ensemble learning
majority voting
0.011997
Option Decision Trees with Majority Votes · ICML 1997
Data mining
data mining system
0.011997
MineSet: An Integrated System for Data Mining · KDD 1997
Machine learning › Learning theory › statistical learning theory
bias-variance tradeoff
0.011996
Bias Plus Variance Decomposition for Zero-One Loss Functions · ICML 1996
Data integration and cleaning › data preprocessing
discretization
0.011996
Error-Based and Entropy-Based Discretization of Continuous Features · KDD 1996
Data mining › feature engineering
entropy-based discretization
0.011996
Error-Based and Entropy-Based Discretization of Continuous Features · KDD 1996
Data mining › predictive modeling › classification
naive bayes
0.011996
Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid · KDD 1996
Machine learning › Optimization for machine learning
hyperparameter optimization
0.011995
Automatic Parameter Selection by Minimizing Estimated Error · ICML 1995
Machine learning › Learning theory
model selection
0.011995
A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection · IJCAI 1995
Machine learning › Learning theory › model selection
parameter selection
0.011995
Automatic Parameter Selection by Minimizing Estimated Error · ICML 1995
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

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

statistical analysis · 1.5sequential group testing · 1.5controlled experiment · 1.4statistical reasoning · 1.1a/b/n tests · 0.4alerting · 0.3root cause analysis · 0.3randomized experiment · 0.2pre-experiment covariate adjustment · 0.2CUPED · 0.2data mining · 0.1statistical power analysis · 0.1hashing · 0.1factorial design · 0.1visualization · 0.0performance comparison · 0.0heuristics · 0.0benchmarking · 0.0
YearPublicationVenuePosition
2024 False Positives in A/B Tests
abstract
A/B tests, or online controlled experiments, are used heavily in the software industry to evaluate implementations of ideas, as the paradigm is the gold standard in science for establishing causality: the changes introduced in the treatment caused the changes to the metrics of interest with high probability.What distinguishes software experiments, or A/B tests, from experiments in many other domains is the scale (e.g., over 100 experiment treatments may launch on a given workday in large companies) and the effect sizes that matter to the business are small (e.g., a 3% improvement to conversion rate from a single experiment is a cause for celebration).The humbling reality is that most experiments fail to improve key metrics, and success rates of only about 10-20% are most common.With low success rates, the industry standard alpha threshold of 0.05 implies a high probability of false positives.We begin with motivation about why false positives are expensive in many software domains.We then offer several approaches to estimate the true success rate of experiments, given the observed "win" rate (statistically significant positive improvements), and show examples from Expedia and Optimizely.We offer a modified procedure for experimentation, based in sequential group testing, that selectively extends experiments to reduce false positives, increase power, at a small increase to runtime.We conclude with a discussion of the difference between ideas and experiments in practice, terms that are often incorrectly used interchangeably. CCS CONCEPTS General and Reference →
Ron Kohavi, Nanyu Chen
KDD1
2022 A/B Testing Intuition Busters: Common Misunderstandings in Online Controlled Experiments
abstract
A/B tests, or online controlled experiments, are heavily used in industry to evaluate implementations of ideas. While the statistics behind controlled experiments are well documented and some basic pitfalls known, we have observed some seemingly intuitive concepts being touted, including by A/B tool vendors and agencies, which are misleading, often badly so. Our goal is to describe these misunderstandings, the "intuition" behind them, and to explain and bust that intuition with solid statistical reasoning. We provide recommendations that experimentation platform designers can implement to make it harder for experimenters to make these intuitive mistakes.
Ron Kohavi, Alex Deng, Lukas Vermeer
KDD1
2017 A/B Testing at Scale: Accelerating Software Innovation
abstract
The Internet provides developers of connected software, including web sites, applications, and devices, an unprecedented opportunity to accelerate innovation by evaluating ideas quickly and accurately using controlled experiments, also known as A/B tests. From front-end user-interface changes to backend algorithms, from search engines (e.g., Google, Bing, Yahoo!) to retailers (e.g., Amazon, eBay, Etsy) to social networking services (e.g., Facebook, LinkedIn, Twitter) to travel services (e.g., Expedia, Airbnb, Booking.com) to many startups, online controlled experiments are now utilized to make data-driven decisions at a wide range of companies. While the theory of a controlled experiment is simple, and dates back to Sir Ronald A. Fisher's experiments at the Rothamsted Agricultural Experimental Station in England in the 1920s, the deployment and evaluation of online controlled experiments at scale (100's of concurrently running experiments) across variety of web sites, mobile apps, and desktop applications presents many pitfalls and new research challenges. In this tutorial we will give an introduction to A/B testing, share key lessons learned from scaling experimentation at Bing to thousands of experiments per year, present real examples, and outline promising directions for future work. The tutorial will go beyond applications of A/B testing in information retrieval and will also discuss on practical and research challenges arising in experimentation on web sites and mobile and desktop apps. Our goal in this tutorial is to teach attendees how to scale experimentation for their teams, products, and companies, leading to better data-driven decisions. We also want to inspire more academic research in the relatively new and rapidly evolving field of online controlled experimentation.
Alex Deng, Pavel A. Dmitriev, Somit Gupta, Ron Kohavi, Paul Raff, Lukas Vermeer
SIGIR4
2016 Pitfalls of long-term online controlled experiments
abstract
Online controlled experiments (e.g., A/B tests) are now regularly used to guide product development and accelerate innovation in software. Product ideas are evaluated as scientific hypotheses, and tested on web sites, mobile applications, desktop applications, services, and operating system features. One of the key challenges for organizations that run controlled experiments is to select an Overall Evaluation Criterion (OEC), i.e., the criterion by which to evaluate the different variants. The difficulty is that short-term changes to metrics may not predict the long-term impact of a change. For example, raising prices likely increases short-term revenue but also likely reduces long-term revenue (customer lifetime value) as users abandon. Degrading search results in a Search Engine causes users to search more, thus increasing query share short-term, but increasing abandonment and thus reducing longterm customer lifetime value. Ideally, an OEC is based on metrics in a short-term experiment that are good predictors of long-term value. To assess long-term impact, one approach is to run longterm controlled experiments and assume that long-term effects are represented by observed metrics. In this paper we share several examples of long-term experiments and the pitfalls associated with running them. We discuss cookie stability, survivorship bias, selection bias, and perceived trends, and share methodologies that can be used to partially address some of these issues. While there is clearly value in evaluating long-term trends, experimenters running long-term experiments must be cautious, as results may be due to the above pitfalls more than the true delta between the Treatment and Control. We hope our real examples and analyses will sensitize readers to the issues and encourage the development of new methodologies for this important problem.
Pavel A. Dmitriev, Brian Frasca, Somit Gupta, Ron Kohavi, Garnet Jason Vaz
IEEE BigData4
2015 Online Controlled Experiments: Lessons from Running A/B/n Tests for 12 Years
abstract
The Internet provides developers of connected software, including web sites, applications, and devices, an unprecedented opportunity to accelerate innovation by evaluating ideas quickly and accurately using trustworthy controlled experiments (e.g., A/B tests and their generalizations). From front-end user-interface changes to backend recommendation systems and relevance algorithms, from search engines (e.g., Google, Microsoft's Bing, Yahoo) to retailers (e.g., Amazon, eBay, Netflix, Etsy) to social networking services (e.g., Facebook, LinkedIn, Twitter) to Travel services (e.g., Expedia, Airbnb, Booking.com) to many startups, online controlled experiments are now utilized to make data-driven decisions at a wide range of companies. While the theory of a controlled experiment is simple, and dates back to Sir Ronald A. Fisher's experiments at the Rothamsted Agricultural Experimental Station in England in the 1920s, the deployment and mining of online controlled experiments at scale (e.g., hundreds of experiments run every day at Bing) and deployment of online controlled experiments across dozens of web sites and applications has taught us many lessons. We provide an introduction, share real examples, key lessons, and cultural challenges.
Ron Kohavi
KDD1
2014 Seven rules of thumb for web site experimenters
abstract
Web site owners, from small web sites to the largest properties that include Amazon, Facebook, Google, LinkedIn, Microsoft, and Yahoo, attempt to improve their web sites, optimizing for criteria ranging from repeat usage, time on site, to revenue. Having been involved in running thousands of controlled experiments at Amazon, Booking.com, LinkedIn, and multiple Microsoft properties, we share seven rules of thumb for experimenters, which we have generalized from these experiments and their results. These are principles that we believe have broad applicability in web optimization and analytics outside of controlled experiments, yet they are not provably correct, and in some cases exceptions are known.
Ron Kohavi, Alex Deng, Roger Longbotham, Ya Xu
KDD1
2013 Online controlled experiments at large scale
abstract
Web-facing companies, including Amazon, eBay, Etsy, Facebook, Google, Groupon, Intuit, LinkedIn, Microsoft, Netflix, Shop Direct, StumbleUpon, Yahoo, and Zynga use online controlled experiments to guide product development and accelerate innovation. At Microsoft's Bing, the use of controlled experiments has grown exponentially over time, with over 200 concurrent experiments now running on any given day. Running experiments at large scale requires addressing multiple challenges in three areas: cultural/organizational, engineering, and trustworthiness. On the cultural and organizational front, the larger organization needs to learn the reasons for running controlled experiments and the tradeoffs between controlled experiments and other methods of evaluating ideas. We discuss why negative experiments, which degrade the user experience short term, should be run, given the learning value and long-term benefits. On the engineering side, we architected a highly scalable system, able to handle data at massive scale: hundreds of concurrent experiments, each containing millions of users. Classical testing and debugging techniques no longer apply when there are billions of live variants of the site, so alerts are used to identify issues rather than relying on heavy up-front testing. On the trustworthiness front, we have a high occurrence of false positives that we address, and we alert experimenters to statistical interactions between experiments. The Bing Experimentation System is credited with having accelerated innovation and increased annual revenues by hundreds of millions of dollars, by allowing us to find and focus on key ideas evaluated through thousands of controlled experiments. A 1% improvement to revenue equals more than $10M annually in the US, yet many ideas impact key metrics by 1% and are not well estimated a-priori. The system has also identified many negative features that we avoided deploying, despite key stakeholders' early excitement, saving us similar large amounts.
Ron Kohavi, Alex Deng, Brian Frasca, Toby Walker, Ya Xu, Nils Pohlmann
KDD1
2013 Improving the sensitivity of online controlled experiments by utilizing pre-experiment data
abstract
Online controlled experiments are at the heart of making data-driven decisions at a diverse set of companies, including Amazon, eBay, Facebook, Google, Microsoft, Yahoo, and Zynga. Small differences in key metrics, on the order of fractions of a percent, may have very significant business implications. At Bing it is not uncommon to see experiments that impact annual revenue by millions of dollars, even tens of millions of dollars, either positively or negatively. With thousands of experiments being run annually, improving the sensitivity of experiments allows for more precise assessment of value, or equivalently running the experiments on smaller populations (supporting more experiments) or for shorter durations (improving the feedback cycle and agility). We propose an approach (CUPED) that utilizes data from the pre-experiment period to reduce metric variability and hence achieve better sensitivity. This technique is applicable to a wide variety of key business metrics, and it is practical and easy to implement. The results on Bing's experimentation system are very successful: we can reduce variance by about 50%, effectively achieving the same statistical power with only half of the users, or half the duration.
Alex Deng, Ya Xu, Ron Kohavi, Toby Walker
WSDM3
2012 Trustworthy online controlled experiments: five puzzling outcomes explained
abstract
Online controlled experiments are often utilized to make data-driven decisions at Amazon, Microsoft, eBay, Facebook, Google, Yahoo, Zynga, and at many other companies. While the theory of a controlled experiment is simple, and dates back to Sir Ronald A. Fisher's experiments at the Rothamsted Agricultural Experimental Station in England in the 1920s, the deployment and mining of online controlled experiments at scale--thousands of experiments now--has taught us many lessons. These exemplify the proverb that the difference between theory and practice is greater in practice than in theory. We present our learnings as they happened: puzzling outcomes of controlled experiments that we analyzed deeply to understand and explain. Each of these took multiple-person weeks to months to properly analyze and get to the often surprising root cause. The root causes behind these puzzling results are not isolated incidents; these issues generalized to multiple experiments. The heightened awareness should help readers increase the trustworthiness of the results coming out of controlled experiments. At Microsoft's Bing, it is not uncommon to see experiments that impact annual revenue by millions of dollars, thus getting trustworthy results is critical and investing in understanding anomalies has tremendous payoff: reversing a single incorrect decision based on the results of an experiment can fund a whole team of analysts. The topics we cover include: the OEC (Overall Evaluation Criterion), click tracking, effect trends, experiment length and power, and carryover effects.
Ron Kohavi, Alex Deng, Brian Frasca, Roger Longbotham, Toby Walker, Ya Xu
KDD1
2012 Online controlled experiments: introduction, learnings, and humbling statistics
abstract
The web provides an unprecedented opportunity to accelerate innovation by evaluating ideas quickly and accurately using controlled experiments (e.g., A/B tests and their generalizations). Whether for front-end user-interface changes, or backend recommendation systems and relevance algorithms, online controlled experiments are now utilized to make data-driven decisions at Amazon, Microsoft, eBay, Facebook, Google, Yahoo, Zynga, and at many other companies. While the theory of a controlled experiment is simple, and dates back to Sir Ronald A. Fisher's experiments at the Rothamsted Agricultural Experimental Station in England in the 1920s, the deployment and mining of online controlled experiments at scale--thousands of experiments now--has taught us many lessons. We provide an introduction, share real examples, key learnings, cultural challenges, and humbling statistics.
Ron Kohavi
RecSys1
2009 Seven pitfalls to avoid when running controlled experiments on the web
abstract
Controlled experiments, also called randomized experiments and A/B tests, have had a profound influence on multiple fields, including medicine, agriculture, manufacturing, and advertising. While the theoretical aspects of offline controlled experiments have been well studied and documented, the practical aspects of running them in online settings, such as web sites and services, are still being developed. As the usage of controlled experiments grows in these online settings, it is becoming more important to understand the opportunities and pitfalls one might face when using them in practice. A survey of online controlled experiments and lessons learned were previously documented in Controlled Experiments on the Web: Survey and Practical Guide (Kohavi, et al., 2009). In this follow-on paper, we focus on pitfalls we have seen after running numerous experiments at Microsoft. The pitfalls include a wide range of topics, such as assuming that common statistical formulas used to calculate standard deviation and statistical power can be applied and ignoring robots in analysis (a problem unique to online settings). Online experiments allow for techniques like gradual ramp-up of treatments to avoid the possibility of exposing many customers to a bad (e.g., buggy) Treatment. With that ability, we discovered that it's easy to incorrectly identify the winning Treatment because of Simpson's paradox.
Thomas Crook, Brian Frasca, Ron Kohavi, Roger Longbotham
KDD3
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.1
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
KDD1
2005 Focus the Mining Beacon: Lessons and Challenges from the World of E-Commerce
Ron Kohavi
PKDD1
2004 Visualizing RFM Segmentation
abstract
Segmentation based on RFM (Recency, Frequency, and Monetary) has been used for over 50 years by direct marketers to target a subset of their customers, save mailing costs, and improve profits. RFM analysis is commonly performed using the Arthur Hughes method, which bins each of the three RFM attributes independently into five equal frequency bins. The resulting 125 cells are depicted in a tabular format or as bar graphs and analyzed by marketers, who determine the best cells (customer segments) to target. We propose an interactive visualization of RFM that helps marketers visualize and quickly identify important customer segments. Additionally, we show an integrated filtering approach that allows marketers to interactively explore the RFM segments in relation to other customer attributes, such as behavioral or demographic, to identify interesting sub-segments in the customer base. We depict these RFM visualizations on two large real-world data sets and discuss how customers have used these visualizations in practice to glean interesting insights from their data. Given, the widespread use of RFM as a critical, and many times the only, segmentation tool, we believe that the proposed intuitive and interactive visualization will provide significant business value.
Ron Kohavi, Rajesh Parekh
SDM1
2004 Lessons and Challenges from Mining Retail E-Commerce Data
Ron Kohavi, Llew Mason, Rajesh Parekh, Zijian Zheng 0002
Mach. Learn.1
2002 Web Mining
Ron Kohavi, Brij M. Masand, Myra Spiliopoulou, Jaideep Srivastava
Data Min. Knowl. Discov.1
2001 Integrating E-Commerce and Data Mining: Architecture and Challenges
abstract
We show that the e-commerce domain can provide all the right ingredients for successful data mining. We describe an integrated architecture for supporting this integration. The architecture can dramatically reduce the pre-processing, cleaning, and data understanding effort often documented to take 80% of the time in knowledge discovery projects. We emphasize the need for data collection at the application server layer (not the Web server) in order to support logging of data and metadata that is essential to the discovery process. We describe the data transformation bridges required from the transaction processing systems and customer event streams (e.g., clickstreams) to the data warehouse. We detail the mining workbench, which needs to provide multiple views of the data through reporting, data mining algorithms, visualization, and OLAP. We conclude with a set of challenges.
Suhail Ansari, Ron Kohavi, Llew Mason, Zijian Zheng 0002
ICDM2
2001 Mining e-commerce data: the good, the bad, and the ugly
abstract
Organizations conducting Electronic Commerce (e-commerce) can greatly benefit from the insight that data mining of transactional and clickstream data provides. Such insight helps not only to improve the electronic channel (e.g., a web site), but it is also a learning vehicle for the bigger organization conducting business at brick-and-mortar stores. The e-commerce site serves as an early alert system for emerging patterns and a laboratory for experimentation. For successful data mining, several ingredients are needed and e-commerce provides all the right ones (the Good). Web server logs, which are commonly used as the source of data for mining e-commerce data, were designed to debug web servers, and the data they provide is insufficient, requiring the use of heuristics to reconstruct events. Moreover, many events are never logged in web server logs, limiting the source of data for mining (the Bad). Many of the problems of dealing with web server log data can be resolved by properly architecting the e-commerce sites to generate data needed for mining. Even with a good architecture, however, there are challenging problems that remain hard to solve (the Ugly). Lessons and metrics based on mining real e-commerce data are presented.
Ron Kohavi
KDD1
2001 Real world performance of association rule algorithms
abstract
This study compares five well-known association rule algorithms using three real-world datasets and an artificial dataset. The experimental results confirm the performance improvements previously claimed by the authors on the artificial data, but some of these gains do not carry over to the real datasets, indicating overfitting of the algorithms to the IBM artificial dataset. More importantly, we found that the choice of algorithm only matters at support levels that generate more rules than would be useful in practice. For support levels that generate less than 1,000,000 rules, which is much more than humans can handle and is sufficient for prediction purposes where data is loaded into RAM, Apriori finishes processing in less than 10 minutes. On our datasets, we observed super-exponential growth in the number of rules. On one of our datasets, a 0.02% change in the support increased the number of rules from less than a million to over a billion, implying that outside a very narrow range of support values, the choice of algorithm is irrelevant.
Zijian Zheng 0002, Ron Kohavi, Llew Mason
KDD2
2001 Mining E-Commerce Data: The Good, the Bad, and the Ugly
Ron Kohavi
PAKDD1
2001 Applications of Data Mining to Electronic Commerce
Ron Kohavi, Foster J. Provost
Data Min. Knowl. Discov.1
2000 Web mining for e-commerce (workshop session - title only)
abstract
No abstract available.
Ron Kohavi, Myra Spiliopoulou, Jaideep Srivastava
KDD1
1999 An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Eric Bauer, Ron Kohavi
Mach. Learn.2
1998 Pruning Decision Trees with Misclassification Costs
Jeffrey P. Bradford, Clayton Kunz, Ron Kohavi, Clifford Brunk, Carla E. Brodley
ECML3
1998 The Case against Accuracy Estimation for Comparing Induction Algorithms
Foster J. Provost, Tom Fawcett, Ron Kohavi
ICML3
1998 Targeting Business Users with Decision Table Classifiers
Ron Kohavi, Dan Sommerfield
KDD1
1998 Guest Editors' Introduction: On Applied Research in Machine Learning
Foster J. Provost, Ron Kohavi
Mach. Learn.2
1997 Option Decision Trees with Majority Votes
Ron Kohavi, Clayton Kunz
ICML1
1997 MineSet: An Integrated System for Data Mining
Clifford Brunk, James Kelly, Ron Kohavi
KDD3
1997 Wrappers for Feature Subset Selection
Ron Kohavi, George H. John
Artif. Intell.1
1996 Bias Plus Variance Decomposition for Zero-One Loss Functions
Ron Kohavi, David H. Wolpert
ICML1
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
ICTAI1
1996 Scaling Up the Accuracy of Naive-Bayes Classifiers: A Decision-Tree Hybrid
Ron Kohavi
KDD1
1996 Error-Based and Entropy-Based Discretization of Continuous Features
Ron Kohavi, Mehran Sahami
KDD1
1996 Book Review: Empirical Methods for Artificial Intelligence
Ron Kohavi
Int. J. Neural Syst.1
1995 The Power of Decision Tables
Ron Kohavi
ECML1
1995 Supervised and Unsupervised Discretization of Continuous Features
James Dougherty, Ron Kohavi, Mehran Sahami
ICML2
1995 Automatic Parameter Selection by Minimizing Estimated Error
Ron Kohavi, George H. John
ICML1
1995 A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
Ron Kohavi
IJCAI1
1995 Oblivious Decision Trees, Graphs, and Top-Down Pruning
Ron Kohavi, Chia-Hsin Li
IJCAI1
1995 Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
Ron Kohavi, Dan Sommerfield
KDD1
1994 Bottom-Up Induction of Oblivious Read-Once Decision Graphs: Strengths and Limitations
Ron Kohavi
AAAI1
1994 Bottom-Up Induction of Oblivious Read-Once Decision Graphs
Ron Kohavi
ECML1
1994 Irrelevant Features and the Subset Selection Problem
George H. John, Ron Kohavi, Karl Pfleger
ICML2
1994 MLC++: A Machine Learning Library in C++
abstract
We present MLC++, a library of C++ classes and tools for supervised machine learning. While MLC++ provides general learning algorithms that can be used by end users, the main objective is to provide researchers and experts with a wide variety of tools that can accelerate algorithm development, increase software reliability, provide comparison tools, and display information visually. More than just a collection of existing algorithms, MLC++ is can attempt to extract commonalities of algorithms and decompose them for a unified view that is simple, coherent, and extensible. In this paper we discuss the problems MLC++ aims to solve, the design of MLC++, and the current functionality.>
Ron Kohavi, George H. John, Richard Long, David Manley, Karl Pfleger
ICTAI1
1993 Research Note on Decision Lists
Ron Kohavi, Scott Benson
Mach. Learn.1