Skip to main content

2020 | OriginalPaper | Buchkapitel

Enabling Decision Support Through Ranking and Summarization of Association Rules for TOTAL Customers

verfasst von : Idir Benouaret, Sihem Amer-Yahia, Senjuti Basu Roy, Christiane Kamdem-Kengne, Jalil Chagraoui

Erschienen in: Transactions on Large-Scale Data- and Knowledge-Centered Systems XLIV

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Our focus in this experimental analysis paper is to investigate existing measures that are available to rank association rules and understand how they can be augmented further to enable real-world decision support as well as providing customers with personalized recommendations. For example, by analyzing receipts of TOTAL customers, one can find that, customers who buy windshield wash, also buy engine oil and energy drinks or middle-aged customers from the South of France subscribe to a car wash program. Such actionable insights can immediately guide business decision making, e.g., for product promotion, product recommendation or targeted advertising. We present an analysis of 30 million unique sales receipts, spanning 35 million records, by almost 1 million customers, generated at 3,463 gas stations, over three years. Our finding is that the 35 commonly used measures to rank association rules, such as Confidence and Piatetsky-Shapiro, can be summarized into 5 synthesized clusters based on similarity in their rankings. We then use one representative measure in each cluster to run a user study with a data scientist and a product manager at TOTAL. Our analysis draws actionable insights to enable decision support for TOTAL decision makers: rules that favor Confidence are best to determine which products to recommend and rules that favor Recall are well-suited to find customer segments to target. Finally, we present how association rules using the representative measures can be used to provide customers with personalized product recommendations.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD, pp. 207–216 (1993) Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD, pp. 207–216 (1993)
2.
Zurück zum Zitat Belohlavek, R., Grissa, D., Guillaume, S., Nguifo, E.M., Outrata, J.: Boolean factors as a means of clustering of interestingness measures of association rules. Ann. Math. Artif. Intell. 70(1–2), 151–184 (2014)MathSciNetCrossRef Belohlavek, R., Grissa, D., Guillaume, S., Nguifo, E.M., Outrata, J.: Boolean factors as a means of clustering of interestingness measures of association rules. Ann. Math. Artif. Intell. 70(1–2), 151–184 (2014)MathSciNetCrossRef
3.
Zurück zum Zitat Daniel, W.: Applied Nonparametric Statistics. Houghton Mifflin, Boston (1978)MATH Daniel, W.: Applied Nonparametric Statistics. Houghton Mifflin, Boston (1978)MATH
4.
Zurück zum Zitat Geng, L., Hamilton, H.J.: Interestingness measures for data mining: a survey. ACM Comput. Surv. 38(3), 9-es (2006)CrossRef Geng, L., Hamilton, H.J.: Interestingness measures for data mining: a survey. ACM Comput. Surv. 38(3), 9-es (2006)CrossRef
5.
Zurück zum Zitat Grissa, D.: Etude comportementale des mesures d’intérêt d’extraction de connaissances. Ph.D. thesis (2013) Grissa, D.: Etude comportementale des mesures d’intérêt d’extraction de connaissances. Ph.D. thesis (2013)
7.
Zurück zum Zitat Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. (TOIS) 22(1), 5–53 (2004)CrossRef Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. (TOIS) 22(1), 5–53 (2004)CrossRef
8.
Zurück zum Zitat Hu, Y., Koren, Y., Volinsky, C.: Collaborative filtering for implicit feedback datasets. In: 2008 Eighth IEEE International Conference on Data Mining, pp. 263–272. IEEE (2008) Hu, Y., Koren, Y., Volinsky, C.: Collaborative filtering for implicit feedback datasets. In: 2008 Eighth IEEE International Conference on Data Mining, pp. 263–272. IEEE (2008)
9.
Zurück zum Zitat Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20(4), 422–446 (2002)CrossRef Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20(4), 422–446 (2002)CrossRef
10.
Zurück zum Zitat Kendall, M.G.: A New Measure of Rank Correlation. Biometrika 30(1/2), 81–93 (1938)CrossRef Kendall, M.G.: A New Measure of Rank Correlation. Biometrika 30(1/2), 81–93 (1938)CrossRef
11.
Zurück zum Zitat Kim, C., Kim, J.: A recommendation algorithm using multi-level association rules. In: Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003), pp. 524–527. IEEE (2003) Kim, C., Kim, J.: A recommendation algorithm using multi-level association rules. In: Proceedings IEEE/WIC International Conference on Web Intelligence (WI 2003), pp. 524–527. IEEE (2003)
12.
Zurück zum Zitat Kirchgessner, M., Leroy, V., Amer-Yahia, S., Mishra, S.: Testing interestingness measures in practice: a large-scale analysis of buying patterns. In: 2016 IEEE International Conference on Data Science and Advanced Analytics, DSAA 2016, Montreal, QC, Canada, 17–19 October 2016, pp. 547–556. IEEE (2016). https://doi.org/10.1109/DSAA.2016.53 Kirchgessner, M., Leroy, V., Amer-Yahia, S., Mishra, S.: Testing interestingness measures in practice: a large-scale analysis of buying patterns. In: 2016 IEEE International Conference on Data Science and Advanced Analytics, DSAA 2016, Montreal, QC, Canada, 17–19 October 2016, pp. 547–556. IEEE (2016). https://​doi.​org/​10.​1109/​DSAA.​2016.​53
14.
Zurück zum Zitat Le, T.D., Lo, D.: Beyond support and confidence: exploring interestingness measures for rule-based specification mining. In: Proceedings of SANER, pp. 331–340 (2015) Le, T.D., Lo, D.: Beyond support and confidence: exploring interestingness measures for rule-based specification mining. In: Proceedings of SANER, pp. 331–340 (2015)
15.
Zurück zum Zitat Lenca, P., Vaillant, B., Meyer, P., Lallich, S.: Association rule interestingness measures: experimental and theoretical studies. In: Guillet, F.J., Hamilton, H.J. (eds.) Quality Measures in Data Mining. Studies in Computational Intelligence, vol. 43, pp. 51–76. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-44918-8_3CrossRef Lenca, P., Vaillant, B., Meyer, P., Lallich, S.: Association rule interestingness measures: experimental and theoretical studies. In: Guillet, F.J., Hamilton, H.J. (eds.) Quality Measures in Data Mining. Studies in Computational Intelligence, vol. 43, pp. 51–76. Springer, Heidelberg (2007). https://​doi.​org/​10.​1007/​978-3-540-44918-8_​3CrossRef
17.
Zurück zum Zitat Liu, G., et al.: Towards exploratory hypothesis testing and analysis. In: Proceedings of ICDE, pp. 745–756 (2011) Liu, G., et al.: Towards exploratory hypothesis testing and analysis. In: Proceedings of ICDE, pp. 745–756 (2011)
18.
Zurück zum Zitat Messaoud, R.B., Rabaséda, S.L., Boussaid, O., Missaoui, R.: Enhanced mining of association rules from data cubes. In: Proceedings of ACM 9th International Workshop on Data Warehousing and OLAP, DOLAP 2006, Arlington, Virginia, USA, 10 November 2006, pp. 11–18 (2006). https://doi.org/10.1145/1183512.1183517 Messaoud, R.B., Rabaséda, S.L., Boussaid, O., Missaoui, R.: Enhanced mining of association rules from data cubes. In: Proceedings of ACM 9th International Workshop on Data Warehousing and OLAP, DOLAP 2006, Arlington, Virginia, USA, 10 November 2006, pp. 11–18 (2006). https://​doi.​org/​10.​1145/​1183512.​1183517
19.
Zurück zum Zitat Minato, S., Uno, T., Tsuda, K., Terada, A., Sese, J.: A fast method of statistical assessment for combinatorial hypotheses based on frequent itemset enumeration. In: Calders, T., Esposito, F., Hüllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8725, pp. 422–436. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44851-9_27CrossRef Minato, S., Uno, T., Tsuda, K., Terada, A., Sese, J.: A fast method of statistical assessment for combinatorial hypotheses based on frequent itemset enumeration. In: Calders, T., Esposito, F., Hüllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8725, pp. 422–436. Springer, Heidelberg (2014). https://​doi.​org/​10.​1007/​978-3-662-44851-9_​27CrossRef
21.
Zurück zum Zitat Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proceedings of SIGMOD, pp. 21–30 (2000) Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proceedings of SIGMOD, pp. 21–30 (2000)
22.
Zurück zum Zitat Piatetsky-Shapiro, G.: Knowledge Discovery in Databases. AAI/MIT, Menlo Park (1991)MATH Piatetsky-Shapiro, G.: Knowledge Discovery in Databases. AAI/MIT, Menlo Park (1991)MATH
23.
Zurück zum Zitat Plantevit, M., Laurent, A., Teisseire, M.: OLAP-sequential mining: summarizing trends from historical multidimensional data using closed multidimensional sequential patterns. New Trends Data Warehouse. Data Anal. 3, 275 (2008) Plantevit, M., Laurent, A., Teisseire, M.: OLAP-sequential mining: summarizing trends from historical multidimensional data using closed multidimensional sequential patterns. New Trends Data Warehouse. Data Anal. 3, 275 (2008)
24.
Zurück zum Zitat Pradel, B., et al.: A case study in a recommender system based on purchase data. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 377–385. ACM (2011) Pradel, B., et al.: A case study in a recommender system based on purchase data. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 377–385. ACM (2011)
25.
Zurück zum Zitat Rendle, S., Freudenthaler, C., Gantner, Z., Schmidt-Thieme, L.: BPR: Bayesian personalized ranking from implicit feedback. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pp. 452–461. AUAI Press (2009) Rendle, S., Freudenthaler, C., Gantner, Z., Schmidt-Thieme, L.: BPR: Bayesian personalized ranking from implicit feedback. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pp. 452–461. AUAI Press (2009)
26.
Zurück zum Zitat Sarwar, B., Karypis, G., Konstan, J., Riedl, J., et al.: Analysis of recommendation algorithms for e-commerce. In: EC, pp. 158–167 (2000) Sarwar, B., Karypis, G., Konstan, J., Riedl, J., et al.: Analysis of recommendation algorithms for e-commerce. In: EC, pp. 158–167 (2000)
27.
Zurück zum Zitat Sokal, R.R., Michener, C.D.: A statistical method for evaluating systematic relationships. Univ. Kans. Sci. Bull. 38, 1409–1438 (1958) Sokal, R.R., Michener, C.D.: A statistical method for evaluating systematic relationships. Univ. Kans. Sci. Bull. 38, 1409–1438 (1958)
28.
Zurück zum Zitat Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining, 1st edn. W. W. Norton & Company, New York City (2007) Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining, 1st edn. W. W. Norton & Company, New York City (2007)
30.
Zurück zum Zitat Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: efficient mining algorithms for frequent/closed/maximal itemsets. In: Proceedings of ICDM Workshop FIMI (2004) Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: efficient mining algorithms for frequent/closed/maximal itemsets. In: Proceedings of ICDM Workshop FIMI (2004)
Metadaten
Titel
Enabling Decision Support Through Ranking and Summarization of Association Rules for TOTAL Customers
verfasst von
Idir Benouaret
Sihem Amer-Yahia
Senjuti Basu Roy
Christiane Kamdem-Kengne
Jalil Chagraoui
Copyright-Jahr
2020
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-662-62271-1_6