CONTRUCTING WEB QUERY HIERARCHIES FROM CLICK-THROUGH DATA
    121.
    发明申请
    CONTRUCTING WEB QUERY HIERARCHIES FROM CLICK-THROUGH DATA 有权
    从点击数据中进行网页查询分层

    公开(公告)号:US20090193047A1

    公开(公告)日:2009-07-30

    申请号:US12020574

    申请日:2008-01-28

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30864

    摘要: The claimed subject matter is directed to constructing query hierarchies in response to a query request. To construct a query hierarchy, a list of related candidate queries is generated in response to the received query request. The list of related candidate queries is generated by determining the relative coverage of information shared by the candidate queries and the query request. Relationships between the submitted query request and the candidate queries in the list are determined based upon the extent of relative coverage of information shared by the candidate queries and the query request. A query hierarchy is then constructed to reflect the determined relationships between the query request and the candidate queries.

    摘要翻译: 所要求保护的主题涉及响应于查询请求构建查询层次结构。 为了构建查询层次结构,响应于接收的查询请求生成相关候选查询的列表。 通过确定候选查询和查询请求共享的信息的相对覆盖率来生成相关候选查询的列表。 基于候选查询和查询请求共享的信息的相对覆盖范围确定列表中提交的查询请求与候选查询之间的关系。 然后构建查询层次结构以反映所确定的查询请求和候选查询之间的关系。

    Ranking online advertisements using retailer and product reputations
    122.
    发明申请
    Ranking online advertisements using retailer and product reputations 审中-公开
    使用零售商和产品信誉排名在线广告

    公开(公告)号:US20080288348A1

    公开(公告)日:2008-11-20

    申请号:US11803461

    申请日:2007-05-15

    IPC分类号: G06Q30/00

    摘要: A method for ranking online advertisements using retailer reputation and product reputation. In one implementation, a query may be received. Advertisements may be selected by determining a level of relevance between the query and each advertisement and selecting the advertisements with a level of relevance above a pre-determined level of relevance. A predicted reputation for a retailer and a predicted reputation for a product may be retrieved for each of the selected advertisements. The selected advertisements may then be ranked based on the predicted reputation for the retailer and the predicted reputation of the product. The ranking of the selected advertisements may be accomplished by calculating a ranking score for each selected advertisement based on the retailer predicted reputation and the product predicted reputation. The selected advertisements may then be displayed according to the ranking.

    摘要翻译: 使用零售商信誉和产品信誉对在线广告进行排名的方法。 在一个实现中,可以接收查询。 可以通过确定查询和每个广告之间的相关性级别并且选择具有相关性水平高于预定相关性水平的广告来选择广告。 可以为每个选定的广告检索零售商的预测声誉和产品的预测声誉。 所选择的广告然后可以基于零售商的预测信誉和产品的预测声誉进行排名。 所选择的广告的排名可以通过基于零售商预测的声誉和产品预测的声誉来计算每个所选广告的排名得分来实现。 然后可以根据排名显示所选择的广告。

    Diverse topic phrase extraction
    123.
    发明授权
    Diverse topic phrase extraction 有权
    不同的主题短语提取

    公开(公告)号:US08280877B2

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

    申请号:US11859461

    申请日:2007-09-21

    IPC分类号: G06F17/30

    CPC分类号: G06F17/2745 G06F17/278

    摘要: Systems and methods for implementing diverse topic phrase extraction are disclosed. According to one implementation, multiple word candidate phrases are extracted from a corpus and weighed. One or more documents are re-weighed to identify less obvious candidate topics using latent semantic analysis (LSA). Phrase diversification is then used to remove redundancy and select informative and distinct topic phrases.

    摘要翻译: 公开了实现不同主题短语提取的系统和方法。 根据一个实现,从语料库中提取多个单词候选词组并称重。 使用潜在语义分析(LSA),重新衡量一个或多个文档以识别较不明显的候选主题。 然后使用短语多样化来消除冗余并选择信息丰富且不同的主题短语。

    Constructing web query hierarchies from click-through data
    124.
    发明授权
    Constructing web query hierarchies from click-through data 有权
    从点击型数据构建Web查询层次结构

    公开(公告)号:US07870132B2

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

    申请号:US12020574

    申请日:2008-01-28

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30864

    摘要: The claimed subject matter is directed to constructing query hierarchies in response to a query request. To construct a query hierarchy, a list of related candidate queries is generated in response to the received query request. The list of related candidate queries is generated by determining the relative coverage of information shared by the candidate queries and the query request. Relationships between the submitted query request and the candidate queries in the list are determined based upon the extent of relative coverage of information shared by the candidate queries and the query request. A query hierarchy is then constructed to reflect the determined relationships between the query request and the candidate queries.

    摘要翻译: 所要求保护的主题涉及响应于查询请求构建查询层次结构。 为了构建查询层次结构,响应于接收的查询请求生成相关候选查询的列表。 通过确定候选查询和查询请求共享的信息的相对覆盖率来生成相关候选查询的列表。 基于候选查询和查询请求共享的信息的相对覆盖范围确定列表中提交的查询请求与候选查询之间的关系。 然后构建查询层次结构以反映所确定的查询请求和候选查询之间的关系。

    Forecasting time-dependent search queries
    125.
    发明授权
    Forecasting time-dependent search queries 失效
    预测与时间相关的搜索查询

    公开(公告)号:US07693823B2

    公开(公告)日:2010-04-06

    申请号:US11770385

    申请日:2007-06-28

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30864 G06Q30/02

    摘要: Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted.

    摘要翻译: 用于分析和建模查询频率的技术由查询分析系统提供。 查询分析系统分析查询的频率,以确定查询是时间依赖还是时间无关。 查询分析系统根据其周期性预测与时间相关的查询的频率。 查询分析系统根据与其他查询的因果关系预测与时间无关的查询的频率。 为了预测时间无关查询的频率,查询分析系统随时间分析查询的频率,以识别频率的显着增加,这被称为“查询事件”或“事件”。查询分析系统预测频率 基于具有事件倾向于在要预测的查询的事件之前的查询的与时间无关的查询。

    Identification of events of search queries
    126.
    发明授权
    Identification of events of search queries 有权
    识别搜索查询的事件

    公开(公告)号:US07689622B2

    公开(公告)日:2010-03-30

    申请号:US11770423

    申请日:2007-06-28

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30864 G06Q30/02

    摘要: Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted.

    摘要翻译: 用于分析和建模查询频率的技术由查询分析系统提供。 查询分析系统分析查询的频率,以确定查询是时间依赖还是时间无关。 查询分析系统根据其周期性预测与时间相关的查询的频率。 查询分析系统根据与其他查询的因果关系预测与时间无关的查询的频率。 为了预测时间无关查询的频率,查询分析系统随时间分析查询的频率,以识别频率的显着增加,这被称为“查询事件”或“事件”。查询分析系统预测频率 基于具有事件倾向于在要预测的查询的事件之前的查询的与时间无关的查询。

    System and method for exploring a semantic file network
    127.
    发明授权
    System and method for exploring a semantic file network 失效
    用于探索语义文件网络的系统和方法

    公开(公告)号:US07624130B2

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

    申请号:US11392640

    申请日:2006-03-30

    IPC分类号: G06F17/30

    摘要: Extraction of semantic information and the generation of semantic attributes allows for improved organization and management of data. Semantic attributes are automatically generated and eliminate the need for manual entry of attribute information. A semantic file network may further be constructed based on similarities between files that are based on the semantic attribute information. Semantic links representing a semantic relationship may be built between similar or relevant files. In addition, user operations and user operation patterns may also be considered in building the file network. Semantic attributes and information may further facilitate browsing the file systems as well as improve the accuracy and speed of queries.

    摘要翻译: 语义信息的提取和语义属性的产生可以改善数据的组织和管理。 自动生成语义属性,无需手动输入属性信息。 还可以基于基于语义属性信息的文件之间的相似性来构建语义文件网络。 表示语义关系的语义链接可以在相似或相关文件之间建立。 此外,在构建文件网络时也可以考虑用户操作和用户操作模式。 语义属性和信息可以进一步促进文件系统的浏览以及提高查询的准确性和速度。

    WEB CONTENT MINING OF PAIR-BASED DATA
    128.
    发明申请
    WEB CONTENT MINING OF PAIR-BASED DATA 有权
    基于对象数据的WEB内容采集

    公开(公告)号:US20090132530A1

    公开(公告)日:2009-05-21

    申请号:US11941968

    申请日:2007-11-19

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30864

    摘要: Described herein is technology for, among other things, mining pair-based data on the web. The technology involves an online pair-based data mining system as well as an offline SVM training system. By subjecting a pair-based input data to the systems, one may grow a pool of pair-based data which share characteristics of the pair-based input data in more efficient manner.

    摘要翻译: 这里描述的是用于在网络上挖掘基于对的数据的技术。 该技术涉及一个在线的基于对的数据挖掘系统以及离线SVM培训系统。 通过对基于对的输入数据进行系统的处理,可以以更有效的方式增加基于成对的输入数据的特征的基于对的数据池。

    FORECASTING TIME-INDEPENDENT SEARCH QUERIES
    129.
    发明申请
    FORECASTING TIME-INDEPENDENT SEARCH QUERIES 有权
    预测时间独立搜索查询

    公开(公告)号:US20090006284A1

    公开(公告)日:2009-01-01

    申请号:US11770445

    申请日:2007-06-28

    IPC分类号: G06F15/18 G06F17/30 G06F7/06

    CPC分类号: G06F17/30864 G06Q30/02

    摘要: Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted.

    摘要翻译: 用于分析和建模查询频率的技术由查询分析系统提供。 查询分析系统分析查询的频率,以确定查询是时间依赖还是时间无关。 查询分析系统根据其周期性预测与时间相关的查询的频率。 查询分析系统根据与其他查询的因果关系预测与时间无关的查询的频率。 为了预测与时间无关的查询的频率,查询分析系统会随着时间的推移分析查询的频率,以确定频率的显着增加,这被称为“查询事件”或“事件”。 查询分析系统基于具有事件倾向于在要预测的查询的事件之前的查询来预测与时间无关的查询的频率。

    FORECASTING TIME-DEPENDENT SEARCH QUERIES
    130.
    发明申请
    FORECASTING TIME-DEPENDENT SEARCH QUERIES 失效
    预测时间依赖搜索查询

    公开(公告)号:US20090006045A1

    公开(公告)日:2009-01-01

    申请号:US11770385

    申请日:2007-06-28

    IPC分类号: G06F17/10

    CPC分类号: G06F17/30864 G06Q30/02

    摘要: Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted.

    摘要翻译: 用于分析和建模查询频率的技术由查询分析系统提供。 查询分析系统分析查询的频率,以确定查询是时间依赖还是时间无关。 查询分析系统根据其周期性预测与时间相关的查询的频率。 查询分析系统根据与其他查询的因果关系预测与时间无关的查询的频率。 为了预测与时间无关的查询的频率,查询分析系统会随着时间的推移分析查询的频率,以确定频率的显着增加,这被称为“查询事件”或“事件”。 查询分析系统基于具有事件倾向于在要预测的查询的事件之前的查询来预测与时间无关的查询的频率。