PROMOTING WEBSITES BASED ON LOCATION
    1.
    发明申请
    PROMOTING WEBSITES BASED ON LOCATION 有权
    基于位置推广网站

    公开(公告)号:US20090292684A1

    公开(公告)日:2009-11-26

    申请号:US12124975

    申请日:2008-05-21

    IPC分类号: G06F17/30

    摘要: A computer system, method, and media for associating locations with ranked websites are provided. The computer system includes a search engine, a log database, and a location database that are employed to respond to search requests from users by returning appropriately ranked websites to the user. The websites are ranked using the location of the website and the location of the user to select websites to receive high ranks. Additionally, the search engine includes a correction feature that reevaluates locations for a website or user when a large number of obtained locations suggest a different location than a currently associated location for the website or the user.

    摘要翻译: 提供了一种用于将位置与排名网站相关联的计算机系统,方法和媒体。 计算机系统包括搜索引擎,日志数据库和位置数据库,用于通过向用户返回适当排名的网站来响应来自用户的搜索请求。 网站使用网站的位置和用户的位置来选择网站进行排名。 此外,搜索引擎包括校正功能,当大量获得的位置建议与网站或用户的当前相关联的位置不同的位置时,重新评估网站或用户的位置。

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

    公开(公告)号:US08543592B2

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

    申请号:US12696938

    申请日:2010-01-29

    IPC分类号: G06F17/30

    摘要: 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的搜索工具,以帮助用户执行手头的任务。

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

    公开(公告)号:US08803882B2

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

    申请号:US12134334

    申请日:2008-06-06

    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查询的数量来对图形描述上的点进行排序。 峰值点和斜率值(即,从图形描绘上的倾斜倾角导出)可以通过分析实体随时间推移的运动来捕获。 然后可以将算法过程应用于峰值点和斜率值,以确定实体的受欢迎程度的兴趣点,例如实体排名中排名最高的周期和/或剧烈的正移动。 这些兴趣点被选为候选点,并且作为图形描绘的视觉表示的表示。

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

    公开(公告)号:US07822774B2

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

    申请号:US11761038

    申请日:2007-06-11

    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.

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

    Using link structure for suggesting related queries

    公开(公告)号:US08280918B2

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

    申请号:US12890086

    申请日:2010-09-24

    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.

    Related search queries for a webpage and their applications
    8.
    发明授权
    Related search queries for a webpage and their applications 有权
    相关搜索查询网页及其应用程序

    公开(公告)号:US08244750B2

    公开(公告)日:2012-08-14

    申请号:US11690585

    申请日:2007-03-23

    IPC分类号: G06F17/30

    摘要: An inversion of the basic format of searching is provided herein. Instead of receiving a search query and providing web page results, a search engine receives a web page identifier as search input from an end user, determines related search queries for the associated web page, and provides the related search queries to the end user issuing the search. Related search queries for web pages may also be used to refine search engines performing the basic form of searching by facilitating the determination of web pages to index and the ranking of web pages as search results to user queries. Additionally, related search queries may be used in advertising revenue generation and sharing.

    摘要翻译: 本文提供了搜索的基本格式的反转。 搜索引擎不是接收搜索查询和提供网页结果,而是从最终用户接收到作为搜索输入的网页标识符,确定相关网页的相关搜索查询,并且向最终用户发出相关搜索查询 搜索。 用于网页的相关搜索查询还可以用于通过促进确定网页的索引和将网页的排名作为用户查询的搜索结果来优化执行基本搜索形式的搜索引擎。 此外,相关搜索查询可用于广告收入生成和共享。

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

    公开(公告)号:US08239372B2

    公开(公告)日:2012-08-07

    申请号:US12890043

    申请日:2010-09-24

    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.

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

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

    公开(公告)号:US20140372253A1

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

    申请号:US14138032

    申请日:2013-12-21

    IPC分类号: G06Q30/06

    摘要: 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.

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