Huiying Mao
Research Subjects
Research Interests
Huiying Mao has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Xinwei Deng
Department of Statistics, Virginia Tech, Blacksburg, USA
4 shared publications - Keyu Nie
Bay Inc 95125 San Jose CA
2 shared publications Sumin Shen
Department of Statistics, Virginia Tech, Blacksburg, Virginia, USA
2 shared publications- Sumin Shen
China Center of Excellence 201203 Shanghai
2 shared publications - Zili Chen
China Center of Excellence 201203 Shanghai
2 shared publications Chase N. Ginther
Department of Statistics, College of Science Virginia Tech Blacksburg VA USA
1 shared publication
Latest Publications
- Open Access
- 24 May 2023
- Published by New England Statistical Society in The New England Journal of Statistics in Data Science
- p. 415-425
Clustering-Based Imputation for Dropout Buyers in Large-Scale Online Experimentation
Publisher: New England Statistical Society, Journal: The New England Journal of Statistics in Data Science, Title: Clustering-Based Imputation for Dropout Buyers in Large-Scale Online Experimentation, Authors: Sumin Shen, Huiying Mao, Zezhong Zhang , In online experimentation, appropriate metrics (e.g., purchase) provide strong evidence to support hypotheses and enhance the decision-making process. However, incomplete metrics are frequently occurred in the online experimentation, making the available data to be much fewer than the planned online experiments (e.g., A/B testing). In this work, we introduce the concept of dropout buyers and categorize users with incomplete metric values into two groups: visitors and dropout buyers. For the analysis of incomplete metrics, we propose a clustering-based imputation method using k-nearest neighbors. Our proposed imputation method considers both the experiment-specific features and users’ activities along their shopping paths, allowing different imputation values for different users. To facilitate efficient imputation of large-scale data sets in online experimentation, the proposed method uses a combination of stratification and clustering. The performance of the proposed method is compared to several conventional methods in both simulation studies and a real online experiment at eBay.
- 24 May 2023
- Published by New England Statistical Society in The New England Journal of Statistics in Data Science
- p. 415-425
Open AccessClustering-Based Imputation for Dropout Buyers in Large-Scale Online Experimentation
Publisher: New England Statistical Society, Journal: The New England Journal of Statistics in Data Science, Title: Clustering-Based Imputation for Dropout Buyers in Large-Scale Online Experimentation, Authors: Sumin Shen, Huiying Mao, Zezhong Zhang , In online experimentation, appropriate metrics (e.g., purchase) provide strong evidence to support hypotheses and enhance the decision-making process. However, incomplete metrics are frequently occurred in the online experimentation, making the available data to be much fewer than the planned online experiments (e.g., A/B testing). In this work, we introduce the concept of dropout buyers and categorize users with incomplete metric values into two groups: visitors and dropout buyers. For the analysis of incomplete metrics, we propose a clustering-based imputation method using k-nearest neighbors. Our proposed imputation method considers both the experiment-specific features and users’ activities along their shopping paths, allowing different imputation values for different users. To facilitate efficient imputation of large-scale data sets in online experimentation, the proposed method uses a combination of stratification and clustering. The performance of the proposed method is compared to several conventional methods in both simulation studies and a real online experiment at eBay.
- Open Access
Clustering-based Imputation for Dropout Buyers in Large-scale Online Experimentation
In online experimentation, appropriate metrics (e.g., purchase) provide strong evidence to support hypotheses and enhance the decision-making process. However, incomplete metrics are frequently occurred in the online experimentation, making the available data to be much fewer than the planned online experiments (e.g., A/B testing). In this work, we introduce the concept of dropout buyers and categorize users with incomplete metric values into two groups: visitors and dropout buyers. For the analysis of incomplete metrics, we propose a clustering-based imputation method using $k$-nearest neighbors. Our proposed imputation method considers both the experiment-specific features and users' activities along their shopping paths, allowing different imputation values for different users. To facilitate efficient imputation of large-scale data sets in online experimentation, the proposed method uses a combination of stratification and clustering. The performance of the proposed method is compared to several conventional methods in both simulation studies and a real online experiment at eBay.
Open AccessClustering-based Imputation for Dropout Buyers in Large-scale Online Experimentation
In online experimentation, appropriate metrics (e.g., purchase) provide strong evidence to support hypotheses and enhance the decision-making process. However, incomplete metrics are frequently occurred in the online experimentation, making the available data to be much fewer than the planned online experiments (e.g., A/B testing). In this work, we introduce the concept of dropout buyers and categorize users with incomplete metric values into two groups: visitors and dropout buyers. For the analysis of incomplete metrics, we propose a clustering-based imputation method using $k$-nearest neighbors. Our proposed imputation method considers both the experiment-specific features and users' activities along their shopping paths, allowing different imputation values for different users. To facilitate efficient imputation of large-scale data sets in online experimentation, the proposed method uses a combination of stratification and clustering. The performance of the proposed method is compared to several conventional methods in both simulation studies and a real online experiment at eBay.
- 1 October 2019
- Published by Elsevier in Accident Analysis & Prevention
- Vol. 131, 112-121
Adjusting finite sample bias in traffic safety modeling
- 1 October 2019
- Published by Elsevier in Accident Analysis & Prevention
- Vol. 131, 112-121
Adjusting finite sample bias in traffic safety modeling
- 28 June 2019
- Published by Taylor & Francis in Quality Engineering
- Vol. 31 (3) , 516-521
Rejoinder
(2019). Rejoinder. Quality Engineering: Vol. 31, No. 3, pp. 516-521.
- 28 June 2019
- Published by Taylor & Francis in Quality Engineering
- Vol. 31 (3) , 516-521
Rejoinder
(2019). Rejoinder. Quality Engineering: Vol. 31, No. 3, pp. 516-521.
- Open Access
Adaptive Fraud Detection System Using Dynamic Risk Features
eCommerce transaction frauds keep changing rapidly. This is the major issue that prevents eCommerce merchants having a robust machine learning model for fraudulent transactions detection. The root cause of this problem is that rapid changing fraud patterns alters underlying data generating system and causes the performance deterioration for machine learning models. This phenomenon in statistical modeling is called "Concept Drift". To overcome this issue, we propose an approach which adds dynamic risk features as model inputs. Dynamic risk features are a set of features built on entity profile with fraud feedback. They are introduced to quantify the fluctuation of probability distribution of risk features from certain entity profile caused by concept drift. In this paper, we also illustrate why this strategy can successfully handle the effect of concept drift under statistical learning framework. We also validate our approach on multiple businesses in production and have verified that the proposed dynamic model has a superior ROC curve than a static model built on the same data and training parameters.
Open AccessAdaptive Fraud Detection System Using Dynamic Risk Features
eCommerce transaction frauds keep changing rapidly. This is the major issue that prevents eCommerce merchants having a robust machine learning model for fraudulent transactions detection. The root cause of this problem is that rapid changing fraud patterns alters underlying data generating system and causes the performance deterioration for machine learning models. This phenomenon in statistical modeling is called "Concept Drift". To overcome this issue, we propose an approach which adds dynamic risk features as model inputs. Dynamic risk features are a set of features built on entity profile with fraud feedback. They are introduced to quantify the fluctuation of probability distribution of risk features from certain entity profile caused by concept drift. In this paper, we also illustrate why this strategy can successfully handle the effect of concept drift under statistical learning framework. We also validate our approach on multiple businesses in production and have verified that the proposed dynamic model has a superior ROC curve than a static model built on the same data and training parameters.
- 4 October 2018
- Published by Taylor & Francis in Quality Engineering
- Vol. 31 (3) , 505-510
An EM-algorithm approach to open challenges on correlation of intermediate and final measurements
(2018). An EM-algorithm approach to open challenges on correlation of intermediate and final measurements. Quality Engineering. Ahead of Print.
- 4 October 2018
- Published by Taylor & Francis in Quality Engineering
- Vol. 31 (3) , 505-510
An EM-algorithm approach to open challenges on correlation of intermediate and final measurements
(2018). An EM-algorithm approach to open challenges on correlation of intermediate and final measurements. Quality Engineering. Ahead of Print.
- 24 June 2016
- Published by Wiley in Quality and Reliability Engineering International
- Vol. 33 (3) , 503-513
An Evaluation of Wheeler's Method for Monitoring the Rate of Rare Events
- 24 June 2016
- Published by Wiley in Quality and Reliability Engineering International
- Vol. 33 (3) , 503-513
An Evaluation of Wheeler's Method for Monitoring the Rate of Rare Events