Moshe Unger, Pan Li, Sahana (Shahana) Sen, A. Tuzhilin
{"title":"不需要所有鸡蛋放在一个篮子里:从单个领域嵌入重构客户的复合嵌入","authors":"Moshe Unger, Pan Li, Sahana (Shahana) Sen, A. Tuzhilin","doi":"10.1145/3578710","DOIUrl":null,"url":null,"abstract":"Although building a 360-degree comprehensive view of a customer has been a long-standing goal in marketing, this challenge has not been successfully addressed in many marketing applications because fractured customer data stored across different “silos” are hard to integrate under “one roof” for several reasons. Instead of integrating customer data, in this article we propose to integrate several domain-specific partial customer views into one consolidated or composite customer profile using a Deep Learning-based method that is theoretically grounded in Kolmogorov’s Mapping Neural Network Existence Theorem. Furthermore, our method needs to securely access domain-specific or siloed customer data only once for building the initial customer embeddings. We conduct extensive studies on two industrial applications to demonstrate that our method effectively reconstructs stable composite customer embeddings that constitute strong approximations of the ground-truth composite embeddings obtained from integrating the siloed raw customer data. Moreover, we show that these data-security preserving reconstructed composite embeddings not only perform as well as the original ground-truth embeddings but significantly outperform partial embeddings and state-of-the-art baselines in recommendation and consumer preference prediction tasks.","PeriodicalId":45274,"journal":{"name":"ACM Transactions on Management Information Systems","volume":"14 1","pages":"1 - 30"},"PeriodicalIF":2.5000,"publicationDate":"2023-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Don’t Need All Eggs in One Basket: Reconstructing Composite Embeddings of Customers from Individual-Domain Embeddings\",\"authors\":\"Moshe Unger, Pan Li, Sahana (Shahana) Sen, A. Tuzhilin\",\"doi\":\"10.1145/3578710\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although building a 360-degree comprehensive view of a customer has been a long-standing goal in marketing, this challenge has not been successfully addressed in many marketing applications because fractured customer data stored across different “silos” are hard to integrate under “one roof” for several reasons. Instead of integrating customer data, in this article we propose to integrate several domain-specific partial customer views into one consolidated or composite customer profile using a Deep Learning-based method that is theoretically grounded in Kolmogorov’s Mapping Neural Network Existence Theorem. Furthermore, our method needs to securely access domain-specific or siloed customer data only once for building the initial customer embeddings. We conduct extensive studies on two industrial applications to demonstrate that our method effectively reconstructs stable composite customer embeddings that constitute strong approximations of the ground-truth composite embeddings obtained from integrating the siloed raw customer data. Moreover, we show that these data-security preserving reconstructed composite embeddings not only perform as well as the original ground-truth embeddings but significantly outperform partial embeddings and state-of-the-art baselines in recommendation and consumer preference prediction tasks.\",\"PeriodicalId\":45274,\"journal\":{\"name\":\"ACM Transactions on Management Information Systems\",\"volume\":\"14 1\",\"pages\":\"1 - 30\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2023-01-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Management Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3578710\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Management Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3578710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Don’t Need All Eggs in One Basket: Reconstructing Composite Embeddings of Customers from Individual-Domain Embeddings
Although building a 360-degree comprehensive view of a customer has been a long-standing goal in marketing, this challenge has not been successfully addressed in many marketing applications because fractured customer data stored across different “silos” are hard to integrate under “one roof” for several reasons. Instead of integrating customer data, in this article we propose to integrate several domain-specific partial customer views into one consolidated or composite customer profile using a Deep Learning-based method that is theoretically grounded in Kolmogorov’s Mapping Neural Network Existence Theorem. Furthermore, our method needs to securely access domain-specific or siloed customer data only once for building the initial customer embeddings. We conduct extensive studies on two industrial applications to demonstrate that our method effectively reconstructs stable composite customer embeddings that constitute strong approximations of the ground-truth composite embeddings obtained from integrating the siloed raw customer data. Moreover, we show that these data-security preserving reconstructed composite embeddings not only perform as well as the original ground-truth embeddings but significantly outperform partial embeddings and state-of-the-art baselines in recommendation and consumer preference prediction tasks.