公开(公告)号：US20080070209A1

公开(公告)日：2008-03-20

申请号：US11533742

申请日：2006-09-20

申请人： Dong Zhuang ,  Benyu Zhang ,  Heng Zhang ,  Jeremy Tantrum ,  Teresa Mah ,  Hua-Jun Zeng ,  Zheng Chen ,  Jian Wang

发明人： Dong Zhuang ,  Benyu Zhang ,  Heng Zhang ,  Jeremy Tantrum ,  Teresa Mah ,  Hua-Jun Zeng ,  Zheng Chen ,  Jian Wang

IPC分类号： G09B19/00

CPC分类号： G06Q30/02 ,  G06Q10/10

摘要： An influential persons identification system and method for identifying a set of influential persons (or influencers) in a social network (such as an online social network). The influential persons set is generated such that by sending a message to the set the message will be propagated through the network at the greatest speed and coverage. A ranking of users is generated, and a pruning process is performed starting with the top-ranked user and working down the list. For each user on the list, the user is identified as an influencer and then the user and each of his friends are deleted from the social network users list. Next, the same process is performed for the second-ranked user, the third-ranked user, and so forth. The process terminates when the list of users of the social network is exhausted or the desired number of influencers on the influential person set is reached.

摘要翻译： 在社交网络（如在线社交网络）中识别一组有影响力的人（或影响者）的有影响力的人员识别系统和方法。 产生有影响力的人员，通过发送消息给消息集，消息将以最大的速度和覆盖率通过网络传播。 生成用户排名，并从顶级用户开始执行修剪过程，并在列表中执行操作。 对于列表中的每个用户，用户被识别为影响者，然后从社交网络用户列表中删除用户和他的每个朋友。 接下来，对于第二等级的用户，第三等级的用户等执行相同的处理。 当社交网络的用户列表用完或者达到期望数量的有影响力的人集合的影响者时，该过程终止。

公开(公告)号：US08359276B2

公开(公告)日：2013-01-22

申请号：US11533742

申请日：2006-09-20

申请人： Dong Zhuang ,  Benyu Zhang ,  Heng Zhang ,  Jeremy Tantrum ,  Teresa Mah ,  Hua-Jun Zeng ,  Zheng Chen ,  Jian Wang

发明人： Dong Zhuang ,  Benyu Zhang ,  Heng Zhang ,  Jeremy Tantrum ,  Teresa Mah ,  Hua-Jun Zeng ,  Zheng Chen ,  Jian Wang

IPC分类号： G06Q99/00

CPC分类号： G06Q30/02 ,  G06Q10/10

摘要： An influential persons identification system and method for identifying a set of influential persons (or influencers) in a social network (such as an online social network). The influential persons set is generated such that by sending a message to the set the message will be propagated through the network at the greatest speed and coverage. A ranking of users is generated, and a pruning process is performed starting with the top-ranked user and working down the list. For each user on the list, the user is identified as an influencer and then the user and each of his friends are deleted from the social network users list. Next, the same process is performed for the second-ranked user, the third-ranked user, and so forth. The process terminates when the list of users of the social network is exhausted or the desired number of influencers on the influential person set is reached.

摘要翻译： 在社交网络（如在线社交网络）中识别一组有影响力的人（或影响者）的有影响力的人员识别系统和方法。 产生有影响力的人员，通过发送消息给消息集，消息将以最大的速度和覆盖率通过网络传播。 生成用户排名，并从顶级用户开始执行修剪过程，并在列表中执行操作。 对于列表中的每个用户，用户被识别为影响者，然后从社交网络用户列表中删除用户和他的每个朋友。 接下来，对于第二等级的用户，第三等级的用户等执行相同的处理。 当社交网络的用户列表用完或者达到期望数量的有影响力的人集合的影响者时，该过程终止。

公开(公告)号：US20080126411A1

公开(公告)日：2008-05-29

申请号：US11535160

申请日：2006-09-26

申请人： Dong Zhuang ,  Benyu Zhang ,  Heng Zhang ,  Jeremy Tantrum ,  Teresa B. Mah ,  Hua-Jun Zeng ,  Zheng Chen ,  Jian Wang

发明人： Dong Zhuang ,  Benyu Zhang ,  Heng Zhang ,  Jeremy Tantrum ,  Teresa B. Mah ,  Hua-Jun Zeng ,  Zheng Chen ,  Jian Wang

IPC分类号： G06F7/00

CPC分类号： G06Q30/02 ,  G06Q10/04

摘要： A system, method, computer-readable media, and related techniques are disclosed for predicting demographic information of a user. A social link network is created and a search request for demographic information related to a first user within the social link network is received. The requested demographic information based on the demographic information of other users connected to the first user within the social link network is provided.

摘要翻译： 公开了一种用于预测用户的人口统计信息的系统，方法，计算机可读介质和相关技术。 创建社交链接网络，并且接收与社交链路网络内的第一用户相关的针对人口统计信息的搜索请求。 提供了基于在社交网络中连接到第一用户的其他用户的人口统计信息的请求的人口统计信息。

公开(公告)号：US20080104225A1

公开(公告)日：2008-05-01

申请号：US11555279

申请日：2006-11-01

申请人： Heng Zhang ,  Benyu Zhang ,  Teresa Mah ,  Dong Zhuang ,  Jeremy Tantrum ,  Ying Li

发明人： Heng Zhang ,  Benyu Zhang ,  Teresa Mah ,  Dong Zhuang ,  Jeremy Tantrum ,  Ying Li

IPC分类号： G06F15/173 ,  G06F15/177

CPC分类号： H04L67/306 ,  G06Q50/01 ,  H04L67/36

摘要： A social network visualization and mining system that includes a visualization application for mining social networks of users in an online social network. This visualization can be used to mine the social network for additional information and intelligence. The social network is displaying in graphical form, such as a node-link graph, with a center node representing the social network of a user being examined, and secondary nodes represent the primary user's friends. Lines represent links between the primary user and his friends, while various visualization features such as line thickness, line color, and text size are used to easily identify the type of relationship between users. The system also includes a topics visualization module, which builds and displays a social network based on a certain topic or keyword that is entered by the application user. A demographic prediction module examines a user's social network to predict demographics of users.

摘要翻译： 一种社交网络可视化和挖掘系统，其中包括在在线社交网络中挖掘用户社交网络的可视化应用程序。 这种可视化可用于挖掘社交网络以获取更多信息和智能。 社交网络以图形形式显示，例如节点链接图，中心节点表示正在检查的用户的社交网络，次要节点表示主要用户的朋友。 线代表主要用户和他的朋友之间的链接，而各种可视化功能（如线条粗细，线条颜色和文字大小）用于轻松识别用户之间的关系类型。 该系统还包括主题可视化模块，其基于由应用程序用户输入的某个主题或关键字构建和显示社交网络。 人口统计预测模块检查用户的社交网络以预测用户的人口统计。

公开(公告)号：US07627542B2

公开(公告)日：2009-12-01

申请号：US11534616

申请日：2006-09-22

申请人： Jeremy Tantrum ,  Heng Zhang ,  Teresa B. Mah ,  Benyu Zhang ,  Abhinai Srivastava

发明人： Jeremy Tantrum ,  Heng Zhang ,  Teresa B. Mah ,  Benyu Zhang ,  Abhinai Srivastava

IPC分类号： G06F15/18 ,  G06E1/00 ,  G06G7/00

CPC分类号： H04L67/1008 ,  G06K9/6219 ,  H04L67/1002 ,  H04L67/101 ,  H04L67/1012 ,  H04L67/125

摘要： A method and system are provided for identifying groups in large-scale networks. The large-scale networks include a collection of nodes and edges that may represent relationships between entities or individuals. The large-scale network is split into a number of fractions satisfying an edge threshold. In turn, the nodes in each fraction are merged to generate one or more clusters based on a specified similarity metric. The large-scale network is recursively split and clustered until distinct groups are identified.

摘要翻译： 提供了一种用于识别大型网络中的组的方法和系统。 大规模网络包括可以表示实体或个体之间的关系的节点和边的集合。 大规模网络被分解成满足边缘阈值的多个分数。 反过来，每个部分中的节点被合并以基于指定的相似度度量生成一个或多个聚类。 大规模网络被递归分割和聚类，直到不同的组被识别。

公开(公告)号：US20080126523A1

公开(公告)日：2008-05-29

申请号：US11534616

申请日：2006-09-22

申请人： Jeremy Tantrum ,  Heng Zhang ,  Teresa B. Mah ,  Benyu Zhang ,  Abhinai Srivastava

发明人： Jeremy Tantrum ,  Heng Zhang ,  Teresa B. Mah ,  Benyu Zhang ,  Abhinai Srivastava

IPC分类号： G06F15/16

CPC分类号： H04L67/1008 ,  G06K9/6219 ,  H04L67/1002 ,  H04L67/101 ,  H04L67/1012 ,  H04L67/125

摘要： A method and system are provided for identifying groups in large-scale networks. The large-scale networks include a collection of nodes and edges that may represent relationships between entities or individuals. The large-scale network is split into a number of fractions satisfying an edge threshold. In turn, the nodes in each fraction are merged to generate one or more clusters based on a specified similarity metric. The large-scale network is recursively split and clustered until distinct groups are identified.

摘要翻译： 提供了一种用于识别大型网络中的组的方法和系统。 大规模网络包括可以表示实体或个体之间的关系的节点和边的集合。 大规模网络被分解成满足边缘阈值的多个分数。 反过来，每个部分中的节点被合并以基于指定的相似度度量生成一个或多个聚类。 大规模网络被递归分割和聚类，直到不同的组被识别。

公开(公告)号：US20100332564A1

公开(公告)日：2010-12-30

申请号：US12876610

申请日：2010-09-07

申请人： Jeremy Tantrum

发明人： Jeremy Tantrum

IPC分类号： G06F17/30

CPC分类号： G06K9/6219 ,  G06F16/35

摘要： Methods and computer storage media for clustering nodes are provided. An input file is received that is comprised of primary nodes, secondary nodes and metrics that relate to the association between the primary nodes and the secondary nodes. Upon receiving the input file, the input file may be abridged to reduce the number of nodes contained in the input file. The unique initial primary nodes may then be clustered with their associated secondary node. The clusters containing the unique initial primary nodes may then be replaced if a subsequent related cluster satisfies a pre-defined condition. In some embodiments, multiple clusters may then be merged until the cluster size reaches a pre-defined size. In some embodiments, the input file is may be cleaned and sorted prior to being abridged.

摘要翻译： 提供了聚类节点的方法和计算机存储介质。 接收到由与主节点和次节点之间的关联相关的主节点，次节点和度量组成的输入文件。 在接收到输入文件时，输入文件可以被简化以减少包含在输入文件中的节点的数量。 然后可以将唯一的初始主节点与其相关联的辅助节点聚类。 如果随后的相关集群满足预定义条件，则可以替换包含唯一初始主节点的集群。 在一些实施例中，然后可以合并多个群集，直到群集大小达到预定义的大小。 在一些实施例中，输入文件可以在被简化之前被清理和分类。

公开(公告)号：US20100325110A1

公开(公告)日：2010-12-23

申请号：US12853435

申请日：2010-08-10

申请人： Jeremy Tantrum

发明人： Jeremy Tantrum

IPC分类号： G06F17/30

CPC分类号： G06F17/30705 ,  G06K9/6219

摘要： Methods and computer storage media for clustering nodes are provided. An input file is received that is comprised of primary nodes, secondary nodes and metrics that relate to the association between the primary nodes and the secondary nodes. Upon receiving the input file, the input file is abridged to reduce the number of nodes contained in the input file. The unique initial primary nodes are then clustered with their associated secondary node. The clusters containing the unique initial primary nodes are replaced if a subsequent related cluster satisfies a pre-defined condition. In some embodiments, multiple clusters are then merged until the cluster size reaches a pre-defined size. In some embodiments, the input file is cleaned and sorted prior to being abridged.

摘要翻译： 提供了聚类节点的方法和计算机存储介质。 接收到由与主节点和次节点之间的关联相关的主节点，次节点和度量组成的输入文件。 在接收到输入文件时，输入文件被简化以减少输入文件中包含的节点的数量。 然后将唯一的初始主节点与其相关联的辅助节点进行聚类。 如果后续相关的集群满足预定义的条件，则将替换包含唯一初始主节点的集群。 在一些实施例中，然后合并多个簇直到簇大小达到预定义的大小。 在一些实施例中，输入文件在被简化之前被清理和分类。

公开(公告)号：US07818322B2

公开(公告)日：2010-10-19

申请号：US12036720

申请日：2008-02-25

申请人： Jeremy Tantrum

发明人： Jeremy Tantrum

IPC分类号： G06F17/30

CPC分类号： G06F17/30705 ,  G06K9/6219

摘要： Methods and computer storage media for clustering nodes are provided. An input file is received that is comprised of primary nodes, secondary nodes and metrics that relate to the association between the primary nodes and the secondary nodes. Upon receiving the input file, the input file is abridged to reduce the number of nodes contained in the input file. The unique initial primary nodes are then clustered with their associated secondary node. The clusters containing the unique initial primary nodes are replaced if a subsequent related cluster satisfies a pre-defined condition. In some embodiments, multiple clusters are then merged until the cluster size reaches a pre-defined size. In some embodiments, the input file is cleaned and sorted prior to being abridged.

摘要翻译： 提供了聚类节点的方法和计算机存储介质。 接收到由与主节点和次节点之间的关联相关的主节点，次节点和度量组成的输入文件。 在接收到输入文件时，输入文件被简化以减少输入文件中包含的节点的数量。 然后将唯一的初始主节点与其相关联的辅助节点进行聚类。 如果后续相关的集群满足预定义的条件，则将替换包含唯一初始主节点的集群。 在一些实施例中，然后合并多个簇直到簇大小达到预定义的大小。 在一些实施例中，输入文件在被简化之前被清理和分类。

公开(公告)号：US08150853B2

公开(公告)日：2012-04-03

申请号：US12853435

申请日：2010-08-10

申请人： Jeremy Tantrum

发明人： Jeremy Tantrum

IPC分类号： G06F17/30

CPC分类号： G06F17/30705 ,  G06K9/6219

摘要： Methods and computer storage media for clustering nodes are provided. An input file is received that is comprised of primary nodes, secondary nodes and metrics that relate to the association between the primary nodes and the secondary nodes. Upon receiving the input file, the input file is abridged to reduce the number of nodes contained in the input file. The unique initial primary nodes are then clustered with their associated secondary node. The clusters containing the unique initial primary nodes are replaced if a subsequent related cluster satisfies a pre-defined condition. In some embodiments, multiple clusters are then merged until the cluster size reaches a pre-defined size. In some embodiments, the input file is cleaned and sorted prior to being abridged.

摘要翻译： 提供了聚类节点的方法和计算机存储介质。 接收到由与主节点和次节点之间的关联相关的主节点，次节点和度量组成的输入文件。 在接收到输入文件时，输入文件被简化以减少输入文件中包含的节点的数量。 然后将唯一的初始主节点与其相关联的辅助节点进行聚类。 如果后续相关的集群满足预定义的条件，则将替换包含唯一初始主节点的集群。 在一些实施例中，然后合并多个簇直到簇大小达到预定义的大小。 在一些实施例中，输入文件在被简化之前被清理和分类。