GENERATING VISUAL DATA STORIES
    11.
    发明申请

    公开(公告)号:US20230130778A1

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

    申请号:US18069561

    申请日:2022-12-21

    Applicant: Adobe Inc.

    Abstract: This disclosure describes one or more embodiments of systems, non-transitory computer-readable media, and methods that intelligently and automatically analyze input data and generate visual data stories depicting graphical visualizations from data insights determined from the input data. For example, the disclosed systems automatically extract data insights utilizing an in-depth statistical analysis of dataset groups from data-attribute categories within the input data. Based on the data insights, the disclosed systems can automatically generate exportable visual data stories to visualize the data insights, provide textual or audio-based natural language summaries of the data insights, and animate such data insights in videos. In some embodiments, the disclosed systems generate a visual-data-story graph comprising nodes representing visual data stories and edges representing similarities between the visual data stories. Based on the visual-data-story graph, the disclosed systems can select a relevant visual data story to display on a graphical user interface.

    Segmenting users with sparse data utilizing hash partitions

    公开(公告)号:US11630854B2

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

    申请号:US17660328

    申请日:2022-04-22

    Applicant: Adobe Inc.

    Abstract: The present disclosure describes systems, non-transitory computer-readable media, and methods for utilizing hash partitions to determine local densities and distances among users (or among other represented data points) for clustering sparse data into segments. For instance, the disclosed systems can generate hash signatures for users in a sparse dataset and can map users to hash partitions based on the hash signatures. The disclosed systems can further determine local densities and separation distances for particular users (or other represented data points) within the hash partitions. Upon determining local densities and separation distances for datapoints from the dataset, the disclosed systems can select a segment (or cluster of data points) grouped according to a hierarchy of a clustering algorithm, such as a density-peaks-clustering algorithm.

    CONFIGURATION OF USER INTERFACE FOR INTUITIVE SELECTION OF INSIGHT VISUALIZATIONS

    公开(公告)号:US20220244815A1

    公开(公告)日:2022-08-04

    申请号:US17161770

    申请日:2021-01-29

    Applicant: Adobe Inc.

    Abstract: In some embodiments, a data visualization system detects insights from a dataset and computes insight scores for respective insights. The data visualization system further computes insight type scores, from the insight scores, for insight types in the detected insights. The data visualization system determines a selected insight type for the dataset having a higher insight type score than unselected insight types and determines, for the selected insight type, a set of selected insights that have higher insight scores than unselected insights. The data visualization system determines insight visualizations for the set of selected insights and generates, for inclusion in a user interface of the data visualization system, selectable interface elements configured for invoking an editing tool for updating the determined insight visualizations from the dataset. The selectable interface elements are arranged in the user interface according to the insight scores of the set of selected insights.

    GENERATING VISUAL DATA STORIES
    15.
    发明申请

    公开(公告)号:US20220237228A1

    公开(公告)日:2022-07-28

    申请号:US17161406

    申请日:2021-01-28

    Applicant: Adobe Inc.

    Abstract: This disclosure describes one or more embodiments of systems, non-transitory computer-readable media, and methods that intelligently and automatically analyze input data and generate visual data stories depicting graphical visualizations from data insights determined from the input data. For example, the disclosed systems automatically extract data insights utilizing an in-depth statistical analysis of dataset groups from data-attribute categories within the input data. Based on the data insights, the disclosed systems can automatically generate exportable visual data stories to visualize the data insights, provide textual or audio-based natural language summaries of the data insights, and animate such data insights in videos. In some embodiments, the disclosed systems generate a visual-data-story graph comprising nodes representing visual data stories and edges representing similarities between the visual data stories. Based on the visual-data-story graph, the disclosed systems can select a relevant visual data story to display on a graphical user interface.

    DYNAMIC CLUSTERING OF SPARSE DATA UTILIZING HASH PARTITIONS

    公开(公告)号:US20210326361A1

    公开(公告)日:2021-10-21

    申请号:US16852110

    申请日:2020-04-17

    Applicant: Adobe Inc.

    Abstract: The present disclosure describes systems, non-transitory computer-readable media, and methods for utilizing hash partitions to determine local densities and distances among users (or among other represented data points) for clustering sparse data into segments. For instance, the disclosed systems can generate hash signatures for users in a sparse dataset and can map users to hash partitions based on the hash signatures. The disclosed systems can further determine local densities and separation distances for particular users (or other represented data points) within the hash partitions. Upon determining local densities and separation distances for datapoints from the dataset, the disclosed systems can select a segment (or cluster of data points) grouped according to a hierarchy of a clustering algorithm, such as a density-peaks-clustering algorithm.

    Utilizing one hash permutation and populated-value-slot-based densification for generating audience segment trait recommendations

    公开(公告)号:US11109085B2

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

    申请号:US16367628

    申请日:2019-03-28

    Applicant: Adobe Inc.

    Abstract: The present disclosure relates to training a recommendation model to generate trait recommendations using one permutation hashing and populated-value-slot-based densification. In particular, the disclosed systems can train the recommendation model by computing sketch vectors corresponding to traits using one permutation hashing. The disclosed systems can then fill in unpopulated value slots of the sketch vectors using populated-value-slot-based densification. The disclosed systems can combine the resulting densified sketches to generate the trained recommendation model. For example, in some embodiments, the disclosed systems can combine the sketches by generating a plurality of locality sensitive hashing tables based on the sketches. In some embodiments, the disclosed systems generate a count sketch matrix based on the sketches and generate trait embeddings based on the count sketch matrix using spectral embedding. Based on the trait embeddings, the disclosed systems can utilize the recommendation model to flexibly and accurately determine the similarity between traits.

    FAST GRAPH MODEL SELECTION VIA META-LEARNING
    20.
    发明公开

    公开(公告)号:US20240119251A1

    公开(公告)日:2024-04-11

    申请号:US17936099

    申请日:2022-09-28

    Applicant: Adobe Inc.

    Inventor: Ryan Rossi

    CPC classification number: G06N3/04 G06N3/08

    Abstract: Methods, systems, and non-transitory computer readable storage media are disclosed for utilizing machine-learning to automatically select a machine-learning model for graph learning tasks. The disclosed system extracts, utilizing a graph feature machine-learning model, meta-graph features representing structural characteristics of a graph representation comprising a plurality of nodes and a plurality of edges indicating relationships between the plurality of nodes. The disclosed system also generates, utilizing the graph feature machine-learning model, a plurality of estimated graph learning performance metrics for a plurality of machine-learning models according to the meta-graph features. The disclosed system selects a machine-learning model to process data associated with the graph representation according to the plurality of estimated graph learning performance metrics.

Patent Agency Ranking