专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

41. 发明授权

US08949215B2 GUI based web search 有权
标题翻译：基于GUI的网页搜索
公开(公告)号：US08949215B2
公开(公告)日：2015-02-03
申请号：US12038588
申请日：2008-02-27
申请人： Min Wang , Zheng Chen , Jian-Tao Sun , Shen Huang , Jian Wang
发明人： Min Wang , Zheng Chen , Jian-Tao Sun , Shen Huang , Jian Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30696 , G06F17/30643 , G06F17/30864
摘要： An exemplary computer implemented graphics-based Web search system includes a search input control and a results presentation control where the search input control is configured to receive user input to establish a relationship between a query and one or more information tags associated with search results provided by a search engine in response to the query and wherein the results presentation control is configured to re-order the search results in response to the relationship. Such a system allows a user to define and refine search intent and enhance the user's search experience. Various other exemplary systems, methods, devices, etc. are also disclosed.
摘要翻译：示例性的计算机实现的基于图形的Web搜索系统包括搜索输入控制和结果呈现控制，其中搜索输入控件被配置为接收用户输入以建立查询与与由搜索结果提供的搜索结果相关联的一个或多个信息标签之间的关系搜索引擎，其响应于所述查询，并且其中所述结果呈现控制被配置为响应于所述关系重新排序所述搜索结果。这样的系统允许用户定义和优化搜索意图并增强用户的搜索体验。还公开了各种其它示例性系统，方法，装置等。

42. 发明授权

US07711735B2 User segment suggestion for online advertising 有权
标题翻译：在线广告的用户分段建议
公开(公告)号：US07711735B2
公开(公告)日：2010-05-04
申请号：US11803503
申请日：2007-05-15
申请人： Min Wu , Chenxi Lin , Benyu Zhang , Zheng Chen , Jian Wang
发明人： Min Wu , Chenxi Lin , Benyu Zhang , Zheng Chen , Jian Wang
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06F17/30867
摘要： Described is a behavioral targeting technology for online advertising, by which an original attribute is uniformly expanded. Users that meet an original attribute are aggregated into a mid-result used to determine similarity relative to candidate attribute types. The most similar candidate attributes are selected for the expanded attribute. A URL/URL pattern suggestion technology is provided, with similarity computed from users/URLs visited by the users. URLs are separated into URL tree nodes, for calculating the number of users who have visited each URL and the number of users who have visited the URL on a sub-tree whose root is the node. URL/URL patterns are output based on similarity. Domains are also suggested based on user-visits. Similarities between pairs of domains may be computed (e.g., offline), with an output for a given domain provided in based on its similarity with each other domain.
摘要翻译：描述了一种用于在线广告的行为定位技术，通过该技术，原始属性被均匀地扩展。满足原始属性的用户将聚合成中间结果，用于确定与候选属性类型相似度。为扩展属性选择最相似的候选属性。提供URL / URL模式建议技术，从用户访问的用户/ URL计算相似度。 URL被分隔成URL树节点，用于计算访问每个URL的用户数和在其根是节点的子树上访问过URL的用户数。基于相似性输出URL / URL模式。还可以根据用户访问建议域。可以基于其与每个其他域的相似性来计算（例如，脱机）对域之间的相似性，其中提供给定域的输出。

43. 发明授权

US07707129B2 Text classification by weighted proximal support vector machine based on positive and negative sample sizes and weights 有权
标题翻译：基于正，负样本大小和权重的加权近端支持向量机进行文本分类
公开(公告)号：US07707129B2
公开(公告)日：2010-04-27
申请号：US11384889
申请日：2006-03-20
申请人： Dong Zhuang , Benyu Zhang , Zheng Chen , Hua-Jun Zeng , Jian Wang
发明人： Dong Zhuang , Benyu Zhang , Zheng Chen , Hua-Jun Zeng , Jian Wang
IPC分类号： G06F15/18 , G06E1/00 , G06E3/00
CPC分类号： G06F17/30707 , G06K9/6269
摘要： Embodiments of the invention relate to improvements to the support vector machine (SVM) classification model. When text data is significantly unbalanced (i.e., positive and negative labeled data are in disproportion), the classification quality of standard SVM deteriorates. Embodiments of the invention are directed to a weighted proximal SVM (WPSVM) model that achieves substantially the same accuracy as the traditional SVM model while requiring significantly less computational time. A weighted proximal SVM (WPSVM) model in accordance with embodiments of the invention may include a weight for each training error and a method for estimating the weights, which automatically solves the unbalanced data problem. And, instead of solving the optimization problem via the KKT (Karush-Kuhn-Tucker) conditions and the Sherman-Morrison-Woodbury formula, embodiments of the invention use an iterative algorithm to solve an unconstrained optimization problem, which makes WPSVM suitable for classifying relatively high dimensional data.
摘要翻译：本发明的实施例涉及对支持向量机（SVM）分类模型的改进。当文本数据显着不平衡（即正负标签数据不成比例）时，标准SVM的分类质量恶化。本发明的实施例涉及一种加权近端SVM（WPSVM）模型，其实现与传统SVM模型基本相同的精度，同时需要显着更少的计算时间。根据本发明的实施例的加权近端SVM（WPSVM）模型可以包括每个训练误差的权重和用于估计权重的方法，其自动地解决不平衡数据问题。而且，不是通过KKT（Karush-Kuhn-Tucker）条件和Sherman-Morrison-Woodbury公式来解决优化问题，而是本发明的实施例使用迭代算法来解决无约束优化问题，这使得WPSVM适合于相对分类高维数据。

44. 发明授权

US07555705B2 Annotation management in a pen-based computing system 有权
标题翻译：基于笔的计算系统中的注释管理
公开(公告)号：US07555705B2
公开(公告)日：2009-06-30
申请号：US10659568
申请日：2003-09-10
申请人： Zheng Chen , Barn-Wan Li , Jian Wang , Wei-Yin Ma
发明人： Zheng Chen , Barn-Wan Li , Jian Wang , Wei-Yin Ma
IPC分类号： G06F17/00
CPC分类号： G06F17/30997 , G06F17/241 , G06F17/242 , G06F17/30722
摘要： 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.
摘要翻译：描述了用于管理基于笔的计算系统中的注释的系统和方法。本文所述的系统和方法提供了收集，管理，搜索和分享通过手写注释输入的个人信息的方式。注释用于驱动应用程序，作为手势，查找相关信息和进一步管理信息。当用户输入注释时，获得上下文信息，并且用于帮助确定和定位用户可能感兴趣的相关内容，无论是在同一文档中还是位于本地计算机上或互联网上的其他文档或其他网络。

45. 发明申请

US20090006365A1 IDENTIFICATION OF SIMILAR QUERIES BASED ON OVERALL AND PARTIAL SIMILARITY OF TIME SERIES 有权
标题翻译：基于时间序列的整体和部分相似性识别类似的查询
公开(公告)号：US20090006365A1
公开(公告)日：2009-01-01
申请号：US11770505
申请日：2007-06-28
申请人： Ning Liu , Jun Yan , Benyu Zhang , Zheng Chen , Jian Wang
发明人： Ning Liu , Jun Yan , Benyu Zhang , Zheng Chen , Jian Wang
IPC分类号： G06F7/00
CPC分类号： G06F17/30864 , G06F17/3064
摘要： Techniques for identifying similar queries based on their overall similarity and partial similarity of time series of frequencies of the queries are provided. To identify queries that are similar to a target query, the query analysis system generates, for each query, an overall similarity score for that query and the target query based on the time series of the query and the target query. The query analysis system also generates, for each query, partial similarity scores for the query and the target query based on various time sub-series of the overall time series of the queries. The query analysis system then identifies queries as being similar to the target query based on the overall similarity scores and the partial similarity scores of the queries.
摘要翻译：提供了基于其查询的时间序列的总体相似性和部分相似性来识别类似查询的技术。为了识别类似于目标查询的查询，查询分析系统根据查询和目标查询的时间序列为每个查询生成该查询和目标查询的总体相似性得分。查询分析系统还根据查询的整个时间序列的各种时间子序列，为每个查询生成查询和目标查询的部分相似度分数。然后，查询分析系统基于查询的总体相似性得分和部分相似性得分将查询识别为与目标查询相似。

46. 发明申请

US20090006326A1 REPRESENTING QUERIES AND DETERMINING SIMILARITY BASED ON AN ARIMA MODEL 失效
标题翻译：基于ARIMA模型表示查询和确定相似度
公开(公告)号：US20090006326A1
公开(公告)日：2009-01-01
申请号：US11770307
申请日：2007-06-28
申请人： Ning Liu , Jun Yan , Benyu Zhang , Zheng Chen , Jian Wang
发明人： Ning Liu , Jun Yan , Benyu Zhang , Zheng Chen , Jian Wang
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系数的相似性。

47. 发明申请

US20090006313A1 FORECASTING SEARCH QUERIES BASED ON TIME DEPENDENCIES 有权
标题翻译：根据时间依赖性预测搜索查询
公开(公告)号：US20090006313A1
公开(公告)日：2009-01-01
申请号：US11770462
申请日：2007-06-28
申请人： Ning Liu , Jun Yan , Benyu Zhang , Zheng Chen , Jian Wang
发明人： Ning Liu , Jun Yan , Benyu Zhang , Zheng Chen , Jian Wang
IPC分类号： G06F17/40
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.
摘要翻译：用于分析和建模查询频率的技术由查询分析系统提供。查询分析系统分析查询的频率，以确定查询是时间依赖还是时间无关。查询分析系统根据其周期性预测与时间相关的查询的频率。查询分析系统根据与其他查询的因果关系预测与时间无关的查询的频率。为了预测与时间无关的查询的频率，查询分析系统会随着时间的推移分析查询的频率，以确定频率的显着增加，这被称为“查询事件”或“事件”。查询分析系统基于具有事件倾向于在要预测的查询的事件之前的查询来预测与时间无关的查询的频率。

48. 发明申请

US20090006312A1 DETERMINATION OF TIME DEPENDENCY OF SEARCH QUERIES 失效
标题翻译：确定搜索查询的时间依赖关系
公开(公告)号：US20090006312A1
公开(公告)日：2009-01-01
申请号：US11770358
申请日：2007-06-28
申请人： Ning Liu , Jun Yan , Benyu Zhang , Zheng Chen , Jian Wang
发明人： Ning Liu , Jun Yan , Benyu Zhang , Zheng Chen , Jian Wang
IPC分类号： G06F7/00
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.
摘要翻译：用于分析和建模查询频率的技术由查询分析系统提供。查询分析系统分析查询的频率，以确定查询是时间依赖还是时间无关。查询分析系统根据其周期性预测与时间相关的查询的频率。查询分析系统根据与其他查询的因果关系预测与时间无关的查询的频率。为了预测与时间无关的查询的频率，查询分析系统会随着时间的推移分析查询的频率，以确定频率的显着增加，这被称为“查询事件”或“事件”。查询分析系统基于具有事件倾向于在要预测的查询的事件之前的查询来预测与时间无关的查询的频率。

49. 发明申请

US20080249764A1 Smart Sentiment Classifier for Product Reviews 审中-公开
标题翻译：智能情感分类器的产品评论
公开(公告)号：US20080249764A1
公开(公告)日：2008-10-09
申请号：US11950512
申请日：2007-12-05
申请人： Shen Huang , Ling Bao , Yunbo Cao , Zheng Chen , Chin-Yew Lin , Christoph R. Ponath , Jian-Tao Sun , Ming Zhou , Jian Wang
发明人： Shen Huang , Ling Bao , Yunbo Cao , Zheng Chen , Chin-Yew Lin , Christoph R. Ponath , Jian-Tao Sun , Ming Zhou , Jian Wang
IPC分类号： G06F17/27
CPC分类号： G06F17/2785
摘要： A sentiment classifier is described. In one implementation, a system applies both full text and complex feature analyses to sentences of a product review. Each analysis is weighted prior to linear combination into a final sentiment prediction. A full text model and a complex features model can be trained separately offline to support online full text analysis and complex features analysis. Complex features include opinion indicators, negation patterns, sentiment-specific sections of the product review, user ratings, sequence of text chunks, and sentence types and lengths. A Conditional Random Field (CRF) framework provides enhanced sentiment classification for each segment of a complex sentence to enhance sentiment prediction.
摘要翻译：描述情感分类器。在一个实现中，系统将全文和复杂特征分析应用于产品评论的句子。将每个分析在线性组合之前加权到最终情绪预测中。全文模型和复杂特征模型可以离线进行培训，以支持在线全文分析和复杂特征分析。复杂的功能包括意见指标，否定模式，产品评论中的情绪特定部分，用户评分，文本块的顺序以及句型和长度。条件随机场（CRF）框架为复杂句子的每个段提供增强的情感分类，以增强情绪预测。

50. 发明申请

US20080215565A1 SEARCHING HETEROGENEOUS INTERRELATED ENTITIES 有权
标题翻译：搜索异构中介实体
公开(公告)号：US20080215565A1
公开(公告)日：2008-09-04
申请号：US11853613
申请日：2007-09-11
申请人： Jian-Tao Sun , Xuanhui Wang , Ning Liu , Zheng Chen , Jian Wang
发明人： Jian-Tao Sun , Xuanhui Wang , Ning Liu , Zheng Chen , Jian Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： Systems and methods for searching heterogeneous interrelated entities for a heterogeneous entities search query are disclosed herein. A user may enter the heterogeneous entities search query. The search retrieves and returns multiple types of heterogeneous entities. The retrieved heterogeneous interrelated entities are searched in a unified matrix that represents relationships between one or more heterogeneous entities. The retrieved heterogeneous interrelated entities may have one or more entity types. The set of retrieved interrelated entities may also be ranked based on the similarity between each entity and the search query. Feedback may also be incorporated into the system to improve search accuracy.
摘要翻译：本文公开了用于异构实体搜索查询的异构相关实体的搜索的系统和方法。用户可以输入异构实体搜索查询。搜索检索并返回多种类型的异构实体。检索到的异构相关实体在表示一个或多个异构实体之间的关系的统一矩阵中进行搜索。所检索的异构相关实体可以具有一个或多个实体类型。还可以根据每个实体和搜索查询之间的相似性对所检索的相关实体的集合进行排名。反馈也可以并入系统以提高搜索精度。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式