利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

21 条记录 (耗时 0.025 秒)

    Syndicating search queries using web advertising
    1.
    发明授权
    Syndicating search queries using web advertising 有权
    使用网络广告统一搜索查询

    公开(公告)号：US08572112B2

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

    申请号：US12165089

    申请日：2008-06-30

    申请人： Hugh Evan Williams ,  Kenneth Alan Moss

    发明人： Hugh Evan Williams ,  Kenneth Alan Moss

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30867

    摘要： Displaying potential search-engine queries in a portion (e.g., a portion allocated for a web advertisement or within an inline frame) of a web page along with the content of the web page is described herein. The potential search-engine queries are determine by first analyzing either the underlying content of the web page (or other web pages) or searching various historic user metrics. Once determined, the potential search-engine queries are displayed within the portion of the web page along with the content of the web page. When a user selects one of the displayed potential search-engine queries, a query is sent to a search engine requesting web content relevant to the selected potential search-engine query.

    摘要翻译： 本文描述了在网页的一部分（例如，分配给web广告或在内联帧内的部分）中显示潜在的搜索引擎查询以及网页的内容。 通过首先分析网页（或其他网页）的底层内容或搜索各种历史用户度量来确定潜在的搜索引擎查询。 一旦确定，潜在的搜索引擎查询将与网页的内容一起显示在网页的一部分内。 当用户选择所显示的潜在搜索引擎查询中的一个时，将查询发送到请求与所选潜在搜索引擎查询相关的网页内容的搜索引擎。

    METADATA REFINEMENT USING BEHAVIORAL PATTERNS
    2.
    发明申请
    METADATA REFINEMENT USING BEHAVIORAL PATTERNS 有权
    使用行为模式的元数据精简

    公开(公告)号：US20140372253A1

    公开(公告)日：2014-12-18

    申请号：US14138032

    申请日：2013-12-21

    申请人： Prakash S. Arunachalam ,  Jean-David Ruvini ,  Hugh Evan Williams

    发明人： Prakash S. Arunachalam ,  Jean-David Ruvini ,  Hugh Evan Williams

    IPC分类号： G06Q30/06

    CPC分类号： G06F17/30554 ,  G06F17/30598 ,  G06Q10/087 ,  G06Q30/0623

    摘要： A system and method of metadata refinement using behavioral patterns is disclosed. In some embodiments, user behavioral data for results of a search query is received. The results can include an untagged item and a plurality of tagged items. A determination can then be made that the tagged items have been assigned a first type of metadata not assigned to the untagged item. The untagged item can then be identified as a candidate to be tagged with the first type of metadata assigned to the tagged items based on the user behavioral data. In some embodiments, the user behavioral data comprises clickstream data indicating that a user selected the untagged item and the tagged items during a single search event.

    摘要翻译： 公开了使用行为模式的元数据细化的系统和方法。 在一些实施例中，接收用于搜索查询结果的用户行为数据。 结果可以包括未标记的项目和多个标记的项目。 然后可以确定标记的项目已经被分配给未分配给未标记项目的第一类型的元数据。 然后可以基于用户行为数据将未标记的项目识别为被标记有分配给带标签的项目的第一类型的元数据的候选。 在一些实施例中，用户行为数据包括指示用户在单个搜索事件期间选择未标记项目和标记项目的点击流数据。

    Related URLs for task-oriented query results
    4.
    发明授权
    Related URLs for task-oriented query results 有权
    用于面向任务的查询结果的相关URL

    公开(公告)号：US08543592B2

    公开(公告)日：2013-09-24

    申请号：US12696938

    申请日：2010-01-29

    申请人： Nitin Agrawal ,  Tabreez Govani ,  Jamie P. Buckley ,  Michael Maxwell Cameron ,  Liwei Chen ,  Hugh Evan Williams ,  Sanaz Ahari ,  Yang Yang Zhang ,  Srinath Reddy Aaleti

    发明人： Nitin Agrawal ,  Tabreez Govani ,  Jamie P. Buckley ,  Michael Maxwell Cameron ,  Liwei Chen ,  Hugh Evan Williams ,  Sanaz Ahari ,  Yang Yang Zhang ,  Srinath Reddy Aaleti

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864 ,  G06F17/30876 ,  G06F17/30887

    摘要： Methods, computer-storage media, and graphical user interfaces are provided for identifying and presenting rich related sites for task-oriented search queries. Upon receipt of a search query input by a user, one or more query logs are analyzed to determine if the search query is a related to a task being performed by the user. If the query is determined to be a task-oriented search query, search results are identified, as is one or more Uniform Resource Locators (URLs) related to a particular search result. The related URL is presented to the user in association with the particular search result. Additional controls, e.g., search tools that facilitate querying of those URLs determined to be relevant to a particular search result, may also be provided to aid the user in performing the task at hand.

    摘要翻译： 提供了方法，计算机存储介质和图形用户界面，用于识别和呈现用于面向任务的搜索查询的富相关站点。 在接收到用户输入的搜索查询后，分析一个或多个查询日志以确定搜索查询是否与由用户正在执行的任务相关。 如果查询被确定为面向任务的搜索查询，则识别搜索结果，以及与特定搜索结果相关的一个或多个统一资源定位符（URL）。 将相关的URL与特定的搜索结果相关联地呈现给用户。 还可以提供额外的控件，例如便于查询确定为与特定搜索结果相关的那些URL的搜索工具，以帮助用户执行手头的任务。

    SYSTEMS AND METHODS FOR ATTRIBUTE-BASED SEARCH FILTERING
    5.
    发明申请
    SYSTEMS AND METHODS FOR ATTRIBUTE-BASED SEARCH FILTERING 审中-公开
    用于基于属性搜索过滤的系统和方法

    公开(公告)号：US20120173553A1

    公开(公告)日：2012-07-05

    申请号：US12983760

    申请日：2011-01-03

    申请人： Johan Johansson ,  Sashanka Vishnuvajhala ,  Ayon Sinha ,  Hugh Evan Williams

    发明人： Johan Johansson ,  Sashanka Vishnuvajhala ,  Ayon Sinha ,  Hugh Evan Williams

    IPC分类号： G06F17/30

    CPC分类号： G06F16/955 ,  G06F16/958

    摘要： A method and a system filter search results according to attributes of current results. A plurality of content elements is tagged so each content element is associated with a plurality of tags. Each tag describes an attribute of at least one of the plurality of content elements. A first listing of results is provided to a user. Each of the results in the first listing includes a content element and the plurality of tags associated with the content element. A first selection of a first tag in a first result of the first listing received from a user. A second selection of a second tag is received from the user. The second tag may be in the first result or in a second result of the first listing of results. A second listing of results is provided to the user where each of the results of the second listing includes at least the first tag and the second tag.

    摘要翻译： 根据当前结果的属性，对方法和系统过滤器进行搜索。 标记多个内容元素，使得每个内容元素与多个标签相关联。 每个标签描述多个内容元素中的至少一个的属性。 结果的第一个列表提供给用户。 第一列表中的每个结果包括内容元素和与内容元素相关联的多个标签。 从用户接收到的第一列表的第一结果中的第一标签的第一选择。 从用户接收第二标签的第二选择。 第二个标签可能处于第一个结果或第一个结果列表的第二个结果。 结果的第二列表被提供给用户，其中第二列表的每个结果至少包括第一标签和第二标签。

    Using link structure for suggesting related queries
    6.
    发明授权
    Using link structure for suggesting related queries 有权
    使用链接结构来建议相关查询

    公开(公告)号：US07822774B2

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

    申请号：US11761038

    申请日：2007-06-11

    申请人： Nicholas Eric Craswell ,  Hugh Evan Williams ,  Ariel J. Lazier

    发明人： Nicholas Eric Craswell ,  Hugh Evan Williams ,  Ariel J. Lazier

    IPC分类号： G06F17/00

    CPC分类号： G06F17/3064

    摘要： An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.

    摘要翻译： 提供了一种基于文档集合内的电子文档的链接结构来确定给定搜索查询的相关查询的方法。 文件标题用于表示潜在的搜索查询，电子文档之间的链接用于确定潜在搜索查询之间的关系。 因此，文档集可以被表示为有向图，其中文档标题（其表示潜在的搜索查询）是节点，并且链接是节点之间的边缘。 当接收到特定搜索查询时，识别相应的节点，并通过识别具有与该节点的连接的其他节点来确定相关查询。

    Identifying on a graphical depiction candidate points and top-moving queries
    7.
    发明授权
    Identifying on a graphical depiction candidate points and top-moving queries 有权
    识别图形描述候选点和顶部移动查询

    公开(公告)号：US08803882B2

    公开(公告)日：2014-08-12

    申请号：US12134334

    申请日：2008-06-06

    申请人： Andy Lam ,  Jamie P. Buckley ,  Hugh Evan Williams ,  Nicholas Eric Craswell ,  Tabreez Govani

    发明人： Andy Lam ,  Jamie P. Buckley ,  Hugh Evan Williams ,  Nicholas Eric Craswell ,  Tabreez Govani

    IPC分类号： G06T11/20 ,  G06F17/30

    CPC分类号： G06F17/30389 ,  G06F17/30864

    摘要： Computer-readable media and computerized methods for identifying candidate points on a graphical depiction of relative popularity of an entity (e.g., entertainer, sports team, and the like) are provided. Points on the graphical depiction are ranked based on a number of user-submitted web queries that reference the entity that are received during a particular time frame. Peak points and slope values (i.e., derived from an angle of inclination of inclines on the graphical depiction) may be captured by analyzing movements in the rank of an entity over time. An algorithmic process may then be applied to the peak points and slope values to determine points of interest of the entity's popularity, such as the highest-ranked periods and/or dramatic positive movements in rank of the entity. These points of interest are selected as candidate points and are surfaced as icons on a visual representation of the graphical depiction.

    摘要翻译： 提供了用于识别实体（例如，艺人，运动团队等）的相对受欢迎程度的图形描绘上的候选点的计算机可读介质和计算机化方法。 基于在特定时间框架内引用实体的用户提交的Web查询的数量来对图形描述上的点进行排序。 峰值点和斜率值（即，从图形描绘上的倾斜倾角导出）可以通过分析实体随时间推移的运动来捕获。 然后可以将算法过程应用于峰值点和斜率值，以确定实体的受欢迎程度的兴趣点，例如实体排名中排名最高的周期和/或剧烈的正移动。 这些兴趣点被选为候选点，并且作为图形描绘的视觉表示的表示。