Annotation management in a pen-based computing system
    1.
    发明申请
    Annotation management in a pen-based computing system 有权
    基于笔的计算系统中的注释管理

    公开(公告)号:US20050055628A1

    公开(公告)日:2005-03-10

    申请号:US10659568

    申请日:2003-09-10

    摘要: Systems and methods are described for managing annotations in pen-based computing systems. The systems and methods described herein provide ways to collect, manage, search and share personal information entered by way of handwritten annotations. Annotations are used to drive applications, serve as gestures, find related information and to further manage information. Context information is obtained when a user enters an annotation, and is used to assist in determining and locating relevant content in which the user may be interested, whether in the same document or a different document located on a local computer or on the Internet or other network.

    摘要翻译: 描述了用于管理基于笔的计算系统中的注释的系统和方法。 本文所述的系统和方法提供了收集,管理,搜索和分享通过手写注释输入的个人信息的方式。 注释用于驱动应用程序,作为手势,查找相关信息和进一步管理信息。 当用户输入注释时,获得上下文信息,并且用于帮助确定和定位用户可能感兴趣的相关内容,无论是在同一文档中还是位于本地计算机上或互联网上的其他文档或其他 网络。

    Annotation management in a pen-based computing system
    2.
    发明授权
    Annotation management in a pen-based computing system 有权
    基于笔的计算系统中的注释管理

    公开(公告)号:US07555705B2

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

    申请号:US10659568

    申请日:2003-09-10

    IPC分类号: G06F17/00

    摘要: Systems and methods are described for managing annotations in pen-based computing systems. The systems and methods described herein provide ways to collect, manage, search and share personal information entered by way of handwritten annotations. Annotations are used to drive applications, serve as gestures, find related information and to further manage information. Context information is obtained when a user enters an annotation, and is used to assist in determining and locating relevant content in which the user may be interested, whether in the same document or a different document located on a local computer or on the Internet or other network.

    摘要翻译: 描述了用于管理基于笔的计算系统中的注释的系统和方法。 本文所述的系统和方法提供了收集,管理,搜索和分享通过手写注释输入的个人信息的方式。 注释用于驱动应用程序,作为手势,查找相关信息和进一步管理信息。 当用户输入注释时,获得上下文信息,并且用于帮助确定和定位用户可能感兴趣的相关内容,无论是在同一文档中还是位于本地计算机上或互联网上的其他文档或其他 网络。

    User advertisement click behavior modeling
    3.
    发明授权
    User advertisement click behavior modeling 有权
    用户广告点击行为建模

    公开(公告)号:US08639570B2

    公开(公告)日:2014-01-28

    申请号:US12131126

    申请日:2008-06-02

    IPC分类号: G06F17/30 G06Q30/00 G06F7/00

    CPC分类号: G06Q30/02

    摘要: Described herein is technology for, among other things, mining similar user clusters based on user advertisement click behaviors. The technology involves methods and systems for mining similar user clusters based on log data available on an online advertising platform. By building a user linkage representation based on one or more attributes from the log data, the similar user clusters can be harvested in more efficient manner.

    摘要翻译: 这里描述的是用于基于用户广告点击行为挖掘类似用户群的技术。 该技术涉及基于在线广告平台上可用的日志数据挖掘类似用户群集的方法和系统。 通过基于日志数据中的一个或多个属性构建用户链接表示,可以以更有效的方式收集类似的用户群集。

    User query mining for advertising matching
    4.
    发明授权
    User query mining for advertising matching 有权
    用户查询挖掘广告匹配

    公开(公告)号:US08285745B2

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

    申请号:US11849136

    申请日:2007-08-31

    IPC分类号: G06F17/30

    摘要: Systems and methods to determine relevant keywords from a user's search query sessions are disclosed. The described method includes identifying search session logs of a user, segmenting the search session logs into one or more search sessions. After the segmentation, the search sessions are analyzed to compose a list of semantically relevant keyword sets including at least a first keyword set and a second keyword set. The described method further includes determining a semantic relevance between the first and second keyword sets according to the frequency at which the first and second keyword sets are reported in the query results and displaying one or more semantically high relevant keyword sets after being filtered by a threshold.

    摘要翻译: 公开了从用户的搜索查询会话确定相关关键词的系统和方法。 所描述的方法包括识别用户的搜索会话日志,将搜索会话日志分割成一个或多个搜索会话。 在分割之后,分析搜索会话以构成包括至少第一关键词集合和第二关键字集合的语义相关关键字集合的列表。 所描述的方法还包括根据在查询结果中报告第一和第二关键字集合的频率来确定第一和第二关键字集合之间的语义相关性,并且在被阈值过滤之后显示一个或多个语义上相关的关键字集合 。

    Representing queries and determining similarity based on an ARIMA model
    5.
    发明授权
    Representing queries and determining similarity based on an ARIMA model 失效
    基于ARIMA模型表示查询和确定相似性

    公开(公告)号:US08090709B2

    公开(公告)日:2012-01-03

    申请号:US11770307

    申请日:2007-06-28

    IPC分类号: G06F17/30

    CPC分类号: G06Q30/02

    摘要: Representing queries and determining similarity of queries based on an autoregressive integrated moving average (“ARIMA”) model is provided. A query analysis system represents each query by its ARIMA coefficients. The query analysis system may estimate the frequency information for a desired past or future interval based on frequency information for some initial intervals. The query analysis system may also determine the similarity of a pair of queries based on the similarity of their ARIMA coefficients. The query analysis system may use various metrics, such as a correlation metric, to determine the similarity of the ARIMA coefficients.

    摘要翻译: 提供了基于自回归综合移动平均(“ARIMA”)模型的查询和确定查询的相似性。 查询分析系统通过其ARIMA系数表示每个查询。 查询分析系统可以基于一些初始间隔的频率信息来估计期望的过去或将来间隔的频率信息。 查询分析系统还可以基于它们的ARIMA系数的相似度来确定一对查询的相似性。 查询分析系统可以使用诸如相关度量的各种度量来确定ARIMA系数的相似性。

    Forecasting search queries based on time dependencies
    6.
    发明授权
    Forecasting search queries based on time dependencies 有权
    基于时间依赖性预测搜索查询

    公开(公告)号:US07685100B2

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

    申请号:US11770462

    申请日:2007-06-28

    IPC分类号: G06F17/30

    CPC分类号: 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.

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

    CLUSTERING AGGREGATOR FOR RSS FEEDS
    7.
    发明申请
    CLUSTERING AGGREGATOR FOR RSS FEEDS 有权
    聚合聚合器RSS信息

    公开(公告)号:US20090327320A1

    公开(公告)日:2009-12-31

    申请号:US12146481

    申请日:2008-06-26

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30705

    摘要: A method for merging really simple syndication (RSS) feeds. Stories containing one or more terms may be merged into one or more clusters based on one or more links between the stories. A cluster frequency with which the terms occur in each cluster may be determined. A diameter for each cluster may be determined. A cluster that is most similar to one of the clusters may be determined based on the cluster frequency. The most similar cluster with the one of the clusters may be determined based on each diameter, and each cluster frequency.

    摘要翻译: 一种合并真正简单的联合(RSS)馈送的方法。 包含一个或多个术语的故事可以基于故事之间的一个或多个链接合并成一个或多个集群。 可以确定在每个簇中出现术语的聚类频率。 可以确定每个簇的直径。 可以基于群集频率来确定与簇之一最相似的群集。 可以基于每个直径和每个聚类频率来确定具有一个簇的最相似的簇。

    PREDICTING KEYWORD MONETIZATION
    8.
    发明申请
    PREDICTING KEYWORD MONETIZATION 有权
    预测关键词制衡

    公开(公告)号:US20090299855A1

    公开(公告)日:2009-12-03

    申请号:US12131125

    申请日:2008-06-02

    IPC分类号: G06Q30/00

    摘要: Embodiments of the claimed subject matter provide a method and system for predicting bidding keyword monetization. The claimed subject matter provides a method and system with which the value of a keyword for the purpose of relevant online advertisement may be evaluated according to various metrics to determine a bidding landscape for use in advertising campaigns. The value of the keyword considers certain attributes related to the monetization of the keyword.One embodiment of the claimed subject matter is implemented as a method for predicting keyword monetization for one or more keyword-advertisement relationships. Historical data for the one or more keyword-advertisement relationships is referenced and used to generate a global model of the one or more keyword-advertisement relationship. The relationships are then evaluated according to a time-series analysis, which parses the data from the historical data and the global model to create predictions for the keyword monetization according to the keyword-advertisement relationships.

    摘要翻译: 所要求保护的主题的实施例提供了用于预测投标关键字货币化的方法和系统。 所要求保护的主题提供了一种方法和系统,其中可以根据各种度量来评估用于相关在线广告的关键字的价值,以确定用于广告活动的投标景观。 该关键字的值考虑与关键字获利相关的特定属性。 所要求保护的主题的一个实施例被实现为用于预测一个或多个关键字 - 广告关系的关键字获利的方法。 引用一个或多个关键字 - 广告关系的历史数据,并用于生成一个或多个关键字 - 广告关系的全局模型。 然后根据时间序列分析来评估关系,该时间序列分析从历史数据和全球模型中分析数据,以根据关键字 - 广告关系创建关键字营利的预测。

    Document characterization using a tensor space model
    9.
    发明授权
    Document characterization using a tensor space model 失效
    文档表征使用张量空间模型

    公开(公告)号:US07529719B2

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

    申请号:US11378095

    申请日:2006-03-17

    IPC分类号: G06N5/00

    CPC分类号: G06N5/02 G06F17/30705

    摘要: Computer-readable media having computer-executable instructions and apparatuses categorize documents or corpus of documents. A Tensor Space Model (TSM), which models the text by a higher-order tensor, represents a document or a corpus of documents. Supported by techniques of multilinear algebra, TSM provides a framework for analyzing the multifactor structures. TSM is further supported by operations and presented tools, such as the High-Order Singular Value Decomposition (HOSVD) for a reduction of the dimensions of the higher-order tensor. The dimensionally reduced tensor is compared with tensors that represent possible categories. Consequently, a category is selected for the document or corpus of documents. Experimental results on the dataset for 20 Newsgroups suggest that TSM is advantageous to a Vector Space Model (VSM) for text classification.

    摘要翻译: 具有计算机可执行指令和设备的计算机可读介质将文档或语料库分类。 张量空间模型(TSM),其通过高阶张量对文本进行建模,表示文档或文档语料库。 由多线代数技术支持,TSM为多因素结构分析提供了框架。 TSM还受到操作和提出的工具的支持,例如用于降低高阶张量尺寸的高阶奇异值分解(HOSVD)。 将尺寸减小的张量与表示可能类别的张量进行比较。 因此,文档或文档的语料库选择一个类别。 20个新闻组的数据集的实验结果表明,TSM对于文本分类的向量空间模型(VSM)是有利的。

    Extracting semantic attributes
    10.
    发明授权
    Extracting semantic attributes 有权
    提取语义属性

    公开(公告)号:US07502785B2

    公开(公告)日:2009-03-10

    申请号:US11392761

    申请日: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.

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