Grouping Recommended Search Queries in Card Clusters
    2.
    发明申请
    Grouping Recommended Search Queries in Card Clusters 审中-公开
    分组卡集群中的推荐搜索查询

    公开(公告)号:US20160246890A1

    公开(公告)日:2016-08-25

    申请号:US15147305

    申请日:2016-05-05

    Applicant: Facebook, Inc.

    Abstract: In one embodiment, a method includes receiving, from a client system of a first user of a communication network, an input from the first user to access a card-stack interface, generating one or more card clusters from a plurality of cards, each card comprising a query referencing a query-domain associated with the communication network and zero or more query-filters for the query-domain, wherein each query-filter references one or more objects of the communication network, each card cluster comprising one or more cards from the plurality of cards, the cards being formed into card clusters based on a card-affinity between the cards, and sending, to the client system in response to the input from the first user, the card-stack interface for display to the first user, wherein the card-stack interface comprises one or more of the card clusters.

    Abstract translation: 在一个实施例中,一种方法包括从客户端系统接收通信网络的第一用户的来自第一用户的输入以访问卡堆栈接口,从多个卡生成一个或多个卡簇,每个卡 包括引用与通信网络相关联的查询域的查询和用于查询域的零个或多个查询过滤器,其中每个查询过滤器引用通信网络的一个或多个对象,每个卡集合包括一个或多个卡, 多个卡片,卡片基于卡片之间的卡片相关性而形成卡片集群,并且响应于来自第一用户的输入向客户端系统发送用于显示给第一用户的卡片堆叠接口 ,其中所述卡堆叠接口包括所述卡簇中的一个或多个。

    SYSTEMS AND METHODS FOR ATTRIBUTING TEXT PORTIONS TO CONTENT SOURCES BASED ON TEXT ANALYSIS
    5.
    发明申请
    SYSTEMS AND METHODS FOR ATTRIBUTING TEXT PORTIONS TO CONTENT SOURCES BASED ON TEXT ANALYSIS 审中-公开
    基于文本分析将文本部分归入内容来源的系统和方法

    公开(公告)号:US20170024430A1

    公开(公告)日:2017-01-26

    申请号:US14809027

    申请日:2015-07-24

    Applicant: Facebook, Inc.

    CPC classification number: G06F9/543 G06F16/48 G06F16/58 G06F16/7867

    Abstract: Systems, methods, and non-transitory computer-readable media can acquire a text portion to be included in a communication. A search of text associated with a set of content sources can be requested. An identification of a subset of one or more content sources, out of the set of content sources, that are each associated with respective text that at least meets a specified threshold confidence level of matching the text portion can be received. Information associated with a selected content source out of the subset can be provided for inclusion in the communication. The information can suggest, at least in part, that the text portion is attributable to the selected content source.

    Abstract translation: 系统,方法和非暂时的计算机可读介质可以获取要包括在通信中的文本部分。 可以请求与一组内容源相关联的文本的搜索。 可以接收与该文本部分至少满足指定的阈值置信水平的各文本相关联的一组内容源中的一个或多个内容源的子集的识别。 可以提供与子集中的所选内容源相关联的信息以包含在通信中。 该信息可以至少部分地建议文本部分归因于所选择的内容源。

    Generating Card Stacks with Queries on Online Social Networks
    6.
    发明申请
    Generating Card Stacks with Queries on Online Social Networks 审中-公开
    在线社交网络上产生具有查询的卡片堆栈

    公开(公告)号:US20150178397A1

    公开(公告)日:2015-06-25

    申请号:US14568642

    申请日:2014-12-12

    Applicant: FACEBOOK, INC.

    Abstract: In one embodiment, a method includes receiving, from a client device of a user of an online social network, an input from the user to access a card-stack interface, generating a plurality of cards, where each card comprises a suggested query referencing a query-domain associated with the online social network and one or more query-filters, and where each query-filter references one or more objects of the online social network, each card further comprising one or more search results corresponding to the suggested query, and each search result referencing an object of the online social network matching the suggested query of the card; and sending, to the client device in response to the input from the first user, the card-stack interface for display to the first user, wherein the card-stack interface comprises one or more of the generated cards

    Abstract translation: 在一个实施例中,一种方法包括从在线社交网络的用户的客户端设备接收来自用户的输入以访问卡堆栈接口,生成多个卡,其中每个卡包括引用一个 与在线社交网络相关联的查询域和一个或多个查询过滤器,并且其中每个查询过滤器引用在线社交网络的一个或多个对象,每个卡还包括与建议的查询相对应的一个或多个搜索结果,以及 每个搜索结果引用在线社交网络的对象匹配卡的建议查询; 以及响应于来自所述第一用户的输入,向所述客户端设备发送用于向所述第一用户显示的所述卡堆栈接口,其中所述卡堆栈接口包括所生成的卡中的一个或多个

    Maintaining cached data extracted from a linked resource

    公开(公告)号:US09832284B2

    公开(公告)日:2017-11-28

    申请号:US14141678

    申请日:2013-12-27

    Applicant: Facebook, Inc.

    CPC classification number: H04L67/42 G06F17/30902 H04L67/2842

    Abstract: Exemplary methods, apparatuses, and systems include a network service receiving a request including a hyperlink. The network service acquires data from a resource referenced by the hyperlink. The network service stores the acquired data within a network service cache and sets a refresh interval. The network service utilizes the stored data to respond to additional requests including the hyperlink received during the refresh interval. The network service reacquires data from the resource after the expiration of the refresh interval. The refresh interval is updated by increasing or decreasing a frequency of the refresh interval in response to an amount of change to data associated with the resource over time.

    Ranking Recommended Search Queries
    8.
    发明申请
    Ranking Recommended Search Queries 审中-公开
    排名推荐搜索查询

    公开(公告)号:US20160335270A1

    公开(公告)日:2016-11-17

    申请号:US15222072

    申请日:2016-07-28

    Applicant: Facebook, Inc.

    Abstract: In one embodiment, a method includes receiving, from a client system of a first user of the communication system, an input from the first user to access a card-stack interface, generating a card cluster comprising a plurality of cards, each card comprising a suggested query referencing a query-domain and one or more query-filters, wherein each query-filter references one or more objects associated with the communication system, and wherein each card in the card cluster is ranked within the card cluster based on a predicted click-thru rate (CTR) for the card based on one or more user-engagement factors, and sending, to the client system in response to the input from the first user, the card-stack interface for display to the first user, wherein the card-stack interface comprises the card cluster, the cards of the card cluster being ordered based on the rankings associated with the cards.

    Abstract translation: 在一个实施例中,一种方法包括从客户端系统接收通信系统的第一用户的来自第一用户的输入以访问卡堆栈接口,生成包括多个卡的卡簇,每个卡包括 建议的查询引用查询域和一个或多个查询过滤器,其中每个查询过滤器引用与通信系统相关联的一个或多个对象,并且其中卡集群中的每个卡基于预测的点击被排在卡集群内 - 基于一个或多个用户参与因素的卡的通过率(CTR),并且响应于来自第一用户的输入向客户端系统发送用于向第一用户显示的卡堆栈接口,其中, 卡堆栈接口包括卡簇,基于与卡相关联的排名来订购卡簇的卡。

    MAINTAINING CACHED DATA EXTRACTED FROM A LINKED RESOURCE
    9.
    发明申请
    MAINTAINING CACHED DATA EXTRACTED FROM A LINKED RESOURCE 有权
    维护从链接的资源中提取的缓存数据

    公开(公告)号:US20150186390A1

    公开(公告)日:2015-07-02

    申请号:US14141678

    申请日:2013-12-27

    Applicant: Facebook, Inc.

    CPC classification number: H04L67/42 G06F17/30902 H04L67/2842

    Abstract: Exemplary methods, apparatuses, and systems include a network service receiving a request including a hyperlink. The network service acquires data from a resource referenced by the hyperlink. The network service stores the acquired data within a network service cache and sets a refresh interval. The network service utilizes the stored data to respond to additional requests including the hyperlink received during the refresh interval. The network service reacquires data from the resource after the expiration of the refresh interval. The refresh interval is updated by increasing or decreasing a frequency of the refresh interval in response to an amount of change to data associated with the resource over time.

    Abstract translation: 示例性方法,装置和系统包括接收包括超链接的请求的网络服务。 网络服务从超链接引用的资源获取数据。 网络服务将获取的数据存储在网络服务高速缓存内并设置刷新间隔。 网络服务利用所存储的数据来响应包括在刷新间隔期间接收的超链接的附加请求。 网络服务在刷新间隔到期后重新获取资源中的数据。 响应于与资源相关联的数据随时间的变化量,增加或减少刷新间隔的频率来更新刷新间隔。

    Grouping recommended search queries in card clusters

    公开(公告)号:US10268733B2

    公开(公告)日:2019-04-23

    申请号:US15147305

    申请日:2016-05-05

    Applicant: Facebook, Inc.

    Abstract: In one embodiment, a method includes receiving, from a client system of a first user of a communication network, an input from the first user to access a card-stack interface, generating one or more card clusters from a plurality of cards, each card comprising a query referencing a query-domain associated with the communication network and zero or more query-filters for the query-domain, wherein each query-filter references one or more objects of the communication network, each card cluster comprising one or more cards from the plurality of cards, the cards being formed into card clusters based on a card-affinity between the cards, and sending, to the client system in response to the input from the first user, the card-stack interface for display to the first user, wherein the card-stack interface comprises one or more of the card clusters.

Patent Agency Ranking