Data structures for managing configuration versions of cloud-based applications

    公开(公告)号:US11080043B1

    公开(公告)日:2021-08-03

    申请号:US16896844

    申请日:2020-06-09

    申请人: Amperity, Inc.

    发明人: Gregory Kyle Look

    IPC分类号: G06F8/71 G06F21/53

    摘要: The present disclosure relates to methods and systems for applying version control of configurations to a software application, such as, a cloud-based application. Each version may be stored as a plurality of configuration nodes within a configuration tree structure. Version changes may lead to the creation or modification of configuration nodes. Configurations may be tested in a sandbox and undergo validation checks before being applied to the software application.

    Trimming blackhole clusters
    2.
    发明授权

    公开(公告)号:US12013855B2

    公开(公告)日:2024-06-18

    申请号:US18313753

    申请日:2023-05-08

    申请人: AMPERITY, INC.

    摘要: Disclosed are techniques for trimming large clusters of related records. In one embodiment, a method is disclosed comprising receiving a set of clusters, each cluster in the clusters including a plurality of records. The method extracts an oversized cluster in the set of clusters and performs a breadth-first search (BFS) on the oversized cluster to generate a list of visited records. The method terminates the BFS upon determining that the size of the list of visited records exceeds a maximum size and generates a new cluster from the list of visited records and adding the new cluster to the set of clusters. By recursively performing BFS traverse over the oversized cluster and extracting smaller new clusters from it, the oversized cluster is eventually partitioned into a set of sub-clusters with the size smaller than the predefined threshold.

    GENERATING AFFINITY GROUPS WITH MULTINOMIAL CLASSIFICATION AND BAYESIAN RANKING

    公开(公告)号:US20230131884A1

    公开(公告)日:2023-04-27

    申请号:US17511946

    申请日:2021-10-27

    申请人: AMPERITY, INC.

    IPC分类号: G06N7/00 G06N20/20

    摘要: The example embodiments are directed toward improvements in generating affinity groups. In an embodiment, a method is disclosed comprising generating probabilities of object interactions for a plurality of users, a given object recommendation ranking for a respective user comprising a ranked list of object attributes; calculating interaction probabilities for each user over a forecasting window; calculating affinity group rankings based on the probabilities of object interactions and the interaction probabilities for each user; and grouping the plurality of users based on the affinity group rankings.

    EFFECTIVELY FUSING DATABASE TABLES

    公开(公告)号:US20210081171A1

    公开(公告)日:2021-03-18

    申请号:US17104868

    申请日:2020-11-25

    申请人: AMPERITY, INC.

    摘要: The present disclosure relates to fuse multiple database tables together. The fields of the database tables may be normalized using semantic fields. Under a first approach, database tables are deduplicated by consolidating redundant records. This may be done by performing pairwise comparisons to identify related pairs of records and then clustering the related pairs of records. Then, the deduplicated database tables are merged by performing another pairwise comparison. Under a second approach, the database tables may be concatenated. Thereafter, records are subject to pairwise comparisons and then clustered to create a merged database table.

    MULTI-STAGE PREDICTION WITH FITTED RESCALING MODEL

    公开(公告)号:US20230252503A1

    公开(公告)日:2023-08-10

    申请号:US17854154

    申请日:2022-06-30

    申请人: AMPERITY, INC.

    IPC分类号: G06Q30/02 G06N5/00

    CPC分类号: G06Q30/0202 G06N5/003

    摘要: In some aspects, the techniques described herein relate to a method including: receiving a vector, the vector including a plurality of features related to a user; predicting a return probability for the user based on the vector using a first predictive model; adjusting the return probability using a fitted sigmoid function to generate an adjusted return probability; and predicting a lifetime value of the user using the adjusted return probability and at least one other prediction by combining the adjusted return probability and the at least one other prediction.

    GENERATIVE-DISCRIMINATIVE ENSEMBLE METHOD FOR PREDICTING LIFETIME VALUE

    公开(公告)号:US20230128579A1

    公开(公告)日:2023-04-27

    申请号:US17511747

    申请日:2021-10-27

    申请人: AMPERITY, INC.

    IPC分类号: G06N3/08 G06N3/04 G06N5/00

    摘要: The example embodiments are directed toward predicting the lifetime value of a user using an ensemble model. In an embodiment, a system is disclosed, including a generative model for generating a first prediction representing a first lifetime value of a user during a forecasting period and a discriminative model configured for generating a second prediction representing a second lifetime value of the user during the forecasting period. The system further includes a meta-model for receiving the first prediction and the second prediction and generating a third prediction based on the first prediction and the second prediction, the third prediction representing a third lifetime value of the user during the forecasting period.

    Merging database tables by classifying comparison signatures

    公开(公告)号:US11442694B1

    公开(公告)日:2022-09-13

    申请号:US16787576

    申请日:2020-02-11

    申请人: Amperity, Inc.

    摘要: The present disclosure relates to merging database tables. Systems and methods may involve performing a comparison between the first set of records and the second set of records and identifying a plurality of record pairs based on the comparison. Each record pair may comprise a record in the first set of records and a record in the second set of records. In addition, A feature signature may be generated for each record pair by comparing field values in each record pair. The feature signature may be classified to identify at least one related record pair. A merged database table may be generated such that it comprises the at least one related record pair and comprises a set of unique records among selected from the first set of records and the second set of records.