-
公开(公告)号：US10922609B2
公开(公告)日：2021-02-16
申请号：US15597290
申请日：2017-05-17
Applicant: Facebook, Inc.
Inventor： Aditya Pal , Deepayan Chakrabarti , Karthik Subbian , Anitha Kannan
IPC: G06N3/08 , G06F16/901 , G06N3/04 , G06N5/02 , G06N20/10
Abstract: In one embodiment, a system may access a graph data structure that includes nodes and connections between the nodes. Each node may be associated with a user; each connection between two nodes may represent a relationship between the associated users; and each node may be either labeled or unlabeled with respect to a label type. For each labeled node, a label of the label type of that labeled node may be propagated to other nodes through the connections. For each node, the system may store a label distribution information associated with the label type based on the propagated labels reaching the node. The system may train a machine-learning model using the labels and the label distribution information of a set of the labeled nodes. A predicted label for each unlabeled node may be generated using the model and the label distribution information of the unlabeled node.
-
公开(公告)号：US20180197098A1
公开(公告)日：2018-07-12
申请号：US15403107
申请日：2017-01-10
Applicant: Facebook, Inc.
Inventor： Karthik Subbian , Anitha Kannan , Yann Nicolas Dauphin
CPC classification number: G06N7/005 , G06N3/0454 , G06Q10/10 , G06Q30/02 , G06Q30/06 , G06Q50/01 , H04L51/10 , H04L51/32
Abstract: Systems, methods, and non-transitory computer-readable media can determine one or more chunks for a content item to be captioned. Each chunk can include one or more terms that describe at least a portion of the subject matter captured in the content item. One or more sentiments are determined based on the subject matter captured in the content item. One or more emotions are determined for the content item. At least one emoted caption is generated for the content item based at least in part on the one or more chunks, sentiments, and emotions. The emoted caption can include at least one term that conveys an emotion represented by the subject matter captured in the content item.
-
公开(公告)号：US20190114373A1
公开(公告)日：2019-04-18
申请号：US15783984
申请日：2017-10-13
Applicant: Facebook, Inc.
Inventor： Karthik Subbian , Sergey Edunov
Abstract: In one embodiment, a method includes identifying a first user node that corresponds to a first user of a social-networking system for whom recommendation candidates are to be generated, where the social-networking system comprises a social graph that comprises nodes and edges representing relationships between the users. The method further includes performing one or more steps of a computation that implements a random walk of the nodes of a social graph, and generates a ranking value for each user node that satisfies one or more constraints, wherein the ranking value represents an importance of the user node to other user nodes in the social graph in accordance with the relationships represented by the edges, and selecting one or more candidate users to be recommended to a particular user based on the ranking values associated with the user nodes.
-
4.发明授权公开(公告)号：US10601945B2
公开(公告)日：2020-03-24
申请号：US15277888
申请日：2016-09-27
Applicant: Facebook, Inc.
Inventor： Ismail Onur Filiz , Karthik Subbian , Paige Alexandra Oliver Maas , Nicolas Emilio Stier Moses , Killian Murphy
Abstract: Systems, methods, and non-transitory computer readable media can determine a time at which to prefetch one or more content items to be included in a feed associated with a user. The feed can be provided by a social networking system. A number of content items to prefetch at the determined time can be determined. One or more content items to be included in the feed associated with the user can be prefetched based at least in part on the determined time and the determined number of content items. The determined time can be prior to a time at which the user is expected to access an application associated with the social networking system.
-
5.发明授权公开(公告)号：US10083355B2
公开(公告)日：2018-09-25
申请号：US15192804
申请日：2016-06-24
Applicant: Facebook, Inc.
Inventor： Karthik Subbian , Benjamin Ray
CPC classification number: G06K9/00664 , G06K9/00677 , G06K9/00979 , G06Q50/01 , G11B27/10
Abstract: Systems, methods, and non-transitory computer-readable media can identify a media content item for which media processing is to be performed. State information associated with the media content item can be acquired. At least some of the media processing can be enabled, based on the state information, to be performed client-side with respect to the media content item. The state information can indicate a next processing step of the at least some of the media processing that is to be performed. The state information can be updated based on the at least some of the media processing performed client-side.
-
Patent Agency Ranking
公开(公告)号：US10348820B2
公开(公告)日：2019-07-09
申请号：US15411190
申请日：2017-01-20
Applicant: Facebook, Inc.
Inventor： Karthik Subbian
Abstract: Certain embodiments described herein relate to peer-to-peer content distribution. In one embodiment, a method includes a first device receiving content and determining a content categorization of the received content. The first device may detect a second computing device and communicate with that it through a direct wireless connection (e.g., Bluetooth). Through the direct wireless connection, the first device may receive information associated with a user of the second computing device from the second device. Based on the information associated with the user and the content categorization of the content, the first device may determine a likelihood of the user being interested in the content. The first device may push the content to the second computing device through the direct wireless connection based on the likelihood of the user being interested in the content.
-
公开(公告)号：US20180352383A1
公开(公告)日：2018-12-06
申请号：US15608152
申请日：2017-05-30
Applicant: Facebook, Inc.
Inventor： Karthik Subbian
CPC classification number: H04W4/029 , G01C21/3617 , G06N5/003 , H04W4/02
Abstract: In one embodiment, a method includes determining a current location of a user based on location data received from a client device; and calculating a transition probability of the user transitioning, within a predetermined time window, from the current location to each of a number of candidate geographic locations. The calculating of the transition probability is based at least in part on previously logged location data associated with a number of users who were at the current location. The method also includes determining metadata associated with the user; and calculating an offline probability associated with each of the number of candidate geographic locations using a computer model and the metadata associated with the user. The computer model is generated using machine learning and metadata associated with users who were at the respective candidate geographic location.
-
公开(公告)号：US20180336457A1
公开(公告)日：2018-11-22
申请号：US15597290
申请日：2017-05-17
Applicant: Facebook, Inc.
Inventor： Aditya Pal , Deepayan Chakrabarti , Karthik Subbian , Anitha Kannan
Abstract: In one embodiment, a system may access a graph data structure that includes nodes and connections between the nodes. Each node may be associated with a user; each connection between two nodes may represent a relationship between the associated users; and each node may be either labeled or unlabeled with respect to a label type. For each labeled node, a label of the label type of that labeled node may be propagated to other nodes through the connections. For each node, the system may store a label distribution information associated with the label type based on the propagated labels reaching the node. The system may train a machine-learning model using the labels and the label distribution information of a set of the labeled nodes. A predicted label for each unlabeled node may be generated using the model and the label distribution information of the unlabeled node.
-
公开(公告)号：US20190114362A1
公开(公告)日：2019-04-18
申请号：US15782475
申请日：2017-10-12
Applicant: Facebook, Inc.
Inventor： Karthik Subbian , Haixun Wang , Oleksandr Maksymets
Abstract: In one embodiment, a method includes receiving, from a client system associated with a user of an online social network, a search query for entities in the online social network, the search query containing one or more n-grams, generating a query embedding corresponding to the search query, where the query embedding represents the search query as a point in a d-dimensional embedding space, retrieving multiple entity embeddings corresponding to a plurality of entities, respectively, where each entity embedding represents the corresponding entity as a point in the d-dimensional embedding space, calculating, for each of the retrieved entity embeddings, a similarity metric between the query embedding and the entity embedding, ranking the entities based on their respective calculated similarity metrics, and sending, to the client system in response to the search query, instructions for presenting a search-results interface.
-
公开(公告)号：US10149111B1
公开(公告)日：2018-12-04
申请号：US15608152
申请日：2017-05-30
Applicant: Facebook, Inc.
Inventor： Karthik Subbian
CPC classification number: H04W4/029 , G01C21/3617 , G06N5/003 , H04W4/02
Abstract: In one embodiment, a method includes determining a current location of a user based on location data received from a client device; and calculating a transition probability of the user transitioning, within a predetermined time window, from the current location to each of a number of candidate geographic locations. The calculating of the transition probability is based at least in part on previously logged location data associated with a number of users who were at the current location. The method also includes determining metadata associated with the user; and calculating an offline probability associated with each of the number of candidate geographic locations using a computer model and the metadata associated with the user. The computer model is generated using machine learning and metadata associated with users who were at the respective candidate geographic location.
-
-
-
-
-
-
-
-
-
Search Results
13
records
(took 0.018 seconds)
