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

21. 发明授权

US07529719B2 Document characterization using a tensor space model 失效
标题翻译：文档表征使用张量空间模型
公开(公告)号：US07529719B2
公开(公告)日：2009-05-05
申请号：US11378095
申请日：2006-03-17
申请人： Ning Liu , Benyu Zhang , Jun Yan , Zheng Chen , Hua-Jun Zeng , Jian Wang
发明人： Ning Liu , Benyu Zhang , Jun Yan , Zheng Chen , Hua-Jun Zeng , Jian Wang
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）是有利的。

22. 发明授权

US07502785B2 Extracting semantic attributes 有权
标题翻译：提取语义属性
公开(公告)号：US07502785B2
公开(公告)日：2009-03-10
申请号：US11392761
申请日：2006-03-30
申请人： Zheng Chen , Lei Li , Chenxi Lin , Qiaoling Liu , Jian Wang , Benyu Zhang
发明人： Zheng Chen , Lei Li , Chenxi Lin , Qiaoling Liu , Jian Wang , Benyu Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30616 , G06F17/30112 , G06F17/3012 , Y10S707/99933
摘要： 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.
摘要翻译：语义信息的提取和语义属性的产生可以改善数据的组织和管理。自动生成语义属性，无需手动输入属性信息。还可以基于基于语义属性信息的文件之间的相似性来构建语义文件网络。表示语义关系的语义链接可以在相似或相关文件之间建立。此外，在构建文件网络时也可以考虑用户操作和用户操作模式。语义属性和信息可以进一步促进文件系统的浏览以及提高查询的准确性和速度。

23. 发明申请

US20090063461A1 USER QUERY MINING FOR ADVERTISING MATCHING 有权
标题翻译：用户查询采购广告匹配
公开(公告)号：US20090063461A1
公开(公告)日：2009-03-05
申请号：US11849136
申请日：2007-08-31
申请人： Jian Wang , Hua Li , HuaJun Zeng , Jian Hu , Zheng Chen
发明人： Jian Wang , Hua Li , HuaJun Zeng , Jian Hu , Zheng Chen
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30861 , G06F17/30672 , G06Q30/02
摘要： 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.
摘要翻译：公开了从用户的搜索查询会话确定相关关键词的系统和方法。所描述的方法包括识别用户的搜索会话日志，将搜索会话日志分割成一个或多个搜索会话。在分割之后，分析搜索会话以构成包括至少第一关键词集合和第二关键字集合的语义相关关键字集合的列表。所描述的方法还包括根据在查询结果中报告第一和第二关键字集合的频率来确定第一和第二关键字集合之间的语义相关性，并且在被阈值过滤之后显示一个或多个语义上相关的关键字集合。

24. 发明申请

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

25. 发明申请

US20080215574A1 Efficient Retrieval Algorithm by Query Term Discrimination 有权
标题翻译：通过查询词辨别的有效检索算法
公开(公告)号：US20080215574A1
公开(公告)日：2008-09-04
申请号：US12038652
申请日：2008-02-27
申请人： Chenxi Lin , Lei Ji , HuaJun Zeng , Benyu Zhang , Zheng Chen , Jian Wang
发明人： Chenxi Lin , Lei Ji , HuaJun Zeng , Benyu Zhang , Zheng Chen , Jian Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30675 , G06Q10/10
摘要： An exemplary method for use in information retrieval includes, for each of a plurality of terms, selecting a predetermined number of top scoring documents for the term to form a corresponding document set for the term; receiving a plurality of terms, optionally as a query; ranking the plurality of terms for importance based at least in part on the document sets for the plurality of terms where the ranking comprises using an inverse document frequency algorithm; selecting a number of ranked terms based on importance where each selected, ranked term comprises its corresponding document set wherein each document in a respective document set comprises a document identification number; forming a union set based on the document sets associated with the selected number of ranked terms; and, for a document identification number in the union set, scanning a document set corresponding to an unselected term for a matching document identification number. Various other exemplary systems, methods, devices, etc. are also disclosed.
摘要翻译：用于信息检索的示例性方法包括对于多个术语中的每一个，为该术语选择预定数量的最高评分文档以形成用于该术语的对应文档集合; 接收多个术语，可选地作为查询; 至少部分地基于所述多个术语的文档集来排序所述多个重要项，所述术语的排序包括使用逆文档频率算法; 基于重要性选择多个排名项，其中每个所选择的排名项包括其对应的文档集，其中相应文档集中的每个文档包括文档标识号; 基于与选定数量的排名项相关联的文档集合来形成联合集合; 并且对于联合集合中的文档识别号码，扫描与匹配文档识别号码的未选择的术语相对应的文档集。还公开了各种其它示例性系统，方法，装置等。

26. 发明申请

US20080016087A1 INTERACTIVELY CRAWLING DATA RECORDS ON WEB PAGES 失效
标题翻译：互联网络数据记录在网页上
公开(公告)号：US20080016087A1
公开(公告)日：2008-01-17
申请号：US11456753
申请日：2006-07-11
申请人： Benyu Zhang , Chenxi Lin , Hua-Jun Zeng , Jian Wang , Ke Tang , Zheng Chen
发明人： Benyu Zhang , Chenxi Lin , Hua-Jun Zeng , Jian Wang , Ke Tang , Zheng Chen
IPC分类号： G06F7/00
CPC分类号： G06F17/30864 , Y10S707/99935
摘要： The invention provides a method of interactively crawling data records on a web page. Users may select various data records of interest on a web page to generate templates to search for similar data items on the same web page or on different web pages. A tree matching algorithm may be used to compare and extract data matching the generated template.
摘要翻译：本发明提供了一种在网页上交互地爬行数据记录的方法。用户可以在网页上选择感兴趣的各种数据记录，以生成在同一网页或不同网页上搜索类似数据项的模板。可以使用树匹配算法来比较和提取与生成的模板匹配的数据。

27. 发明申请

US20120078715A1 ADVERTISING SERVICE BASED ON CONTENT AND USER LOG MINING 审中-公开
标题翻译：基于内容和用户日志挖掘的广告服务
公开(公告)号：US20120078715A1
公开(公告)日：2012-03-29
申请号：US13310103
申请日：2011-12-02
申请人： Li Li , Tarek Najm , Ying Li , Zheng Chen , Hua-Jun Zeng , Ke Tang , Zhifeng Yang , FengPing Zeng , Xianfang Wang , Xiafeng Dai , Benyu Zang , Jian Wang
发明人： Li Li , Tarek Najm , Ying Li , Zheng Chen , Hua-Jun Zeng , Ke Tang , Zhifeng Yang , FengPing Zeng , Xianfang Wang , Xiafeng Dai , Benyu Zang , Jian Wang
IPC分类号： G06Q30/02
CPC分类号： G06Q30/0241 , G06F16/9535 , G06Q30/02 , G06Q30/0254
摘要： A system and method are disclosed for providing documents related to a search request. The search request may include a search query of one or more keywords, or the search request may be a demographic search query including one or more demographic attributes. An index containing data crawled from publisher's websites, demographic information of registered users, along with the search history of the registered users can be created. Once a search request is received, the search request can be compared to the information stored in the index, and one or more documents related to the request can be provided.
摘要翻译：公开了一种用于提供与搜索请求相关的文档的系统和方法。搜索请求可以包括一个或多个关键字的搜索查询，或者搜索请求可以是包括一个或多个人口统计属性的人口统计学搜索查询。可以创建包含从发布商网站爬取的数据，注册用户的人口统计信息以及注册用户的搜索记录的索引。一旦接收到搜索请求，可以将搜索请求与存储在索引中的信息进行比较，并且可以提供与该请求相关的一个或多个文档。

28. 发明授权

US08117050B2 Advertiser monetization modeling 有权
标题翻译：广告商营利建模
公开(公告)号：US08117050B2
公开(公告)日：2012-02-14
申请号：US12131124
申请日：2008-06-02
申请人： Hua Li , Zheng Chen , Jian Wang
发明人： Hua Li , Zheng Chen , Jian Wang
IPC分类号： G06Q40/00 , G06Q30/00 , G01C21/34
CPC分类号： G06Q30/02 , G06Q10/025 , G06Q30/0207 , G06Q30/0277 , G06Q40/08
摘要： Embodiments of the claimed subject matter provide a method and system for modeling advertiser monetization. The claimed subject matter provides a method and system from which an advertisement may be evaluated according to various metrics to determine a quality relative to other advertisements. The relative quality considers the content of the advertisement, the performance of the advertisement and the history of the advertiser's bidding behavior.One embodiment of the claimed subject matter is implemented as a method for advertiser monetization modeling. One or more advertisements are received from one or more advertisers. The quality of the advertisement(s) is defined according to certain metrics, such as the quality of the content of the advertisement, the quality of the past and estimated future performance of the advertisement and the history of bidding behavior of the advertiser. After the respective quality of the advertisement(s) is determined, the advertisement(s) is ranked with other advertisements according to the determined quality.
摘要翻译：所要求保护的主题的实施例提供了用于对广告商获利进行建模的方法和系统。所要求保护的主题提供了一种方法和系统，从该方法和系统可以根据各种度量来评估广告以确定相对于其他广告的质量。相对质量考虑广告的内容，广告的表现以及广告商的投标行为的历史。所要求保护的主题的一个实施例被实现为广告商获利建模的方法。从一个或多个广告商接收一个或多个广告。广告的质量根据广告内容的质量，过去的质量以及广告的未来预测以及广告主的投标行为的历史等某些指标来定义。在确定了广告的相应质量之后，根据所确定的质量对广告进行其他广告的排序。

29. 发明授权

US07958125B2 Clustering aggregator for RSS feeds 有权
标题翻译：用于RSS源的聚类聚合器
公开(公告)号：US07958125B2
公开(公告)日：2011-06-07
申请号：US12146481
申请日：2008-06-26
申请人： Jun Yan , Ning Liu , Lei Ji , Zheng Chen , Jian Wang
发明人： Jun Yan , Ning Liu , Lei Ji , Zheng Chen , Jian Wang
IPC分类号： G06F7/00 , 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）馈送的方法。包含一个或多个术语的故事可以基于故事之间的一个或多个链接合并成一个或多个集群。可以确定在每个簇中出现术语的聚类频率。可以确定每个簇的直径。可以基于群集频率来确定与簇之一最相似的群集。可以基于每个直径和每个聚类频率来确定具有一个簇的最相似的簇。

30. 发明授权

US07925644B2 Efficient retrieval algorithm by query term discrimination 有权
标题翻译：通过查询词辨别的有效检索算法
公开(公告)号：US07925644B2
公开(公告)日：2011-04-12
申请号：US12038652
申请日：2008-02-27
申请人： Chenxi Lin , Lei Ji , HuaJun Zeng , Benyu Zhang , Zheng Chen , Jian Wang
发明人： Chenxi Lin , Lei Ji , HuaJun Zeng , Benyu Zhang , Zheng Chen , Jian Wang
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30675 , G06Q10/10
摘要： A method and system for use in information retrieval includes, for each of a plurality of terms, selecting a predetermined number of top scoring documents for the term to form a corresponding document set for the term. When a plurality of terms are received, optionally as a query, the system ranks, using an inverse document frequency algorithm, the plurality of terms for importance based on the document sets for the plurality of terms. Then a number of ranked terms are selected based on importance and a union set is formed based on the document sets associated with the selected number of ranked terms.
摘要翻译：用于信息检索的方法和系统包括对于多个术语中的每一个，为术语选择预定数量的最高评分文档以形成用于该术语的相应文档集合。当接收到多个术语时，可选地作为查询，系统使用逆文档频率算法基于多个术语的文档集来排列多个重要术语。然后，基于重要性选择多个排名项，并且基于与所选择的排序项数相关联的文档集合形成联合集合。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式