REDUCING ACTIVE USER BIAS FOR CONTENT RECOMMENDATION MODELS

    公开(公告)号:US20240276041A1

    公开(公告)日:2024-08-15

    申请号:US18107858

    申请日:2023-02-09

    Applicant: ROKU, INC.

    CPC classification number: H04N21/251 G06N20/00 H04N21/25883

    Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for reducing active user or active content category bias in content recommendation systems. An example embodiment operates by modifying a streaming event data set by selecting a voting algorithm. The voting algorithm reduces an impact of highly occurring data points by sampling the streaming event data set to generate a sampled streaming event data set, wherein the highly occurring data points comprise data points generated by the active users or the active content categories. The embodiment further trains, by a machine learning engine and based on the sampled streaming event data set, a machine learning model to generate a reduced bias content recommendation model and generates, based on the reduced bias content recommendation model, content recommendations for subsequent selection and rendering on a media device.

    AUTOMATED TRAILER GENERATION
    3.
    发明申请

    公开(公告)号:US20250024123A1

    公开(公告)日:2025-01-16

    申请号:US18895850

    申请日:2024-09-25

    Applicant: ROKU, INC.

    Abstract: Disclosed herein are system, apparatus, article of manufacture, method and/or computer program product aspects, and/or combinations and sub-combinations thereof, for generating trailers (previews) for multimedia content. An example aspect operates by generating an initial set of candidate points to generate a trailer for a media content; determining conversion data for each of the initial set of candidate points; determining an updated set of candidate points based on the conversion data; determining an estimated mean and upper bound for each of the updated set of candidate points; computing a value for each of the updated set of candidate points; generating a ranked list based on the value computed for each of the updated set of candidate points; and repeating the process until an optimal candidate point is converged upon.

    CONTENT DISPLAY AND CLUSTERING SYSTEM
    4.
    发明公开

    公开(公告)号:US20240086466A1

    公开(公告)日:2024-03-14

    申请号:US17943526

    申请日:2022-09-13

    Applicant: ROKU, INC.

    CPC classification number: G06F16/906

    Abstract: Disclosed herein are various embodiments, for a content display and clustering system. An example embodiment operates by receiving a request to display the plurality of content items. At each of multiple levels different pairs of content items are identified and a similarity score is computed for each pair. A subset of pairs for which their similarity score exceeds a similarity threshold for the respective level are identified and clustered. This process is repeated for one or more iterations at the same level, and then the process is repeated for each of the multiple levels. A final clustered subset is identified, and output for display, responsive to the request to display the plurality of content items.

    RECOMMENDATION SYSTEM WITH REDUCED BIAS BASED ON A VIEW HISTORY

    公开(公告)号:US20240064354A1

    公开(公告)日:2024-02-22

    申请号:US17890491

    申请日:2022-08-18

    Applicant: ROKU, INC.

    CPC classification number: H04N21/252 H04N21/25891

    Abstract: Disclosed are mechanisms for selecting a recommended item for a current item being viewed by a user account based on a view history of the user account with reduced bias. For a current item being viewed by the user account represented by a current node of a co-watch graph, embodiments can select a recommended item represented by an associated node in the co-watch graph likely being viewed by the user account, and determine a probability of the recommended item likely being viewed. The co-watch graph can be generated based on a view history of the user account. An edge between a first node and a second node of the co-watch graph can have a weight representing a number of co-occurrence times when the first item represented by the first node and the second item represented by the second node are viewed in sequence within a predetermined time interval.

Patent Agency Ranking