WO2017131696A1 - Serveur de base de données pour prédire des ventes - Google Patents

Serveur de base de données pour prédire des ventes Download PDF

Info

Publication number
WO2017131696A1
WO2017131696A1 PCT/US2016/015345 US2016015345W WO2017131696A1 WO 2017131696 A1 WO2017131696 A1 WO 2017131696A1 US 2016015345 W US2016015345 W US 2016015345W WO 2017131696 A1 WO2017131696 A1 WO 2017131696A1
Authority
WO
WIPO (PCT)
Prior art keywords
classification model
data set
sale
factors
analysis
Prior art date
Application number
PCT/US2016/015345
Other languages
English (en)
Inventor
Choudur Lakshminarayan
John MARGAGLIONE
Tuan Anh PHAM
Original Assignee
Entit Software Llc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Entit Software Llc filed Critical Entit Software Llc
Priority to PCT/US2016/015345 priority Critical patent/WO2017131696A1/fr
Publication of WO2017131696A1 publication Critical patent/WO2017131696A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"

Definitions

  • Sales forecasting is a tool used by sales organizations. Currently, sales forecasting is done in the aggregate (e.g., what will the total sales be for the entire organization for a quarter, or the year). Aggregate sales forecasting may help predict an overall sales, but may not provide information about a specific sale. As a result, aggregate sales forecasting may not provide any information that can be actionable for sales person or the organization.
  • FIG. 1 is a block diagram of an example system of the present disclosure
  • FIG. 2 is a block diagram of an example individual sales prediction database server
  • FIG. 3 is a flow diagram of an example method for predicting sales
  • FIG. 4 is a block diagram of a non-transitory computer readable medium storing instructions executed by a processor.
  • the present disclosure discloses an example apparatus and method for predicting sales.
  • current sales forecasting methods forecast sales in the aggregate.
  • predicting sales in the aggregate is too general to generate an action plan.
  • aggregate sales prediction methods do not provide any specific factors that may affect an outcome of a particular deal.
  • sales forecasting methods that predict an aggregate sales amount do not allow a sales company to generate an action plan in response to a specific deal that may be at risk.
  • the present disclosure provides a more accurate and granular sales forecasting method that can provide a prediction for each pending sale.
  • the correlations disclosed herein help to minimize type 2 error (e.g., error related to predicting a successful sale, when the sale was not successful) in a null hypothesis analysis.
  • the present disclosure can provide factors that affect the prediction of an outcome of each sale.
  • the factors that affect the sale can be used to generate an action plan that provides action items for a sales manager. For example, if a negative factor is the sales representative that is assigned to the deal, the sales manager may immediately assign a new sales representative to the deal.
  • the present disclosure may use a database server that is dedicated for executing the prediction of the sales forecast.
  • the data that is collected to train the prediction model may be stored in the database server and not moved from client to client as the prediction is executed.
  • each client may connect to the database server to execute the prediction rather than downloading the data local on the client and moving the data from client to client each time the prediction is executed.
  • FIG. 1 illustrates an example system 100 of the present disclosure.
  • the system 100 may include an individual sales prediction (ISP) database server 104 located in an Internet Protocol (IP) network 102.
  • IP Internet Protocol
  • the IP network 102 has been simplified for ease of explanation.
  • the I P network 102 may include additional network elements that are not shown (e.g., a router, a gateway, a firewall, additional access networks, application servers, and the like).
  • a plurality of endpoints 1 10, 1 12 and 1 14 may be in communication with the ISP database server 104 via a wired or wireless connection.
  • the endpoints 1 10, 1 12 and 1 14 may be any type of endpoint device such as a laptop computer, a desktop computer, a tablet computer, a smart phone, and the like. It should be noted that although three endpoint devices 1 10, 1 12 and 1 14 are illustrated in FIG. 1 that any number of endpoint devices may be deployed.
  • the endpoints 1 10, 1 12 and 1 14 may be located remotely from the ISP database server 104.
  • the endpoints 1 10, 1 12 and 1 14 and the ISP database server 104 may be part of a common sales organization or enterprise.
  • the endpoints 1 10, 1 12 and 1 14 may be located remotely from one another and assigned to different sales managers of different regions.
  • the sales managers may access the ISP database server 104 via a respective endpoint 1 10, 1 12 or 1 14 to have the ISP database server 104 predict an outcome of pending sales and provide an accurate sales forecast. Based on the predicted outcome of the pending sales, the ISP database server 104 may generate an action plan for each pending sale that can be used by the sales managers or the sales organization.
  • the system 100 may include a third party database (DB) 106 and a third party DB 108.
  • DB third party database
  • the third party DBs 106 and 108 may provide historical sales data for the sales organization.
  • the historical sales data may include a plurality of factors associated with each sale and an outcome of the previous sale (e.g., successful sale or unsuccessful sale).
  • the historical sales data may be collected by the ISP database server 104 and used to generate a classification model.
  • the classification model can then be used by the ISP DB 104 to predict an outcome of pending sales.
  • An example of a third party DB 106 and 108 that can be used may be Salesforce.com®.
  • a plurality of ISP database servers 104 may be deployed and used to process large amounts of data collected from the third party DB 106 and/or the third party DB 108.
  • the data may be split into smaller subsets of data and each smaller subset of data may be processed by a respective one of the plurality of ISP database servers 104.
  • the large amounts of data may be processed in parallel by the plurality of ISP database servers 104.
  • FIG. 2 illustrates a block diagram of an example ISP database server 104.
  • the ISP database server 104 may include a processor 202.
  • the processor may be in communication with a data collection engine 204, a classification engine 206, a prediction engine 208 and an action plan generator 210.
  • the processor may execute instructions associated with the functions performed by the data collection engine 204, the classification engine 206, the prediction engine 208 and the action plan generator 210.
  • the data collection engine 204 may collect historical sales data.
  • the processor 202 may establish a wired or wireless connection with a third party DB 106 or 108 and collect historical sales data.
  • the data collection engine 204 may periodically collect historical sales data to periodically update the classification model that is generated.
  • the historical sales data may include various information associated with each historical sale.
  • the information may include whether the sale was successful or unsuccessful, a date the sale closed if successful, age (e.g. , a number of days until the win/loss), the sales representative, an age of the sales represented, a forecast of a sales manager, a region, whether a sales representative prepared a plan to tackle the potential sale, and the like.
  • the data can be organized into a table.
  • Each row of the table may be associated with a potential or pending sale.
  • Each column may be associated with one of the factors described above.
  • a final column may represent a binary outcome of the potential or pending sale (e.g., successful sale or unsuccessful sale).
  • the classification engine 206 may calculate a classification model using the historical sales data collected by the data collection engine 204. For example, the classification engine 206 may divide the historical sales data into a training data set and a testing data set. The proportions of how the historical sales data are divided into the training data set and the testing data set may be pre-defined. In one example, 70% of the historical sales data may be used for the training data set and 30% of the historical sales data may be used for the testing data set.
  • the classification engine 206 may determine which factors are the most correlated to the outcome of a pending sale. In one example, the classification engine 206 may pre-process the data to remove outliers and derive new factors from the raw data collected from the third party DB 106 and/or the third party DB 108.
  • a modified stepwise- discriminant analysis may be applied to the historical sales data to identify the most significant factors that correlate to the outcome of a pending sale.
  • the modified SWLDA is an iterative method where at each iteration a factor with the highest correlation and statistical significance is selected.
  • a significant factor may be identified as a factor that is greater than a threshold of 90% based on the modified SWLDA.
  • the modified SWLDA may iterate until no factor meets the threshold.
  • the significant factors may then be correlated to the training data set.
  • the classification model may be calculated based on the identified significant factors using any type of data analysis method, such as, a k-nearest neighbors (KNN) analysis, a non-parametric kernel density estimation analysis, a linear dirichlet allocation (LDA) analysis, a quadratic discriminant analysis, a qualitative data analysis (QDA), and the like.
  • KNN k-nearest neighbors
  • LDA linear dirichlet allocation
  • QDA qualitative data analysis
  • the classification model may be graded based on a performance of a particular data analysis method.
  • the performance may be measured based on a sensitivity, a specificity and a false positive rate (FPR).
  • FPR false positive rate
  • a classification model that has a high sensitivity, high specificity and low FPR is desired.
  • the KNN analysis may provide the best data analysis for calculating the best classification model.
  • the classification engine 206 may validate the classification model by applying a null hypothesis analysis using the testing data set. Previous methods provided a less accurate forecasting model because the null hypothesis was applied to a data set that was assumed to have a Gaussian distribution. However, the testing data is used to calculate a distance between the testing data to one of the binary outcomes (e.g., successful sale or unsuccessful sale) determined by the classification model. The distance values comprise a chi squared ( ⁇ 2 ) distribution as opposed to a Gaussian distribution.
  • the present disclosure introduces a new error constant term, a, that can be applied to each independent test of the classification model performed using the testing data set.
  • a may be set to a value of 0.05.
  • the null hypothesis analysis may be applied using the testing data set on the classification model to minimize a type 2 error.
  • the classification model since the classification model has a binary outcome, there may be two types of error.
  • Type 1 error may be error introduced by classifying a pending sale as unsuccessful when the sale was actually a successful sale.
  • Type 2 error may be introduced by classifying a pending sale as successful when the sale was actually an unsuccessful sale.
  • the probability that the classification model is invalidated by a new data point is exponentially reduced.
  • the validation that is performed by the testing data by applying the a n error constant ensures that the classification model is accurate at predicting a sales outcome of a pending sale.
  • the prediction engine 208 may predict whether a pending sale will successfully close based upon the classification model.
  • the prediction engine 208 may receive a pending sale from a communication session established with one of the endpoints 1 10, 1 12 or 1 14.
  • a sales manager may want to forecast sales and provide a pending sale or a plurality of pending sales to the ISP database server 104.
  • the pending sale may include information associated with the pending sale (e.g., a plurality of factors described above).
  • the prediction engine 208 may use the classification method to calculate a distance between a predicted outcome of the pending sale to one of the binary outcomes of the classification method (e.g., a successful sale or an unsuccessful sale).
  • the prediction engine 208 may classify the pending sale based on which outcome the pending sale is closer to.
  • the action plan generator 210 may generate an action plan based upon the predicted outcome of the pending sale. In one example, if the pending sale is predicted to be successful, then the action plan may be to take no additional action. In other words, no factors are changed and the sales manager may continue to implement the action plan currently in place to close the pending sale.
  • the action plan generator 210 may generate an action plan that changes at least one factor associated with the pending sale.
  • a factor that has a highest significant factor for determining the outcome may be changed.
  • the sales representative may be the highest significant factor as described above using a SWLDA analysis.
  • the sales representative that is currently assigned may have a low success rate for closing deals and the sales manager may reassign a new sales representative to the pending sale.
  • an age of the pending sale may be the highest significant factor.
  • the action plan may be to implement a more accelerated action plan to work towards closing the pending sale sooner otherwise the pending sale could become stale at which point the pending sale would close unsuccessfully.
  • the generated action plan may including changing more than one factor.
  • the classification model engine 206 may calculate the classification model locally and the prediction engine 208 may predict an outcome of the pending sale locally on the ISP database server 104.
  • the historical sales data, the classification model and the functions of the prediction engine 208 are not transferred or downloaded locally to an endpoint device 1 10, 1 12 or 1 14 when a pending sales prediction is requested.
  • the ISP database server 104 ensures that the same classification model is applied for each prediction requested by the remotely located endpoint devices 1 10, 1 12 and 1 14.
  • the ISP database server 104 ensures that the classification model that is applied for each prediction request is calculated based on the same historical sales data. As a result, different sales managers in different regions may receive an accurate sales prediction for each pending sale that is based off of a consistent and accurate classification model.
  • FIG. 3 illustrates a flow diagram of an example method 300 for predicting sales.
  • the blocks of the method 300 may be performed by the ISP database server 104.
  • the method 300 begins.
  • the method 300 collects historical sales data.
  • the historical sales data may be collected from a third party database such as Salesforce.com.
  • the method 300 divides the historical sales data into a training data set and a testing data set. For example, a portion of the historical sales data may be used as a training data set to calculate a classification model and the remaining portion of the historical sales data may be used to validate the classification model. In one example, 70 percent of the historical sales data may be separated as the training data set and the remaining 30 percent of the historical sales data may be separated out as the testing data set.
  • the method 300 calculates a classification model based on the training data set.
  • the classification model may be validated with the testing data set that has a chi squared distribution by applying a null hypothesis and an error constant to each one of the testing data set that is compared to the classification model.
  • null hypothesis may be applied to the chi squared distribution (as opposed to a Gaussian distribution that is typically used) that comprises a distribution of distances that are calculated between the testing data set and the classification model.
  • the null hypothesis may validate the classification model by minimizing a type 2 error (e.g., an error associated with classifying a pending sale as a successful sale when the sale is an unsuccessful sale) by applying the error constant to each one of the testing data set that is compared to the classification model.
  • a type 2 error e.g., an error associated with classifying a pending sale as a successful sale when the sale is an unsuccessful sale
  • the error constant may be increased
  • the error probability of the classification method may be equal to the error constant raised to a power of 30 (e.g., a 30 ).
  • the testing data is used to validate the classification method to ensure that the classification method provides an accurate prediction.
  • the classification model may be calculated using any one of a variety of different statistical analysis methods.
  • the classification model may be calculated using at least one of a KNN analysis, a non-parametric kernel density estimation analysis, an LDA analysis, a quadratic discriminant analysis, or a QDA analysis.
  • KNN analysis may provide the most accurate classification model.
  • the classification method may also be based on a subset of factors extracted from the historical sales data.
  • the subset of factors may be extracted using a SWLDA analysis to identify significant factors that determine an outcome of a pending sale.
  • the method 300 may periodically repeat blocks 304, 306 and 308. For example, to continually provide the most accurate
  • the method 300 may periodically recalculate the
  • the method 300 receives information associated with a pending sale, wherein the information comprises a plurality of factors. For example, a sales manager may want to forecast sales for a time period. The sales manager may send, via an endpoint, pending sales and information associated with the pending sales to the ISP database server to receive a prediction of whether each one of the pending sales will be successful or unsuccessful.
  • the method 300 predicts whether the pending sale will successfully close based upon the classification model. For example, the method 300 may use the classification method to calculate a distance between a predicted outcome of the pending sale to one of the binary outcomes of the classification method (e.g., a successful sale or an unsuccessful sale). The method 300 may classify the pending sale based on which outcome the pending sale is closer to.
  • the classification method may use the classification method to calculate a distance between a predicted outcome of the pending sale to one of the binary outcomes of the classification method (e.g., a successful sale or an unsuccessful sale).
  • the method 300 may classify the pending sale based on which outcome the pending sale is closer to.
  • the method 300 may generate an action plan that includes changing at least one of the plurality of factors based on the predicting.
  • the action plan may be to take no additional action. In other words, no factors are changed and the sales manager may continue to implement the action plan currently in place to close the pending sale.
  • the action plan may change at least one factor associated with the pending sale.
  • a factor that has a highest significant factor for determining the outcome may be changed.
  • a plurality of significant factors may be changed.
  • FIG. 4 illustrates an example of an apparatus 400.
  • the apparatus may be the ISP database server 104.
  • the apparatus 400 may include a processor 402 and a non-transitory computer readable storage medium 404.
  • the non-transitory computer readable storage medium 404 may include instructions 406, 408, 410 and 412 that when executed by the processor 402, cause the processor 402 to perform various functions.
  • the instructions 406 may include instructions to divide collected historical sales data into a training data set and a testing data set.
  • the instructions 408 may include instructions to calculate a classification model based.
  • the classification model may be based on the training data set, wherein the classification model is validated with the testing data set that has a chi squared distribution by applying a null hypothesis and an error constant to each one of the testing data set that is compared to the classification model.
  • the instructions 410 may include instructions to predict whether a pending sale will successfully close. The prediction may be based on a comparison between a plurality of factors associated with the pending sale and the classification model.
  • the instructions 412 may include instructions to generate an action plan.
  • the action plan may include changing at least one of the plurality of factors based on the instructions to predict.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

Dans certaines mises en œuvre à titre d'exemple, l'invention concerne un procédé exécuté par un processeur. Le procédé collecte des données de ventes historiques. Les données de ventes historiques sont divisées en un ensemble de données d'apprentissage et en un ensemble de données de test. Un modèle de classification est calculé sur la base de l'ensemble de données d'apprentissage et validé avec l'ensemble de données de test. Des informations associées à une vente en cours sont reçues. Les informations comprennent une pluralité de facteurs. Sur la base du modèle de classification, une prédiction est réalisée quant au point de savoir si la vente en cours clôturera ou non avec succès. Un plan d'action qui comprend le changement d'au moins l'un de la pluralité de facteurs sur la base de la prédiction est généré.
PCT/US2016/015345 2016-01-28 2016-01-28 Serveur de base de données pour prédire des ventes WO2017131696A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/US2016/015345 WO2017131696A1 (fr) 2016-01-28 2016-01-28 Serveur de base de données pour prédire des ventes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2016/015345 WO2017131696A1 (fr) 2016-01-28 2016-01-28 Serveur de base de données pour prédire des ventes

Publications (1)

Publication Number Publication Date
WO2017131696A1 true WO2017131696A1 (fr) 2017-08-03

Family

ID=59398682

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2016/015345 WO2017131696A1 (fr) 2016-01-28 2016-01-28 Serveur de base de données pour prédire des ventes

Country Status (1)

Country Link
WO (1) WO2017131696A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110852772A (zh) * 2018-08-21 2020-02-28 北京京东尚科信息技术有限公司 动态定价方法、系统、设备和存储介质
CN112150201A (zh) * 2020-09-23 2020-12-29 创络(上海)数据科技有限公司 基于knn的时序迁移学习在销量预测中的应用
WO2021139335A1 (fr) * 2020-07-28 2021-07-15 平安科技（深圳）有限公司 Procédé et appareil pour la prédiction de données de vente d'une machine physique, dispositif informatique et support d'enregistrement
CN114581157A (zh) * 2022-04-28 2022-06-03 湖南康道医药有限公司 基于大数据的销量预测方法、装置、电子设备及介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080183546A1 (en) * 2005-03-16 2008-07-31 International Business Machines Corporation Method and system for automatic assignment of sales opportunities to human agents
US20110004509A1 (en) * 2009-07-06 2011-01-06 Xiaoyuan Wu Systems and methods for predicting sales of item listings
US20130144813A1 (en) * 2011-12-04 2013-06-06 Beyondcore, Inc. Analyzing Data Sets with the Help of Inexpert Humans to Find Patterns
US20140149180A1 (en) * 2012-04-19 2014-05-29 Oracle International Corporation Sale prediction engine rules
WO2015166489A2 (fr) * 2014-04-28 2015-11-05 Yeda Research And Development Co. Ltd. Procédé et appareil permettant de prédire une réaction à des aliments

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080183546A1 (en) * 2005-03-16 2008-07-31 International Business Machines Corporation Method and system for automatic assignment of sales opportunities to human agents
US20110004509A1 (en) * 2009-07-06 2011-01-06 Xiaoyuan Wu Systems and methods for predicting sales of item listings
US20130144813A1 (en) * 2011-12-04 2013-06-06 Beyondcore, Inc. Analyzing Data Sets with the Help of Inexpert Humans to Find Patterns
US20140149180A1 (en) * 2012-04-19 2014-05-29 Oracle International Corporation Sale prediction engine rules
WO2015166489A2 (fr) * 2014-04-28 2015-11-05 Yeda Research And Development Co. Ltd. Procédé et appareil permettant de prédire une réaction à des aliments

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110852772A (zh) * 2018-08-21 2020-02-28 北京京东尚科信息技术有限公司 动态定价方法、系统、设备和存储介质
WO2021139335A1 (fr) * 2020-07-28 2021-07-15 平安科技（深圳）有限公司 Procédé et appareil pour la prédiction de données de vente d'une machine physique, dispositif informatique et support d'enregistrement
CN112150201A (zh) * 2020-09-23 2020-12-29 创络(上海)数据科技有限公司 基于knn的时序迁移学习在销量预测中的应用
CN114581157A (zh) * 2022-04-28 2022-06-03 湖南康道医药有限公司 基于大数据的销量预测方法、装置、电子设备及介质
CN114581157B (zh) * 2022-04-28 2022-11-04 湖南康道医药有限公司 基于大数据的销量预测方法、装置、电子设备及介质

Similar Documents

Publication Publication Date Title
US10360517B2 (en) Distributed hyperparameter tuning system for machine learning
Xue et al. Short-term bus passenger demand prediction based on time series model and interactive multiple model approach
CN106992994B (zh) 一种云服务的自动化监控方法和系统
US20200302540A1 (en) Applying a trained model to predict a future value using contextualized sentiment data
US10846620B2 (en) Machine learning-based patent quality metric
US7526461B2 (en) System and method for temporal data mining
CN112381428B (zh) 基于强化学习的业务分配方法、装置、设备及存储介质
US9299042B2 (en) Predicting edges in temporal network graphs described by near-bipartite data sets
CN109120463B (zh) 流量预测方法及装置
CN110929840A (zh) 使用滚动窗口的连续学习神经网络系统
EP3549050B1 (fr) Méthode et produit informatique de génération et de sélection de règles d'accès
US11429863B2 (en) Computer-readable recording medium having stored therein learning program, learning method, and learning apparatus
US20210064432A1 (en) Resource needs prediction in virtualized systems: generic proactive and self-adaptive solution
WO2017131696A1 (fr) Serveur de base de données pour prédire des ventes
CN112380044B (zh) 数据异常检测方法、装置、计算机设备和存储介质
WO2019125445A1 (fr) Système de commande automatisé de détection de défaut
CN110162958B (zh) 用于计算设备的综合信用分的方法、装置和记录介质
US10824956B1 (en) System and method for price estimation of reports before execution in analytics
US20140279815A1 (en) System and Method for Generating Greedy Reason Codes for Computer Models
Rao et al. Time Series Forecasting methods suitable for prediction of CPU usage
CN107846402B (zh) 一种bgp稳定性异常检测方法、装置及电子设备
CN116684330A (zh) 基于人工智能的流量预测方法、装置、设备及存储介质
Perry et al. Energy demand prediction with optimized clustering-based federated learning
CN107357649B (zh) 系统资源部署策略的确定方法、装置及电子设备
Tsai et al. Simulation optimization in security screening systems subject to budget and waiting time constraints

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16888427

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16888427

Country of ref document: EP

Kind code of ref document: A1