会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • VISUALIZATION APPLICATION FOR MINING OF SOCIAL NETWORKS
    • 可视化社会网络采矿申请
    • US20080104225A1
    • 2008-05-01
    • US11555279
    • 2006-11-01
    • Heng ZhangBenyu ZhangTeresa MahDong ZhuangJeremy TantrumYing Li
    • Heng ZhangBenyu ZhangTeresa MahDong ZhuangJeremy TantrumYing Li
    • G06F15/173G06F15/177
    • H04L67/306G06Q50/01H04L67/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.
    • 一种社交网络可视化和挖掘系统,其中包括在在线社交网络中挖掘用户社交网络的可视化应用程序。 这种可视化可用于挖掘社交网络以获取更多信息和智能。 社交网络以图形形式显示,例如节点链接图,中心节点表示正在检查的用户的社交网络,次要节点表示主要用户的朋友。 线代表主要用户和他的朋友之间的链接,而各种可视化功能(如线条粗细,线条颜色和文字大小)用于轻松识别用户之间的关系类型。 该系统还包括主题可视化模块,其基于由应用程序用户输入的某个主题或关键字构建和显示社交网络。 人口统计预测模块检查用户的社交网络以预测用户的人口统计。
    • 2. 发明申请
    • IDENTIFYING INFLUENTIAL PERSONS IN A SOCIAL NETWORK
    • 在社会网络中识别受影响人
    • US20080070209A1
    • 2008-03-20
    • US11533742
    • 2006-09-20
    • Dong ZhuangBenyu ZhangHeng ZhangJeremy TantrumTeresa MahHua-Jun ZengZheng ChenJian Wang
    • Dong ZhuangBenyu ZhangHeng ZhangJeremy TantrumTeresa MahHua-Jun ZengZheng ChenJian Wang
    • G09B19/00
    • G06Q30/02G06Q10/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.
    • 在社交网络(如在线社交网络)中识别一组有影响力的人(或影响者)的有影响力的人员识别系统和方法。 产生有影响力的人员,通过发送消息给消息集,消息将以最大的速度和覆盖率通过网络传播。 生成用户排名,并从顶级用户开始执行修剪过程,并在列表中执行操作。 对于列表中的每个用户,用户被识别为影响者,然后从社交网络用户列表中删除用户和他的每个朋友。 接下来,对于第二等级的用户,第三等级的用户等执行相同的处理。 当社交网络的用户列表用完或者达到期望数量的有影响力的人集合的影响者时,该过程终止。
    • 3. 发明授权
    • Identifying influential persons in a social network
    • 识别社会网络中有影响力的人物
    • US08359276B2
    • 2013-01-22
    • US11533742
    • 2006-09-20
    • Dong ZhuangBenyu ZhangHeng ZhangJeremy TantrumTeresa MahHua-Jun ZengZheng ChenJian Wang
    • Dong ZhuangBenyu ZhangHeng ZhangJeremy TantrumTeresa MahHua-Jun ZengZheng ChenJian Wang
    • G06Q99/00
    • G06Q30/02G06Q10/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.
    • 在社交网络(如在线社交网络)中识别一组有影响力的人(或影响者)的有影响力的人员识别系统和方法。 产生有影响力的人员,通过发送消息给消息集,消息将以最大的速度和覆盖率通过网络传播。 生成用户排名,并从顶级用户开始执行修剪过程,并在列表中执行操作。 对于列表中的每个用户,用户被识别为影响者,然后从社交网络用户列表中删除用户和他的每个朋友。 接下来,对于第二等级的用户,第三等级的用户等执行相同的处理。 当社交网络的用户列表用完或者达到期望数量的有影响力的人集合的影响者时,该过程终止。
    • 7. 发明申请
    • Efficient Method for Clustering Nodes
    • 聚类节点的有效方法
    • US20100332564A1
    • 2010-12-30
    • US12876610
    • 2010-09-07
    • Jeremy Tantrum
    • Jeremy Tantrum
    • G06F17/30
    • G06K9/6219G06F16/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.
    • 提供了聚类节点的方法和计算机存储介质。 接收到由与主节点和次节点之间的关联相关的主节点,次节点和度量组成的输入文件。 在接收到输入文件时,输入文件可以被简化以减少包含在输入文件中的节点的数量。 然后可以将唯一的初始主节点与其相关联的辅助节点聚类。 如果随后的相关集群满足预定义条件,则可以替换包含唯一初始主节点的集群。 在一些实施例中,然后可以合并多个群集,直到群集大小达到预定义的大小。 在一些实施例中,输入文件可以在被简化之前被清理和分类。
    • 8. 发明申请
    • Efficient Method for Clustering Nodes
    • 聚类节点的有效方法
    • US20100325110A1
    • 2010-12-23
    • US12853435
    • 2010-08-10
    • Jeremy Tantrum
    • Jeremy Tantrum
    • G06F17/30
    • G06F17/30705G06K9/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.
    • 提供了聚类节点的方法和计算机存储介质。 接收到由与主节点和次节点之间的关联相关的主节点,次节点和度量组成的输入文件。 在接收到输入文件时,输入文件被简化以减少输入文件中包含的节点的数量。 然后将唯一的初始主节点与其相关联的辅助节点进行聚类。 如果后续相关的集群满足预定义的条件,则将替换包含唯一初始主节点的集群。 在一些实施例中,然后合并多个簇直到簇大小达到预定义的大小。 在一些实施例中,输入文件在被简化之前被清理和分类。
    • 9. 发明授权
    • Efficient method for clustering nodes
    • 用于聚类节点的高效方法
    • US07818322B2
    • 2010-10-19
    • US12036720
    • 2008-02-25
    • Jeremy Tantrum
    • Jeremy Tantrum
    • G06F17/30
    • G06F17/30705G06K9/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.
    • 提供了聚类节点的方法和计算机存储介质。 接收到由与主节点和次节点之间的关联相关的主节点,次节点和度量组成的输入文件。 在接收到输入文件时,输入文件被简化以减少输入文件中包含的节点的数量。 然后将唯一的初始主节点与其相关联的辅助节点进行聚类。 如果后续相关的集群满足预定义的条件,则将替换包含唯一初始主节点的集群。 在一些实施例中,然后合并多个簇直到簇大小达到预定义的大小。 在一些实施例中,输入文件在被简化之前被清理和分类。
    • 10. 发明授权
    • Efficient method for clustering nodes
    • 用于聚类节点的高效方法
    • US08150853B2
    • 2012-04-03
    • US12853435
    • 2010-08-10
    • Jeremy Tantrum
    • Jeremy Tantrum
    • G06F17/30
    • G06F17/30705G06K9/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.
    • 提供了聚类节点的方法和计算机存储介质。 接收到由与主节点和次节点之间的关联相关的主节点,次节点和度量组成的输入文件。 在接收到输入文件时,输入文件被简化以减少输入文件中包含的节点的数量。 然后将唯一的初始主节点与其相关联的辅助节点进行聚类。 如果后续相关的集群满足预定义的条件,则将替换包含唯一初始主节点的集群。 在一些实施例中,然后合并多个簇直到簇大小达到预定义的大小。 在一些实施例中,输入文件在被简化之前被清理和分类。