{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T09:51:29Z","timestamp":1762077089828,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BDCC"],"abstract":"<jats:p>Large retail companies routinely gather huge amounts of customer data, which are to be analyzed at a low granularity. To enable this analysis, several Key Performance Indicators (KPIs), acquired for each customer through different channels are associated to the main drivers of the customer experience. Analyzing the samples of customer behavior only through parameters such as average and variance does not cope with the growing heterogeneity of customers. In this paper, we propose a different approach in which the samples from customer surveys are represented as discrete probability distributions whose similarities can be assessed by different models. The focus is on the Wasserstein distance, which is generally well defined, even when other distributional distances are not, and it provides an interpretable distance metric between distributions. The support of the distributions can be both one- and multi-dimensional, allowing for the joint consideration of several KPIs for each store, leading to a multi-variate histogram. Moreover, the Wasserstein barycenter offers a useful synthesis of a set of distributions and can be used as a reference distribution to characterize and classify behavioral patterns. Experimental results of real data show the effectiveness of the Wasserstein distance in providing global performance measures.<\/jats:p>","DOI":"10.3390\/bdcc6040138","type":"journal-article","created":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T02:24:53Z","timestamp":1668565493000},"page":"138","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The \u201cUnreasonable\u201d Effectiveness of the Wasserstein Distance in Analyzing Key Performance Indicators of a Network of Stores"],"prefix":"10.3390","volume":"6","author":[{"given":"Andrea","family":"Ponti","sequence":"first","affiliation":[{"name":"Oaks S.R.L., 20125 Milan, Italy"},{"name":"Department of Economics, Management and Statistics, University of Milano-Bicocca, 20126 Bicocca, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilaria","family":"Giordani","sequence":"additional","affiliation":[{"name":"Oaks S.R.L., 20125 Milan, Italy"},{"name":"Department of Computer Science, Systems and Communication, University of Milano-Bicocca, 20126 Bicocca, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Mistri","sequence":"additional","affiliation":[{"name":"Oaks S.R.L., 20125 Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Candelieri","sequence":"additional","affiliation":[{"name":"Department of Economics, Management and Statistics, University of Milano-Bicocca, 20126 Bicocca, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Archetti","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Systems and Communication, University of Milano-Bicocca, 20126 Bicocca, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"key":"ref_1","first-page":"46","article-title":"The One Number You Need to Grow","volume":"81","author":"Reichheld","year":"2003","journal-title":"Harv. Bus. Rev."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Fisher, N.I. (2013). Analytics for Leaders. A Performance Measurement System for Business Success, Cambridge University Press. [1st ed.].","DOI":"10.1017\/CBO9781107053779"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1111\/rssa.12424","article-title":"A Comprehensive Approach to Problems of Performance Measurement","volume":"182","author":"Fisher","year":"2019","journal-title":"J. R. Stat. Soc. Ser. A Stat. Soc."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s11747-021-00790-2","article-title":"The Use of Net Promoter Score (NPS) to Predict Sales Growth: Insights from an Empirical Investigation","volume":"50","author":"Baehre","year":"2022","journal-title":"J. Acad. Mark. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Markoulidakis, I., Rallis, I., Georgoulas, I., Kopsiaftis, G., Doulamis, A., and Doulamis, N. (2020). A Machine Learning Based Classification Method for Customer Experience Survey Analysis. Technologies, 8.","DOI":"10.3390\/technologies8040076"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Markoulidakis, I., Rallis, I., Georgoulas, I., Kopsiaftis, G., Doulamis, A., and Doulamis, N. (2021). Multiclass Confusion Matrix Reduction Method and Its Application on Net Promoter Score Classification Problem. Technologies, 9.","DOI":"10.3390\/technologies9040081"},{"key":"ref_7","unstructured":"Monge, G. (1781). M\u00e9moire Sur La Th\u00e9orie Des D\u00e9blais et Des Remblais. Histoire de l\u2019Acad\u00e9mie Royale des Sciences de Paris, Nabu Press."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.5.1.1","article-title":"On the Translocation of Masses","volume":"5","author":"Kantorovitch","year":"1958","journal-title":"Manag. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"71-1","DOI":"10.1145\/2897824.2925918","article-title":"Wasserstein Barycentric Coordinates: Histogram Regression Using Optimal Transport","volume":"35","author":"Bonneel","year":"2016","journal-title":"ACM Trans. Graph."},{"key":"ref_10","unstructured":"Huang, G., Quo, C., Kusner, M.J., Sun, Y., Weinberger, K.Q., and Sha, F. (2016, January 5\u201310). Supervised Word Mover\u2019s Distance. Proceedings of the 30th International Conference on Neural Information Processing Systems, Barcelona, Spain."},{"key":"ref_11","unstructured":"Arjovsky, M., Chintala, S., and Bottou, L. (2017, January 6\u201311). Wasserstein Generative Adversarial Networks. Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Villani, C. (2008). Optimal Transport: Old and New, Springer.","DOI":"10.1007\/978-3-540-71050-9"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1561\/2200000073","article-title":"Computational Optimal Transport","volume":"11","author":"Cuturi","year":"2019","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Panaretos, V.M., and Zemel, Y. (2020). An Invitation to Statistics in Wasserstein Space, Springer.","DOI":"10.1007\/978-3-030-38438-8"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/proc\/202068001","article-title":"Statistical Data Analysis in the Wasserstein Space","volume":"68","author":"Bigot","year":"2020","journal-title":"ESAIM Proc. Surv."},{"key":"ref_16","unstructured":"Cohen, S., Arbel, M., and Deisenroth, M.P. (2020). Estimating Barycenters of Measures in High Dimensions. arXiv."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"5088","DOI":"10.1214\/19-EJS1639","article-title":"Hybrid Wasserstein Distance and Fast Distribution Clustering","volume":"13","author":"Verdinelli","year":"2019","journal-title":"Electron. J. Stat."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Galichon, A. (2018). Optimal Transport Methods in Economics, Princeton University Press.","DOI":"10.1515\/9781400883592"},{"key":"ref_19","unstructured":"Galichon, A. (2021). The Unreasonable Effectiveness of Optimal Transport in Economics. arXiv."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Kiesel, R., R\u00fchlicke, R., Stahl, G., and Zheng, J. (2016). The Wasserstein Metric and Robustness in Risk Management. Risks, 4.","DOI":"10.3390\/risks4030032"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/s00780-020-00426-3","article-title":"Adapted Wasserstein Distances and Stability in Mathematical Finance","volume":"24","author":"Bartl","year":"2020","journal-title":"Financ. Stoch."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Horvath, B., Issa, Z., and Muguruza, A. (2021). Clustering Market Regimes Using the Wasserstein Distance. arXiv.","DOI":"10.2139\/ssrn.3947905"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Kuhn, D., Esfahani, P.M., Nguyen, V.A., and Shafieezadeh-Abadeh, S. (2019). Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning. arXiv.","DOI":"10.1287\/educ.2019.0198"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","article-title":"Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations","volume":"171","author":"Kuhn","year":"2018","journal-title":"Math. Program."},{"key":"ref_25","unstructured":"Lau, T.T.-K., and Liu, H. (2022). Wasserstein Distributionally Robust Optimization via Wasserstein Barycenters. arXiv."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Chen, Z., Kuhn, D., and Wiesemann, W. (2022). Data-Driven Chance Constrained Programs over Wasserstein Balls. Oper. Res.","DOI":"10.1016\/j.orl.2023.02.008"},{"key":"ref_27","unstructured":"Xie, W. (2019). Tractable Reformulations of Distributionally Robust Two-Stage Stochastic Programs With\u221e- Wasserstein Distance. arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Ma, C., Ma, L., Zhang, Y., Tang, R., Liu, X., and Coates, M. (2020, January 6\u201310). Probabilistic Metric Learning with Adaptive Margin for Top-K Recommendation. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Virtual Event.","DOI":"10.1145\/3394486.3403147"},{"key":"ref_29","unstructured":"Rakotomamonjy, A., Traor\u00e9, A., Berar, M., Flamary, R., and Courty, N. (2018). Distance Measure Machines. arXiv."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10994-014-5446-z","article-title":"Adaptive Euclidean Maps for Histograms: Generalized Aitchison Embeddings","volume":"99","author":"Le","year":"2015","journal-title":"Mach. Learn."}],"container-title":["Big Data and Cognitive Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-2289\/6\/4\/138\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:18:46Z","timestamp":1760145526000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-2289\/6\/4\/138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,15]]},"references-count":30,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["bdcc6040138"],"URL":"https:\/\/doi.org\/10.3390\/bdcc6040138","relation":{},"ISSN":["2504-2289"],"issn-type":[{"type":"electronic","value":"2504-2289"}],"subject":[],"published":{"date-parts":[[2022,11,15]]}}}