-
公开(公告)号:US12265557B2
公开(公告)日:2025-04-01
申请号:US18459081
申请日:2023-08-31
Applicant: Adobe Inc.
Inventor: William Brandon George , Wei Zhang , Tyler Rasmussen , Tung Mai , Tong Yu , Sungchul Kim , Shunan Guo , Samuel Nephi Grigg , Said Kobeissi , Ryan Rossi , Ritwik Sinha , Eunyee Koh , Prithvi Bhutani , Jordan Henson Walker , Abhisek Trivedi
IPC: G06F40/00 , G06F16/242 , G06F16/28 , G06F40/205 , G06F40/40
Abstract: Graphic visualizations, such as charts or graphs conveying data attribute values, can be generated based on natural language queries, i.e., natural language requests. To do so, a natural language request is parsed into n-grams, and from the n-grams, word embeddings are determined using a natural language model. Data attributes for the graphic visualization are discovered in the vector space from the word embeddings. The type of graphic visualization can be determined based on a request intent, which is determined using a trained intent classifier. The graphic visualization is generated to include the data attribute values of the discovered data attributes, and in accordance with the graphic visualization type.
-
公开(公告)号:US11798018B2
公开(公告)日:2023-10-24
申请号:US15062937
申请日:2016-03-07
Applicant: ADOBE INC.
Inventor: Wei Zhang , Shiladitya Bose , Said Kobeissi , Scott Allen Tomko , Jeremy W King
IPC: G06N20/00 , G06Q30/0204 , G06Q10/0639 , G06Q50/00 , G06F16/9535 , G06F16/35 , G06N3/08 , G06N3/044 , G06N3/045
CPC classification number: G06Q30/0205 , G06F16/35 , G06F16/9535 , G06Q10/06395 , G06Q50/01 , G06N3/044 , G06N3/045 , G06N3/08
Abstract: Systems and methods provide for feature selection that combines semantic classification and generative filtering with forward selection. Features from an original feature set are divided into feature subsets corresponding to ranked semantic classes. Additionally, low quality features are removed from consideration. Features are selected for a reduced feature set by iteratively processing the feature subsets using forward selection in an order corresponding to the ranking of the semantic classes. The reduced feature set is used to generate a predictive model.
-
公开(公告)号:US20250077549A1
公开(公告)日:2025-03-06
申请号:US18459081
申请日:2023-08-31
Applicant: Adobe Inc.
Inventor: William Brandon GEORGE , Wei Zhang , Tyler Rasmussen , Tung Mai , Tong Yu , Sungchul Kim , Shunan Guo , Samuel Nephi Grigg , Said Kobeissi , Ryan Rossi , Ritwik Sinha , Eunyee Koh , Prithvi Bhutani , Jordan Henson Walker , Abhisek Trivedi
IPC: G06F16/28 , G06F16/242 , G06F40/205 , G06F40/40
Abstract: Graphic visualizations, such as charts or graphs conveying data attribute values, can be generated based on natural language queries, i.e., natural language requests. To do so, a natural language request is parsed into n-grams, and from the n-grams, word embeddings are determined using a natural language model. Data attributes for the graphic visualization are discovered in the vector space from the word embeddings. The type of graphic visualization can be determined based on a request intent, which is determined using a trained intent classifier. The graphic visualization is generated to include the data attribute values of the discovered data attributes, and in accordance with the graphic visualization type.
-
公开(公告)号:US10346861B2
公开(公告)日:2019-07-09
申请号:US14933254
申请日:2015-11-05
Applicant: ADOBE INC.
Inventor: Wei Zhang , Said Kobeissi , Anandhavelu Natarajan , Shiv Kumar Saini , Ritwik Sinha , Scott Allen Tomko
Abstract: Embodiments of the present invention relate to providing business customers with predictive capabilities, such as identifying valuable customers or estimating the likelihood that a product will be purchased. An adaptive sampling scheme is utilized, which helps generate sample data points from large scale data that is imbalanced (for example, digital website traffic with hundreds of millions of visitors but only a small portion of them are of interest). In embodiments, a stream of sample data points is received. Positive samples are added to a positive list until the desired number of positives is reached and negative samples are added to a negative list until the desired number of negative samples is reached. The positive list and the negative list can then be combined, shuffled, and fed into a prediction model.
-
公开(公告)号:US10552996B2
公开(公告)日:2020-02-04
申请号:US15085210
申请日:2016-03-30
Applicant: Adobe Inc.
Inventor: Ritwik Sinha , Said Kobeissi , Michael Young
Abstract: Systems and methods disclosed herein identify multivariate relationships that exist across all types data collected from numerous observed users over one or more networks. Electronic data collected from observed users include categorical data and non-categorical/numeric data. To compare and analyze the collected data, a marketing entity converts the numeric data to categorical data via a binning algorithm, which reduces the numeric data into two or more discrete categories. The marketing entity analyzes the data variables to compute pairwise associations on the collected categorical and numeric data (which has been converted to categorical data). The marketing entity also determines hierarchical clusters to group the pairwise associations of data variables based on the strength of the associations. The pairwise relationships and hierarchical clusters are displayed on a user interface.
-
公开(公告)号:US20220148013A1
公开(公告)日:2022-05-12
申请号:US17091569
申请日:2020-11-06
Applicant: ADOBE INC.
Inventor: RITWIK SINHA , Fan Du , Sunav Choudhary , Sanket Mehta , Harvineet Singh , Said Kobeissi , William Brandon George , Chris Challis , Prithvi Bhutani , John Bates , Ivan Andrus
IPC: G06Q30/02 , G06F16/904 , G06F17/18
Abstract: Determination of high value customer journey sequences is performed by determining customer interactions that are most frequent as length N=1 sub-sequences, recursively determining most frequent length N+1 sub-sequences that start with the length N sub-sequences, determining a first count indicating how often one of the sub-sequences appears in the sequences, determining a second count indicating how often the one sub-sequence resulted in the goal, and using the counts to determine the most or least effective sub-sequences for achieving the goal.
-
公开(公告)号:US11756058B2
公开(公告)日:2023-09-12
申请号:US17091569
申请日:2020-11-06
Applicant: ADOBE INC.
Inventor: Ritwik Sinha , Fan Du , Sunav Choudhary , Sanket Mehta , Harvineet Singh , Said Kobeissi , William Brandon George , Chris Challis , Prithvi Bhutani , John Bates , Ivan Andrus
IPC: G06Q30/00 , G06Q30/0201 , G06F17/18 , G06F16/904
CPC classification number: G06Q30/0201 , G06F16/904 , G06F17/18
Abstract: Determination of high value customer journey sequences is performed by determining customer interactions that are most frequent as length N=1 sub-sequences, recursively determining most frequent length N+1 sub-sequences that start with the length N sub-sequences, determining a first count indicating how often one of the sub-sequences appears in the sequences, determining a second count indicating how often the one sub-sequence resulted in the goal, and using the counts to determine the most or least effective sub-sequences for achieving the goal.
-
公开(公告)号:US20210224857A1
公开(公告)日:2021-07-22
申请号:US16746531
申请日:2020-01-17
Applicant: Adobe Inc.
Inventor: Ritwik Sinha , William George , Said Kobeissi , Raymond Wong , Prithvi Bhutani , Ilya Reznik , Fan Du , David Arbour , Chris Challis , Atanu Sinha , Anup Rao
IPC: G06Q30/02 , G06F16/22 , G06F3/0482
Abstract: The present disclosure describes systems, methods, and non-transitory computer readable media for generating lookalike segments corresponding to a target segment using decision trees and providing a graphical user interface comprising nodes representing such lookalike segments. Upon receiving an indication of a target segment, for instance, the disclosed systems can generate a lookalike segment from a set of users by partitioning the set of users according to one or more dimensions based on probabilities of subsets of users matching the target segment. By partitioning subsets of users within a node tree, the disclosed systems can identify different subsets of users partitioned according to different dimensions from the set of users. The disclosed systems can further provide a node tree interface comprising a node for the set of users and nodes for subsets of users within one or more lookalike segments.
-
-
-
-
-
-
-