利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

13 条记录 (耗时 0.023 秒)

    Automatic product categorization
    1.
    发明授权
    Automatic product categorization 有权
    自动产品分类

    公开(公告)号：US07870039B1

    公开(公告)日：2011-01-11

    申请号：US10920588

    申请日：2004-08-17

    申请人： Byron Edward Dom ,  Abhishek Goyal ,  Ramnath Balasubramanyan ,  Dmitry Pavlov ,  Bipin Suresh

    发明人： Byron Edward Dom ,  Abhishek Goyal ,  Ramnath Balasubramanyan ,  Dmitry Pavlov ,  Bipin Suresh

    IPC分类号： G06F17/30

    CPC分类号： G06F17/3071 ,  G06Q30/0613 ,  G06Q30/0623

    摘要： Techniques are provided for automatic product categorization. In one aspect, the categorization is based on text and one or more other values associated with a product offering. In another aspect, a first categorization of a product offering is performed and, if the product category chosen is in a set of co-refinable product categories, then a second (or third, fourth and so on) categorization is performed among the set of co-refinable product categories. In a third aspect, products are categorized based on cost. In another aspect, after products are categorized, the products are flagged for further categorization processing if the cost for categorizing the product is beyond a predefined threshold.

    摘要翻译： 提供了自动产品分类技术。 在一个方面，分类基于文本和与产品提供相关联的一个或多个其它值。 在另一方面，执行产品提供的第一分类，并且如果所选择的产品类别是一组可共同制造的产品类别，则在该组合中执行第二（或第三，第四等等）分类 可共同的产品类别。 在第三方面，产品根据成本进行分类。 另一方面，在分类产品之后，如果产品分类的成本超出预定义的阈值，则将产品标记为进一步的分类处理。

    Identifying offensive content using user click data
    2.
    发明授权
    Identifying offensive content using user click data 有权
    使用用户点击数据识别令人反感的内容

    公开(公告)号：US08280871B2

    公开(公告)日：2012-10-02

    申请号：US11713212

    申请日：2007-03-02

    申请人： Jignashu Parikh ,  Bipin Suresh

    发明人： Jignashu Parikh ,  Bipin Suresh

    IPC分类号： G06F17/00

    CPC分类号： G06F17/30867

    摘要： Techniques are provided for designating an item as being of a particular type when the item has been selected after being returned in response to a search and by identifying which mode, of a plurality of modes, in which the search engine was operating when the item was selected.

    摘要翻译： 提供技术，用于在项目被响应于搜索返回之后被选择并且通过识别搜索引擎在项目为何时在哪个模式中操作的多个模式中的哪个模式时将项目指定为特定类型 选择。

    Predicting and ranking search query results
    3.
    发明授权
    Predicting and ranking search query results 有权
    搜索查询结果的预测和排名

    公开(公告)号：US07831595B2

    公开(公告)日：2010-11-09

    申请号：US11967851

    申请日：2007-12-31

    申请人： Bipin Suresh ,  Nikhil Garg

    发明人： Bipin Suresh ,  Nikhil Garg

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30867 ,  G06F17/30705

    摘要： Techniques are described herein for providing search results that are ranked based on a predictor that predicts, for each of a number of objects, likelihoods that each particular object will be selected at different positions on a results list.

    摘要翻译： 这里描述了技术，用于提供基于预测器进行排名的搜索结果，预测器针对多个对象中的每一个预测每个特定对象将在结果列表上的不同位置被选择的可能性。

    Method and system for finding related nodes in a social network
    4.
    发明授权
    Method and system for finding related nodes in a social network 有权
    在社交网络中查找相关节点的方法和系统

    公开(公告)号：US07016307B2

    公开(公告)日：2006-03-21

    申请号：US10797966

    申请日：2004-03-11

    申请人： Varun Vasudev ,  Bipin Suresh

    发明人： Varun Vasudev ,  Bipin Suresh

    IPC分类号： H04L12/26 ,  H04L12/28 ,  G06F15/16

    CPC分类号： H04L45/12 ,  H04W4/20 ,  H04W4/21

    摘要： A process for reducing the resources employed in real time to communicate a message between related nodes that are separated by multiple degrees of separation in a social network. At least a portion of the shortest path for the multiple degrees of separation between at least two related nodes in a social network is determined out of band prior to the initiation of a process to communicate between the related nodes. By pre-processing at least a portion of the degrees of separation for the shortest path between the nodes, the actual resources employed in real time to calculate the entire shortest path can be reduced. Typically, approximately fifty percent or more of the shortest paths for the degrees of separation between related nodes in the social network are pre-processed. Since the amount of resources for determining the shortest path for each degree of separation can exponentially increase with each degree, the pre-processing of a portion of the degrees of separation along a shortest path can significantly reduce the resources required in real time to complete the determination of the shortest path. Also, if a common intermediate node is identified in the pre-processing of the shortest paths for two nodes in the social network, the intermediate shortest paths can be stored for reuse as a complete shortest path between these two nodes.

    摘要翻译： 用于减少实时使用的资源以在社交网络中以多个分离度分离的相关节点之间传递消息的过程。 在社交网络中的至少两个相关节点之间的多个分离距离的最短路径的至少一部分在相关节点之间进行通信的过程开始之前被取决于带外。 通过对节点之间的最短路径预先处理分离度的至少一部分，可以实时地实现用于计算整个最短路径的实际资源。 通常，预先处理社交网络中相关节点之间的距离度的最短路径的大约百分之五十以上。 由于用于确定每个分离度的最短路径的资源量可以以每个程度指数地增加，所以沿着最短路径的分离度的一部分的预处理可以显着地减少实时所需的资源以完成 确定最短路径。 此外，如果在社交网络中的两个节点的最短路径的预处理中识别出公共中间节点，则可以存储中间最短路径以便重新使用作为这两个节点之间的完整的最短路径。

    Identifying offensive content using user click data
    5.
    发明申请
    Identifying offensive content using user click data 有权
    使用用户点击数据识别令人反感的内容

    公开(公告)号：US20080162540A1

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

    申请号：US11713212

    申请日：2007-03-02

    申请人： Jignashu Parikh ,  Bipin Suresh

    发明人： Jignashu Parikh ,  Bipin Suresh

    IPC分类号： G06F17/00

    CPC分类号： G06F17/30867

    摘要： Techniques are provided for designating an item as being of a particular type when the item has been selected after being returned in response to a search and by identifying which mode, of a plurality of modes, in which the search engine was operating when the item was selected.

    摘要翻译： 提供技术，用于在项目被响应于搜索返回之后被选择并且通过识别搜索引擎在项目为何时在哪个模式中操作的多个模式中的哪个模式时将项目指定为特定类型 选择。

    Method and system for finding a friend in a social network
    7.
    发明申请
    Method and system for finding a friend in a social network 有权
    在社交网络中寻找朋友的方法和系统

    公开(公告)号：US20050201290A1

    公开(公告)日：2005-09-15

    申请号：US10797966

    申请日：2004-03-11

    申请人： Varun Vasudev ,  Bipin Suresh

    发明人： Varun Vasudev ,  Bipin Suresh

    IPC分类号： H04L12/26

    CPC分类号： H04L45/12 ,  H04W4/20 ,  H04W4/21

    摘要： A process for reducing the resources employed in real time to communicate a message between related nodes that are separated by multiple degrees of separation in a social network. At least a portion of the shortest path for the multiple degrees of separation between at least two related nodes in a social network is determined out of band prior to the initiation of a process to communicate between the related nodes. By pre-processing at least a portion of the degrees of separation for the shortest path between the nodes, the actual resources employed in real time to calculate the entire shortest path can be reduced. Typically, approximately fifty percent or more of the shortest paths for the degrees of separation between related nodes in the social network are pre-processed. Since the amount of resources for determining the shortest path for each degree of separation can exponentially increase with each degree, the pre-processing of a portion of the degrees of separation along a shortest path can significantly reduce the resources required in real time to complete the determination of the shortest path. Also, if a common intermediate node is identified in the pre-processing of the shortest paths for two nodes in the social network, the intermediate shortest paths can be stored for reuse as a complete shortest path between these two nodes,

    摘要翻译： 用于减少实时使用的资源以在社交网络中以多个分离度分离的相关节点之间传递消息的过程。 在社交网络中的至少两个相关节点之间的多个分离距离的最短路径的至少一部分在相关节点之间进行通信的过程开始之前被取决于带外。 通过对节点之间的最短路径预先处理分离度的至少一部分，可以实时地实现用于计算整个最短路径的实际资源。 通常，预先处理社交网络中相关节点之间的距离度的最短路径的大约百分之五十以上。 由于用于确定每个分离度的最短路径的资源量可以以每个程度指数地增加，所以沿着最短路径的分离度的一部分的预处理可以显着地减少实时所需的资源以完成 确定最短路径。 此外，如果在社交网络中的两个节点的最短路径的预处理中识别出公共中间节点，则可以存储中间最短路径以便重新使用作为这两个节点之间的完整的最短路径，

    Predicting and ranking search query results
    9.
    发明申请
    Predicting and ranking search query results 有权
    搜索查询结果的预测和排名

    公开(公告)号：US20090171942A1

    公开(公告)日：2009-07-02

    申请号：US11967851

    申请日：2007-12-31

    申请人： Bipin Suresh ,  Nikhil Garg

    发明人： Bipin Suresh ,  Nikhil Garg

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30867 ,  G06F17/30705

    摘要： Techniques are described herein for providing search results that are ranked based on a predictor that predicts, for each of a number of objects, likelihoods that each particular object will be selected at different positions on a results list.

    摘要翻译： 这里描述了技术，用于提供基于预测器进行排名的搜索结果，预测器针对多个对象中的每一个预测每个特定对象将在结果列表上的不同位置被选择的可能性。