公开(公告)号：US11861633B2

公开(公告)日：2024-01-02

申请号：US18180092

申请日：2023-03-07

Applicant: INTUIT INC.

Inventor： Vijay Manikandan Janakiraman ,  Kevin Michael Furbish ,  Nirmala Ranganathan ,  Kymm K. Kause

IPC: G06Q30/02 ,  G06Q30/0201 ,  G06F16/215 ,  G06N20/10 ,  G06Q30/0207 ,  G06F18/24 ,  G06Q30/0601

CPC classification number: G06Q30/0201 ,  G06F16/215 ,  G06F18/24 ,  G06N20/10 ,  G06Q30/0239 ,  G06Q30/0631

Abstract: A processor may receive user interaction data of a user for a plurality of electronically-presented offers. The processor may generate a plurality of labels, the generating comprising generating a label for each respective offer according to a comparison of the quality of the user interactions of the respective offer to the frequency of the user interactions of the respective offer. Each label may be a positive label or a negative label. The processor may determine whether the generating produced both positive and negative labels. The processor may select one of a plurality of available ML models, wherein a two-class ML model is chosen in response to determining that the generating produced both positive and negative labels and a one-class ML model is chosen in response to determining that the generating did not produce both positive and negative labels. The selected ML model may be trained and/or may be used to process user profile data and provide recommendations.

公开(公告)号：US11645695B2

公开(公告)日：2023-05-09

申请号：US16817380

申请日：2020-03-12

Applicant: Intuit Inc.

Inventor： Vijay Manikandan Janakiraman ,  Arjun Sripathy

IPC: G06Q30/00 ,  G06Q30/0601 ,  G06N5/045 ,  G06F17/16 ,  G06N20/00

CPC classification number: G06Q30/0631 ,  G06F17/16 ,  G06N5/045 ,  G06N20/00 ,  G06Q30/0623

Abstract: A method may include obtaining interactions between users and items, and calculating, for each edge in a bipartite graph, an edge weight using an inverse of the degree of a user node connected to the edge and an inverse of the degree of an item node connected to the edge. The bipartite graph includes user nodes corresponding to the users and item nodes corresponding to the items. The method may further include identifying paths each including an edge connecting the target user node and a common item node, an edge connecting a neighboring user node and the common item node, and an edge connecting the neighboring user node and a neighboring item node. The method may further include calculating, using the edge weights calculated for the edges, scores for the paths, and recommending, to the target user and using the scores for the paths, a recommended item.

公开(公告)号：US20210287273A1

公开(公告)日：2021-09-16

申请号：US16817380

申请日：2020-03-12

Applicant: Intuit Inc.

Inventor： Vijay Manikandan Janakiraman ,  Arjun Sripathy

IPC: G06Q30/06 ,  G06N5/04 ,  G06N20/00 ,  G06F17/16

Abstract: A method may include obtaining interactions between users and items, and calculating, for each edge in a bipartite graph, an edge weight using an inverse of the degree of a user node connected to the edge and an inverse of the degree of an item node connected to the edge. The bipartite graph includes user nodes corresponding to the users and item nodes corresponding to the items. The method may further include identifying paths each including an edge connecting the target user node and a common item node, an edge connecting a neighboring user node and the common item node, and an edge connecting the neighboring user node and a neighboring item node. The method may further include calculating, using the edge weights calculated for the edges, scores for the paths, and recommending, to the target user and using the scores for the paths, a recommended item.