利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

119 条记录 (耗时 0.029 秒)

    Adpost: a centralized advertisement platform
    12.
    发明申请
    Adpost: a centralized advertisement platform 审中-公开
    Adpost：一个集中的广告平台

    公开(公告)号：US20060259356A1

    公开(公告)日：2006-11-16

    申请号：US11127130

    申请日：2005-05-12

    申请人： Benyu Zhang ,  Fengping Zeng ,  Hua-Jun Zeng ,  Li Li ,  Wei-Ying Ma ,  Ying Li ,  Zheng Chen ,  Tarek Najm

    发明人： Benyu Zhang ,  Fengping Zeng ,  Hua-Jun Zeng ,  Li Li ,  Wei-Ying Ma ,  Ying Li ,  Zheng Chen ,  Tarek Najm

    IPC分类号： G06Q30/00

    CPC分类号： G06Q30/02 ,  G06Q30/0256

    摘要： A method is provided to ubiquitously promote products or services provided by a plurality of advertisers across a plurality of content-based applications. The method may include receiving data from the plurality of advertisers describing the products or services provided by the plurality of advertisers. The received data is stored in an advertisement database where a user may subsequently query the advertisement database to locate data promoting a product or service. Additionally, terms and payment data are extracted from the received advertisement data to efficiently promote the products or services provided by the advertiser across the plurality of content-based applications.

    摘要翻译： 提供了一种在多个基于内容的应用程序中无处不在地促进由多个广告商提供的产品或服务的方法。 该方法可以包括从多个广告商接收描述由多个广告商提供的产品或服务的数据。 所接收的数据被存储在广告数据库中，用户随后可以查询广告数据库以定位促销产品或服务的数据。 此外，从接收到的广告数据中提取术语和支付数据，以有效地促进广告商在多个基于内容的应用程序中提供的产品或服务。

    Peer-to-peer advertisement platform
    13.
    发明授权
    Peer-to-peer advertisement platform 有权
    对等广告平台

    公开(公告)号：US08548853B2

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

    申请号：US11147247

    申请日：2005-06-08

    申请人： Benyu Zhang ,  Fengping Zeng ,  Hua-Jun Zeng ,  Li Li ,  Tarek Najm ,  Wei-Ying Ma ,  Ying Li ,  Zheng Chen

    发明人： Benyu Zhang ,  Fengping Zeng ,  Hua-Jun Zeng ,  Li Li ,  Tarek Najm ,  Wei-Ying Ma ,  Ying Li ,  Zheng Chen

    IPC分类号： G06Q30/00

    CPC分类号： G06Q30/02 ,  G06Q30/0207 ,  G06Q30/0247 ,  G06Q30/0251

    摘要： A peer-to-peer advertisement platform is provided to ubiquitously promote products or services supplied by advertisers across content-based applications executing on nodes in a peer-to-peer network. The peer-to-peer advertisement platform may include a registration component to register nodes in the peer-to-peer advertising platform, an advertisement submission component to receive advertisement data from the advertisers, and a distribution component to distribute the advertisement data to the nodes registered in the peer-to-peer advertisement platform. The peer-to-peer advertisement platform also includes a money sharing component to reward nodes based on a contribution level assigned to the node. Accordingly, the peer-to-peer advertisement platform stores the advertisement data locally at the plurality of nodes registered in the peer-to-peer advertising platform and shares a portion of the revenue generated from the advertisement data with the nodes registered in the peer-to-peer advertising platform.

    摘要翻译： 提供了一个对等广告平台，无处不在地促进广告商提供的产品或服务，基于在对等网络中的节点上执行的基于内容的应用程序。 点对点广告平台可以包括注册组件以注册对等广告平台中的节点，用于从广告商接收广告数据的广告提交组件以及将广告数据分发到节点的分发组件 注册在对等广告平台。 点对点广告平台还包括基于分配给节点的贡献级别来奖励节点的钱共享组件。 因此，点对点广告平台将广告数据本地存储在登记在对等广告平台中的多个节点处，并且共享从广告数据生成的收入的一部分， 对等广告平台。

    Peer-to-peer advertisement platform
    14.
    发明申请
    Peer-to-peer advertisement platform 有权

    公开(公告)号：US20060282309A1

    公开(公告)日：2006-12-14

    申请号：US11147247

    申请日：2005-06-08

    申请人： Benyu Zhang ,  Fengping Zeng ,  Hua-Jun Zeng ,  Li Li ,  Tarek Najm ,  Wei-Ying Ma ,  Ying Li ,  Zheng Chen

    发明人： Benyu Zhang ,  Fengping Zeng ,  Hua-Jun Zeng ,  Li Li ,  Tarek Najm ,  Wei-Ying Ma ,  Ying Li ,  Zheng Chen

    IPC分类号： G06Q30/00

    CPC分类号： G06Q30/02 ,  G06Q30/0207 ,  G06Q30/0247 ,  G06Q30/0251

    摘要： A peer-to-peer advertisement platform is provided to ubiquitously promote products or services supplied by advertisers across content-based applications executing on nodes in a peer-to-peer network. The peer-to-peer advertisement platform may include a registration component to register nodes in the peer-to-peer advertising platform, an advertisement submission component to receive advertisement data from the advertisers, and a distribution component to distribute the advertisement data to the nodes registered in the peer-to-peer advertisement platform. The peer-to-peer advertisement platform also includes a money sharing component to reward nodes based on a contribution level assigned to the node. Accordingly, the peer-to-peer advertisement platform stores the advertisement data locally at the plurality of nodes registered in the peer-to-peer advertising platform and shares a portion of the revenue generated from the advertisement data with the nodes registered in the peer-to-peer advertising platform.

    IDENTIFYING INFLUENTIAL PERSONS IN A SOCIAL NETWORK
    17.
    发明申请
    IDENTIFYING INFLUENTIAL PERSONS IN A SOCIAL NETWORK 有权
    在社会网络中识别受影响人

    公开(公告)号：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.

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

    Key phrase navigation map for document navigation
    18.
    发明申请
    Key phrase navigation map for document navigation 失效
    关键短语导航地图文件导航

    公开(公告)号：US20070219945A1

    公开(公告)日：2007-09-20

    申请号：US11372365

    申请日：2006-03-09

    申请人： Min Wang ,  Benyu Zhang ,  Hua-Jun Zeng ,  Jian Wang ,  Shiguang Liu ,  Zheng Chen

    发明人： Min Wang ,  Benyu Zhang ,  Hua-Jun Zeng ,  Jian Wang ,  Shiguang Liu ,  Zheng Chen

    IPC分类号： G06F17/30 ,  G06F3/048

    CPC分类号： G06F17/30713 ,  G06F17/272 ,  G06F17/2775 ,  G06F17/30643 ,  Y10S707/92

    摘要： Computer-readable media having computer-executable instructions and apparatuses provide a keyphrase navigation map (KNM) for a document page. Keyphrases are extracted from the document page. Keyphrase clusters are subsequently formed by a measure of relevancy, and a salient keyphrase is determined for each cluster. A thumbnail is formed with tags corresponding to the salient keyphrases. A selected tag is expanded with associated keyphrases. An associated keyphrase may be further selected in order to facilitate the navigation of the document page. The displayed tags on the thumbnail are positioned in accordance with locations of associated keyphrases in the document page.

    摘要翻译： 具有计算机可执行指令和装置的计算机可读介质为文档页面提供关键词导航映射（KNM）。 从文档页面提取关键短语。 随后通过相关性的量度形成关键词组，并且为每个簇确定显着的关键短语。 使用与突出关键短语相对应的标签形成缩略图。 所选标签用相关的关键短语展开。 可以进一步选择相关联的关键短语，以便于文档页面的导航。 缩略图上显示的标签根据文档页面中相关联的关键短语的位置进行定位。

    Text classification by weighted proximal support vector machine based on positive and negative sample sizes and weights
    19.
    发明授权
    Text classification by weighted proximal support vector machine based on positive and negative sample sizes and weights 有权
    基于正，负样本大小和权重的加权近端支持向量机进行文本分类

    公开(公告)号：US07707129B2

    公开(公告)日：2010-04-27

    申请号：US11384889

    申请日：2006-03-20

    申请人： Dong Zhuang ,  Benyu Zhang ,  Zheng Chen ,  Hua-Jun Zeng ,  Jian Wang

    发明人： Dong Zhuang ,  Benyu Zhang ,  Zheng Chen ,  Hua-Jun Zeng ,  Jian Wang

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

    CPC分类号： G06F17/30707 ,  G06K9/6269

    摘要： Embodiments of the invention relate to improvements to the support vector machine (SVM) classification model. When text data is significantly unbalanced (i.e., positive and negative labeled data are in disproportion), the classification quality of standard SVM deteriorates. Embodiments of the invention are directed to a weighted proximal SVM (WPSVM) model that achieves substantially the same accuracy as the traditional SVM model while requiring significantly less computational time. A weighted proximal SVM (WPSVM) model in accordance with embodiments of the invention may include a weight for each training error and a method for estimating the weights, which automatically solves the unbalanced data problem. And, instead of solving the optimization problem via the KKT (Karush-Kuhn-Tucker) conditions and the Sherman-Morrison-Woodbury formula, embodiments of the invention use an iterative algorithm to solve an unconstrained optimization problem, which makes WPSVM suitable for classifying relatively high dimensional data.

    摘要翻译： 本发明的实施例涉及对支持向量机（SVM）分类模型的改进。 当文本数据显着不平衡（即正负标签数据不成比例）时，标准SVM的分类质量恶化。 本发明的实施例涉及一种加权近端SVM（WPSVM）模型，其实现与传统SVM模型基本相同的精度，同时需要显着更少的计算时间。 根据本发明的实施例的加权近端SVM（WPSVM）模型可以包括每个训练误差的权重和用于估计权重的方法，其自动地解决不平衡数据问题。 而且，不是通过KKT（Karush-Kuhn-Tucker）条件和Sherman-Morrison-Woodbury公式来解决优化问题，而是本发明的实施例使用迭代算法来解决无约束优化问题，这使得WPSVM适合于相对分类 高维数据。

    Text classification by weighted proximal support vector machine
    20.
    发明申请
    Text classification by weighted proximal support vector machine 有权
    通过加权近端支持向量机进行文本分类

    公开(公告)号：US20070239638A1

    公开(公告)日：2007-10-11

    申请号：US11384889

    申请日：2006-03-20

    申请人： Dong Zhuang ,  Benyu Zhang ,  Zheng Chen ,  Hua-Jun Zeng ,  Jian Wang

    发明人： Dong Zhuang ,  Benyu Zhang ,  Zheng Chen ,  Hua-Jun Zeng ,  Jian Wang

    IPC分类号： G06F15/18

    CPC分类号： G06F17/30707 ,  G06K9/6269

    摘要： Embodiments of the invention relate to improvements to the support vector machine (SVM) classification model. When text data is significantly unbalanced (i.e., positive and negative labeled data are in disproportion), the classification quality of standard SVM deteriorates. Embodiments of the invention are directed to a weighted proximal SVM (WPSVM) model that achieves substantially the same accuracy as the traditional SVM model while requiring significantly less computational time. A weighted proximal SVM (WPSVM) model in accordance with embodiments of the invention may include a weight for each training error and a method for estimating the weights, which automatically solves the unbalanced data problem. And, instead of solving the optimization problem via the KKT (Karush-Kuhn-Tucker) conditions and the Sherman-Morrison-Woodbury formula, embodiments of the invention use an iterative algorithm to solve an unconstrained optimization problem, which makes WPSVM suitable for classifying relatively high dimensional data.

    摘要翻译： 本发明的实施例涉及对支持向量机（SVM）分类模型的改进。 当文本数据显着不平衡（即正负标签数据不成比例）时，标准SVM的分类质量恶化。 本发明的实施例涉及一种加权近端SVM（WPSVM）模型，其实现与传统SVM模型基本相同的精度，同时需要显着更少的计算时间。 根据本发明的实施例的加权近端SVM（WPSVM）模型可以包括每个训练误差的权重以及用于估计权重的方法，其自动地解决不平衡数据问题。 而且，不是通过KKT（Karush-Kuhn-Tucker）条件和Sherman-Morrison-Woodbury公式来解决优化问题，而是本发明的实施例使用迭代算法来解决无约束优化问题，这使得WPSVM适合于相对分类 高维数据。