知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

44 records (took 0.05 seconds)

    QUANTITATIVE DISCOVERY OF NAME CHANGES
    11.
    发明申请
    QUANTITATIVE DISCOVERY OF NAME CHANGES 审中-公开
    定量发现名称变更

    公开(公告)号：US20160358097A1

    公开(公告)日：2016-12-08

    申请号：US14728926

    申请日：2015-06-02

    Applicant: International Business Machines Corporation

    Inventor： Jeanette L. Blomberg ,  Anca A. Chandra ,  Pawan R. Chowdhary ,  Se Chan Oh ,  Hovey R. Strong, JR. ,  Suppawong Tuarob

    IPC: G06N99/00 ,  G06F17/30

    CPC classification number: G06N20/00 ,  G06Q10/06375

    Abstract: Embodiments of the present invention provide a method for detecting a temporal change of name associated with performance data. The method comprises receiving at least one candidate name replacement pair comprising a pair of names. The method further comprises, in a training stage, for each known name replacement pair included in the performance data, determining a window of time covering a most recent appearance of a first name of the known name replacement pair. The window of time is determined based on quantitative features of a time series model comprising performance data for the first name and a second name of the known name replacement pair. The method further comprises, in the training stage, training a machine learning classifier based on quantitative features computed using a portion of the performance data for the first name and the second name, where the portion is within the window of time determined.

    Abstract translation: 本发明的实施例提供了一种用于检测与演奏数据相关联的名称的时间变化的方法。 该方法包括接收包括一对名称的至少一个候选名称替换对。 该方法还包括在训练阶段中针对包括在演奏数据中的每个已知名称替换对，确定涵盖已知名称替换对的名字的最近出现的时间窗口。 时间窗口基于包括名字的性能数据和已知名称替换对的第二名称的时间序列模型的定量特征来确定。 该方法还包括在训练阶段中，基于使用第一名称和第二名称的性能数据的一部分计算的定量特征来训练机器学习分类器，其中该部分在确定的时间窗口内。

    EXTRAPOLATING A TIME SERIES
    12.
    发明申请
    EXTRAPOLATING A TIME SERIES 审中-公开
    超级时间系列

    公开(公告)号：US20150100367A1

    公开(公告)日：2015-04-09

    申请号：US14046849

    申请日：2013-10-04

    Applicant: International Business Machines Corporation

    Inventor： Jeanette L. Blomberg ,  Neil H.A. Boyette ,  Anca A. Chandra ,  Se Chan Oh ,  Hovey R. Strong, JR.

    IPC: G06Q10/06

    CPC classification number: G06Q10/06315

    Abstract: Embodiments of the present invention provide a system, method and computer program product for extrapolating a time series. A method comprises receiving multiple sequences of data values over time. Each sequence of data values is partitioned into a corresponding plurality of segments comprising at least one rising segment that rises to a peak data value of the sequence of data values and at least one falling segment that falls to a trough data value of the sequence of data values. For each sequence of data values, a corresponding sequence of segments that rise and fall alternately is generated based on a corresponding plurality of segments for the sequence of data values. An aggregated sequence of segments is generated by aggregating each sequence of segments generated. The aggregated sequence of segments represents a typical model for the sequences of data values.

    Abstract translation: 本发明的实施例提供了一种用于外推时间序列的系统，方法和计算机程序产品。 一种方法包括随时间接收多个数据值序列。 数据值的每个序列被划分成对应的多个段，包括至少一个上升段，其上升到数据值序列的峰值数据值，以及至少一个下降段，其落入数据序列的低谷数据值 价值观。 对于每个数据值序列，基于用于数据值序列的对应的多个段来生成对应的交替上升和下降的段的序列。 通过聚合生成的每个片段序列来生成片段的聚合序列。 段的聚合序列表示数据值序列的典型模型。

    Drone management data structure
    15.
    发明授权
    Drone management data structure 有权

    公开(公告)号：US10417917B2

    公开(公告)日：2019-09-17

    申请号：US15064551

    申请日：2016-03-08

    Applicant: International Business Machines Corporation

    Inventor： Jeanette L. Blomberg ,  Eric K. Butler ,  Anca A. Chandra ,  Pawan R. Chowdhary ,  Thomas D. Griffin ,  Divyesh Jadav ,  Robert J. Moore ,  Hovey R. Strong, Jr.

    IPC: G08G5/00

    Abstract: One embodiment provides a method comprising maintaining a multi-dimensional data structure partitioned into cells utilizing a tree data structure (“tree”) comprising intervals for each dimension of a multi-dimensional space. To partition an interval for a node of the tree into multiple subintervals, multiple leaf nodes (“leaves”) are generated, each leaf descending from the node. To merge multiple intervals for multiple nodes of the tree, a parent node (“parent”) and multiple leaves descending from the parent are generated, the parent and the leaves are time constrained, and the leaves are scheduled for a merger. When transient data in cells included in a list that corresponds to a leaf scheduled for merger expires, each cell in the list is converted into a cell for inclusion in a different list corresponding to a parent of the leaf, each leaf of the parent removed, and the parent turned into a leaf.

    Forecasting a time series based on actuals and a plan
    16.
    发明授权
    Forecasting a time series based on actuals and a plan 有权

    公开(公告)号：US10395198B2

    公开(公告)日：2019-08-27

    申请号：US14046852

    申请日：2013-10-04

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Jeanette L. Blomberg ,  Neil H. A. Boyette ,  Anca A. Chandra ,  Se Chan Oh ,  Hovey R. Strong, Jr.

    IPC: G06Q10/06

    Abstract: Embodiments of the present invention provide a system, method and computer program product for forecasting a time series based on actuals and a plan. A method comprises generating a first and a second sequence of segments that rise and fall alternately based on a first and a second sequence of data values over time, respectively. The first and second sequence of data values represent actual data for an ongoing project and estimated data for a planned project, respectively. The method further comprises aligning at least one segment of the second sequence of segments with at least one segment of the first sequence of segments, and adjusting the estimated data by replacing at least one segment of the second sequence of segments with a scaled version of at least one corresponding aligned segment of the first sequence of segments. The scaled version maintains an estimated total for the planned project.

    Quantitative discovery of name changes
    17.
    发明授权
    Quantitative discovery of name changes 有权

    公开(公告)号：US10339467B2

    公开(公告)日：2019-07-02

    申请号：US14728926

    申请日：2015-06-02

    Applicant: International Business Machines Corporation

    Inventor： Jeanette L. Blomberg ,  Anca A. Chandra ,  Pawan R. Chowdhary ,  Se Chan Oh ,  Hovey R. Strong, Jr. ,  Suppawong Tuarob

    IPC: G06N20/00 ,  G06Q10/06 ,  G06F15/18

    Abstract: Embodiments of the present invention provide a method for detecting a temporal change of name associated with performance data. The method comprises receiving at least one candidate name replacement pair comprising a pair of names. The method further comprises, in a training stage, for each known name replacement pair included in the performance data, determining a window of time covering a most recent appearance of a first name of the known name replacement pair. The window of time is determined based on quantitative features of a time series model comprising performance data for the first name and a second name of the known name replacement pair. The method further comprises, in the training stage, training a machine learning classifier based on quantitative features computed using a portion of the performance data for the first name and the second name, where the portion is within the window of time determined.

    Generating a succinct approximate representation of a time series
    18.
    发明授权
    Generating a succinct approximate representation of a time series 有权

    公开(公告)号：US10318970B2

    公开(公告)日：2019-06-11

    申请号：US14046843

    申请日：2013-10-04

    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

    Inventor： Jeanette L. Blomberg ,  Neil H. A. Boyette ,  Anca A. Chandra ,  Se Chan Oh ,  Hovey R. Strong, Jr.

    IPC: G06Q30/02

    Abstract: Embodiments of the present invention provide a system, method and computer program product for generating a succinct approximate representation of a time series. A method comprises determining at least one peak data value and at least one trough data value of an input series comprising a sequence of data values over time. The input series is partitioned into multiple segments comprising at least one rising segment that rises to a peak data value and at least one falling segment that falls to a trough data value. A sequence of segments that rise and fall alternately is generated based on the segments. A sequence of totals representing a succinct approximate representation of the input series is generated. Each total comprises a sum of data values for a corresponding segment of the sequence of segments.

    Dynamic Payment Mechanism Recommendation Generator
    19.
    发明申请
    Dynamic Payment Mechanism Recommendation Generator 审中-公开

    公开(公告)号：US20180025341A1

    公开(公告)日：2018-01-25

    申请号：US15218344

    申请日：2016-07-25

    Applicant: International Business Machines Corporation

    Inventor： Anca A. Chandra ,  Pawan R. Chowdhary ,  Susanne M. Glissmann-Hochstein ,  Thomas D. Griffin ,  Divyesh Jadav ,  Sunhwan Lee ,  Guangjie Ren ,  Hovey Raymond Strong, JR.

    IPC: G06Q20/22 ,  G06F17/30

    CPC classification number: G06Q20/227 ,  G06F16/90324 ,  G06Q20/405

    Abstract: Embodiments of the invention relate to a system, computer program product, and method for generating a recommendation for using a payment instrument or combination of payment instruments to tender payment. Payment instrument data is stored in a database. Upon receiving a request for a payment recommendation, payment instrument data is retrieved from the database and a payment instrument score is assessed across two or more payment instruments. The assessment comprises the application of a function to a payment instrument, the function taking into account payment instrument variables, category, and location. A recommendation of an apportionment of the payment is generated, including an allocation of an associated cost and the recommended payment is transmitted to a network server. The payment may then be tendered in accordance with the recommendation and recorded, or alternatively, the recommendation may be overridden and the payment tendered with the overriding data, the data then being recorded and the function adjusted accordingly.

Patent Agency Ranking