公开(公告)号：US20210158177A1

公开(公告)日：2021-05-27

申请号：US16691158

申请日：2019-11-21

Applicant: ADOBE INC.

Inventor： ABHILASHA SANCHETI ,  ZHENG WEN ,  IFTIKHAR AHAMATH BURHANUDDIN

IPC: G06N5/04 ,  G06N20/00 ,  G06N7/00

Abstract: A method for recommending digital content includes: determining user preferences and a time horizon of a given user; determining a group for the given user based on the determined user preferences; determining a number of users of the determined group and a similarity of the users; applying information including the number of users, the similarity, and the time horizon to a model selection classifier to select one of a personalized model of the user and a group model of the determined group; and running the selected model to determine digital content to recommend.

公开(公告)号：US20190294732A1

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

申请号：US15928288

申请日：2018-03-22

Applicant: ADOBE INC.

Inventor： BALAJI VASAN SRINIVASAN ,  RAJAT CHATURVEDI ,  TANYA GOYAL ,  PARIDHI MAHESHWARI ,  ANISH VALLIYATH MONSY ,  ABHILASHA SANCHETI

IPC: G06F17/30

Abstract: A framework is provided for constructing enterprise-specific knowledge bases from enterprise-specific data that includes structured and unstructured data. Relationships between entities that match known relationships are identified for each of a plurality of tuples included in the structured data. Where possible, relationships between entities that match known relationships also are identified for tuples included in the unstructured data. If matching relationships between entities that cannot be identified for tuples in the unstructured data, extracted relationships are sequentially clustered to similar relationships and a relationship is assigned to the clustered tuples. An enterprise-specific knowledge graph is constructed from the structured-data-tuples and their identified relationships, the unstructured-data-tuples where the relationships could be mapped to a known relationship and their identified relationships, and the unstructured-data-tuples that could not be mapped to a known relationship and their assigned relationships. The knowledge graph is enriched with any information determined to be missing therefrom.