会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • SYSTEM AND METHOD FOR FORECASTING USING MONTE CARLO METHODS
    • 使用蒙特卡罗方法预测的系统和方法
    • US20160260109A1
    • 2016-09-08
    • US14638155
    • 2015-03-04
    • Wal-Mart Stores, Inc.
    • Huijun FengShubhankar Ray
    • G06Q30/02
    • A system and method for calculating demand forecasts is presented. Sales data for a set of SKUs is received. The sales data is filtered to contain only data for low-selling SKUs. A set of clusters of SKUs is created. A generalized dynamic linear model for use with each cluster in the set of clusters is generated. A set of random data points is generated. The dynamic linear model is fitted at each data point in the set of random data points using a Monte Carlo method. This fitting can be performed using an unscented Kalman filter method. Calculating a forecast for sales based on the fitting at each data point. Using the forecast for sales, inventory is ordered. Other embodiments are also disclosed herein.
    • 提出了一种计算需求预测的系统和方法。 收到一组SKU的销售数据。 销售数据被过滤以仅包含低销售SKU的数据。 创建一组SKU集群。 生成用于集群中的每个集群的广义动态线性模型。 生成一组随机数据点。 动态线性模型使用蒙特卡罗方法拟合在随机数据点集合中的每个数据点。 这个拟合可以使用无限卡尔曼滤波方法进行。 根据每个数据点的拟合计算销售预测。 使用销售预测,定货。 本文还公开了其它实施例。
    • 2. 发明申请
    • SYSTEM AND METHOD FOR GROUPING TIME SERIES DATA FOR FORECASTING PURPOSES
    • 用于分类用于预测用途的时间序列数据的系统和方法
    • US20160260111A1
    • 2016-09-08
    • US14638694
    • 2015-03-04
    • Wal-Mart Stores, Inc.
    • Shubhankar RayAbhay Jha
    • G06Q30/02G06Q10/08G06K9/62
    • G06Q30/0202G06K9/6218G06Q10/087
    • A system and method for grouping units for forecasting purposes is presented. A plurality of stock keeping units (SKUs) is presented to an embodiment. Initial medoids are chosen based on a vertex within a set of vertices, each of which represent a SKU. Then, each vertex within the set of vertices is associated with its closest medoid to form initial clusters. There can be a cap on the number of vertices in each cluster. Thereafter, an iterative algorithm is performed wherein a probability is assigned to each vertex. One or more vertices are randomly chosen, with the weights of the vertices weighting the random choice. The chosen one or more vertices are moved to another cluster. The algorithm is performed until no further improvements result from moving one or more vertices to another cluster. Other embodiments are also disclosed herein.
    • 介绍了用于将单位分组以进行预测的系统和方法。 多个库存单元(SKU)被呈现给实施例。 基于一组顶点内的顶点来选择初始的类型,每个顶点代表SKU。 然后,顶点集合中的每个顶点与其最近的中间体相关联,以形成初始聚类。 每个群集中的顶点数可以有一个上限。 此后,执行其中将概率分配给每个顶点的迭代算法。 一个或多个顶点被随机选择,顶点的权重加权随机选择。 所选的一个或多个顶点被移动到另一个集群。 执行算法,直到将一个或多个顶点移动到另一个集群为止不再有改进。 本文还公开了其它实施例。