专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08843394B2 Mapping identifiers 有权
标题翻译：映射标识符
公开(公告)号：US08843394B2
公开(公告)日：2014-09-23
申请号：US12818349
申请日：2010-06-18
申请人： Fei Cao , Shaoyu Zhou , Siddhartha Roy , Michael Elizarov , Zhuoqing Wu , James Zhang
发明人： Fei Cao , Shaoyu Zhou , Siddhartha Roy , Michael Elizarov , Zhuoqing Wu , James Zhang
IPC分类号： G06Q30/00 , G06Q30/02
CPC分类号： G06Q30/02 , G06Q30/0241 , G06Q30/0244 , G06Q30/0255
摘要： Systems and methods for mapping identifiers are provided. Activity logs illustrate activities and/or events associated with a plurality of identifiers. The identifiers may be registered identifiers, unregistered identifiers, or a combination thereof. When at least two identifiers share a linking attribute, the at least two identifiers may be mapped to one another, along with information associated therewith (if any) such as a user profile. Each subsequent line of an activity line may also be mapped to the identifiers of the initial single line when a linking attribute or an overlapping identifier is present. A number of identifiers associated with each other may be increased by mapping identifiers and, thus, a targeted audience for a customized advertisement may, in turn, be increased.
摘要翻译：提供了映射标识符的系统和方法。活动日志示出与多个标识符相关联的活动和/或事件。标识符可以是注册标识符，未注册标识符或其组合。当至少两个标识符共享链接属性时，可以将至少两个标识符与其相关联的信息（如果有的话）诸如用户简档映射到彼此。当存在链接属性或重叠标识符时，活动行的每个后续行也可以映射到初始单行的标识符。可以通过映射标识符来增加彼此关联的多个标识符，从而可以增加定制广告的目标受众。

2. 发明申请

US20110313847A1 MAPPING IDENTIFIERS 有权
标题翻译：映射标识符
公开(公告)号：US20110313847A1
公开(公告)日：2011-12-22
申请号：US12818349
申请日：2010-06-18
申请人： Fei Cao , Shaoyu Zhou , Siddhartha Roy , Michael Elizarov , Zhuoqing Wu , James Zhang
发明人： Fei Cao , Shaoyu Zhou , Siddhartha Roy , Michael Elizarov , Zhuoqing Wu , James Zhang
IPC分类号： G06Q30/00
CPC分类号： G06Q30/02 , G06Q30/0241 , G06Q30/0244 , G06Q30/0255
摘要： Systems and methods for mapping identifiers are provided. Activity logs illustrate activities and/or events associated with a plurality of identifiers. The identifiers may be registered identifiers, unregistered identifiers, or a combination thereof. When at least two identifiers share a linking attribute, the at least two identifiers may be mapped to one another, along with information associated therewith (if any) such as a user profile. Each subsequent line of an activity line may also be mapped to the identifiers of the initial single line when a linking attribute or an overlapping identifier is present. A number of identifiers associated with each other may be increased by mapping identifiers and, thus, a targeted audience for a customized advertisement may, in turn, be increased.
摘要翻译：提供了映射标识符的系统和方法。活动日志示出与多个标识符相关联的活动和/或事件。标识符可以是注册标识符，未注册标识符或其组合。当至少两个标识符共享链接属性时，可以将至少两个标识符与其相关联的信息（如果有的话）诸如用户简档映射到彼此。当存在链接属性或重叠标识符时，活动行的每个后续行也可以映射到初始单行的标识符。可以通过映射标识符来增加彼此关联的多个标识符，从而可以增加定制广告的目标受众。

3. 发明申请

US20120072554A1 NODE CLUSTERING 有权
标题翻译：节点聚类
公开(公告)号：US20120072554A1
公开(公告)日：2012-03-22
申请号：US12885897
申请日：2010-09-20
申请人： Fei Cao , Shaoyu Zhou , Zhuoqing Wu , Sijian Zhang , Siddhartha Roy , Michael A. Elizarov
发明人： Fei Cao , Shaoyu Zhou , Zhuoqing Wu , Sijian Zhang , Siddhartha Roy , Michael A. Elizarov
IPC分类号： G06F15/177 , G06F15/16
CPC分类号： G06Q30/02 , G06Q30/0201
摘要： Large sets of unorganized data may provide little value in identifying useful observations from such data. For example, an online merchant may maintain a database of millions of user IDs (e.g., a cookie ID, a login ID, a device ID, a network ID, etc.) along with content viewed and/or actions taken with the user IDs, where minimal associations are known between user IDs. It may be advantageous to link together user IDs of respective users to capture a comprehensive view of respective users' activities. Accordingly, one or more systems and/or techniques for identifying a cluster of nodes based upon transforming a set of node pairings (e.g., pairings of related nodes) one or more times are disclosed herein. Iterative transformations may be performed until respective nodes are paired with merely their smallest neighboring node and are paired with no other node. In this way, node clusters may be identifiable.
摘要翻译：大量无组织数据可能无法从这些数据中识别有用的观察结果。例如，在线商家可以维护数百万用户ID的数据库（例如，Cookie ID，登录ID，设备ID，网络ID等）以及与用户ID一起观看的内容和/或所采取的动作其中用户ID之间的最小关联是已知的。链接各个用户的用户ID可能是有利的，以捕获各个用户的活动的综合视图。因此，本文公开了一种或多种用于基于将一组节点配对（例如，相关节点的配对）一次或多次来识别节点簇的一个或多个系统和/或技术。可以执行迭代变换，直到各个节点仅与其最小的相邻节点配对并且与没有其他节点配对。以这种方式，节点集群可以是可识别的。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式