会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Clustering a User's Connections in a Social Networking System
    • 在社交网络系统中聚合用户连接
    • US20130013682A1
    • 2013-01-10
    • US13179547
    • 2011-07-10
    • Yun-Fang JuanMing Hua
    • Yun-Fang JuanMing Hua
    • G06F15/16
    • G06Q50/01
    • A user's connections in a social networking system are grouped into a number of clusters based on a measure of the connections' relationships, or affinity, to each other. The affinities among the connections are based on the connections' own relationships and indicate a likelihood that the connections are in the same social circles. The clusters are formed based on the affinities among the user's connections, where the clusters tend to have connections that have relatively high affinities with the other connections the same cluster as compared to the connections who are not in the same cluster. An iterative hierarchical clustering algorithm may be used to collapse the connections into clusters based on affinities between pairs of the connections.
    • 基于对彼此的连接关系或亲和度的度量,社交网络系统中的用户的连接被分组为多个聚类。 连接之间的亲和力基于连接自身的关系,并指出连接在同一个社交圈中的可能性。 基于用户连接之间的亲和度形成集群,其中集群倾向于具有与不在同一集群中的连接相比具有相同集群的其他连接具有相对高亲和度的连接。 可以使用迭代层次聚类算法基于连接对之间的亲和度将连接折叠成簇。
    • 2. 发明申请
    • Top Friend Prediction for Users in a Social Networking System
    • 社交网络系统中用户的热门朋友预测
    • US20120271722A1
    • 2012-10-25
    • US13093744
    • 2011-04-25
    • Yun-Fang JuanMing Hua
    • Yun-Fang JuanMing Hua
    • G06Q30/02G06F15/18
    • G06Q10/04
    • A social networking system predicts a user's top friends among the user's connections in a social networking system. A top friend prediction model receives static data and statistics related to the historical interactions of the connection and the user as input singles. The model may be trained using a training set of data associated with the connections of users, where users have explicitly indicated that other users are or are not their top (or “best” or “closest”) friends. The trained model outputs a score for each of a particular user's connections, and the score is used to predict whether the connection is a top friend of that user. Whether a user's connection is one of that user's top friends thus indicates a closeness of that relationship in the real world, which may differ from how likely the users are to interact with each other within the social networking system.
    • 社交网络系统预测用户在社交网络系统中的用户连接中的最佳朋友。 顶级朋友预测模型接收与连接和用户的历史相互作用相关的静态数据和统计信息作为输入单个。 可以使用与用户的连接相关联的数据的训练集来训练该模型,其中用户明确地指出其他用户是或不是他们的顶部(或最佳或最接近)的朋友。 经过训练的模型为每个特定用户的连接输出分数,并且分数用于预测该连接是否是该用户的最佳朋友。 用户的连接是否是该用户的顶级朋友之一,因此表明该关系在现实世界中的接近度,这可能与用户在社交网络系统内彼此交互的可能性有差异。
    • 4. 发明申请
    • Contextually Relevant Affinity Prediction in a Social Networking System
    • 社交网络系统中的相关亲和度预测
    • US20120166532A1
    • 2012-06-28
    • US12978265
    • 2010-12-23
    • Yun-Fang JuanMing Hua
    • Yun-Fang JuanMing Hua
    • G06F15/16
    • G06Q30/0224G06Q50/01
    • A tunable affinity function serves one or more processes running in a social networking environment, where each process may request a measure of affinity for a particular user. A module that implements the affinity function computes the requested measure of affinity by combining (e.g., adding) a weighted set of predictor functions, where each predictor function predicts whether the user will perform a different action. The weights are provided by the process that requests the measure of affinity, which allows the requesting process to weight the predictor functions differently and thus tune the affinity function for its own purpose.
    • 可调亲和度功能服务于在社交网络环境中运行的一个或多个进程,其中每个进程可以请求对特定用户的亲和度的度量。 实现亲和度功能的模块通过组合(例如,添加)预测器函数的加权集合来计算所请求的亲和度度量,其中每个预测器函数预测用户是否将执行不同的动作。 权重由请求亲和度测量的过程提供,这允许请求过程对预测器的功能进行不同的加权,并因此调整亲和力功能以达到其自身目的。
    • 6. 发明授权
    • Customized predictors for user actions in an online system
    • 在线系统中用户操作的自定义预测因子
    • US09317812B2
    • 2016-04-19
    • US13689969
    • 2012-11-30
    • Igor KabiljoAleksandar IlicMing HuaHong Yan
    • Igor KabiljoAleksandar IlicMing HuaHong Yan
    • G06N99/00G06Q30/02G06Q50/00
    • G06N99/005G06Q30/02G06Q50/01
    • Online systems generate predictors for predicting actions of users of the online system. The online system receives requests to generate predictor models for predicting whether a user is likely to take an action of a particular action type. The request specifies the type of action and criteria for identifying a successful instance of the action type and a failure instance of the action type. The online system collects data including successful and failure instances of the action type. The online system generates one or more predictors of different types using the generated data. The online system evaluates and compares the performance of the different predictors generated and selects a predictor based on the performance. The online system returns a handle to access the generated predictor to the requester of the predictor.
    • 在线系统生成用于预测在线系统用户的动作的预测因子。 在线系统接收生成用于预测用户是否可能采取特定动作类型的动作的预测器模型的请求。 请求指定用于标识操作类型的成功实例的动作类型和标准,以及动作类型的失败实例。 在线系统收集数据,包括操作类型的成功和失败实例。 在线系统使用生成的数据生成不同类型的一个或多个预测变量。 在线系统评估并比较生成的不同预测变量的性能,并根据性能选择预测变量。 在线系统返回一个句柄来访问生成的预测变量到预测变量的请求者。
    • 7. 发明申请
    • UPDATING FEATURES BASED ON USER ACTIONS IN ONLINE SYSTEMS
    • 基于在线系统的用户行为的更新功能
    • US20140156744A1
    • 2014-06-05
    • US13690254
    • 2012-11-30
    • Ming HuaHong Yan
    • Ming HuaHong Yan
    • G06Q10/10
    • G06F17/30958G06F17/30345G06Q30/0251G06Q50/01H04L65/403
    • Online systems, for example, social networking systems store features describing relations between entities represented in the online system. The information describing the features is represented as a graph. The online system maintains a cumulative feature graph and an incremental feature graph. Feature values based on recent user actions are stored in the incremental graph and feature values based on previous actions are stored in the cumulative graph. Periodically, the information stored in the incremental feature graph is merged with the information stored in the cumulative feature graph. The incremental graph is marked as inactive during the merge and information based on new user actions is stored in an active incremental feature graph. If a request for feature information is received, the feature information obtained from the cumulative feature graph, inactive incremental feature graph and the active incremental feature graph are combined to determine the feature information.
    • 在线系统,例如,社交网络系统存储描述在线系统中表示的实体之间的关系的特征。 描述特征的信息表示为图形。 在线系统维护累积特征图和增量特征图。 基于最近用户动作的特征值存储在增量图中,基于先前动作的特征值存储在累积图中。 定期地,存储在增量特征图中的信息与存储在累积特征图中的信息合并。 增量图在合并期间被标记为不活动,而基于新用户操作的信息存储在活动增量特征图中。 如果接收到对特征信息的请求,则从累积特征图,非活动增量特征图和活动增量特征图获得的特征信息被组合以确定特征信息。