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

1. 发明申请

US20110302103A1 POPULARITY PREDICTION OF USER-GENERATED CONTENT 审中-公开
标题翻译：用户生成内容的人气预测
公开(公告)号：US20110302103A1
公开(公告)日：2011-12-08
申请号：US12795684
申请日：2010-06-08
申请人： David Carmel , Haggai Roitman , Elad Yom-Tov
发明人： David Carmel , Haggai Roitman , Elad Yom-Tov
IPC分类号： G06Q99/00 , G06Q50/00
CPC分类号： G06Q10/10 , G06Q30/0282
摘要： A method, system, and computer program product for popularity prediction of user-generated content are provided. The method includes measuring the novelty of a user-generated content and predicting the popularity of the user-generated content based on the measured novelty. Predicting the popularity of the user-generated content includes: extracting basic features of the user-generated content; measuring novelty features of the user-generated content; and predicting the popularity based on the basic features and novelty features. Measuring the novelty of a user-generated content includes one or more of: measuring a relative novelty of the user-generated content with respect to the contribution history of the same user in a given time period; measuring a relative novelty of the user-generated content with respect to user-generated content of other users in a given time period; and measuring a relative novelty of the user-generated content with respect to the references by other users to the user-generated content.
摘要翻译：提供了一种用于用户生成内容的普及预测的方法，系统和计算机程序产品。该方法包括测量用户生成的内容的新颖性，并且基于所测量的新颖性来预测用户生成的内容的普及度。预测用户生成内容的普及性包括：提取用户生成的内容的基本特征; 测量用户生成内容的新奇特征; 并根据基本特征和新颖特征预测人气。测量用户产生的内容的新颖性包括以下一个或多个：在给定时间段内相对于同一用户的贡献历史测量用户生成的内容的相对新颖性; 测量在给定时间段内用户生成的内容相对于其他用户的用户生成内容的相对新颖性; 并且测量用户生成的内容相对于其他用户对用户生成的内容的引用的相对新颖性。

2. 发明授权

US08266157B2 Method and system for using social bookmarks 有权
标题翻译：使用社交书签的方法和系统
公开(公告)号：US08266157B2
公开(公告)日：2012-09-11
申请号：US12550376
申请日：2009-08-30
申请人： David Carmel , Haggai Roitman , Elad Yom-Tov
发明人： David Carmel , Haggai Roitman , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30
摘要： A method and system for using social bookmarks wherein a social bookmark is a triplet of the entities of user, document, and tag. The method including: collecting multiple bookmarks; representing the bookmarks as a three-dimensional space or matrix of the number of times a user u, used tag t to bookmark document d; measuring the similarity of two entities of the same type; and using the similarity to weight bookmarks or entities. The weightings may be used to provide a measure of a usefulness of a bookmark for describing a document for retrieval purposes. Two-dimensions of the bookmark space may also be used to predict the third-dimension.
摘要翻译：一种用于使用社交书签的方法和系统，其中社交书签是用户，文档和标签的实体的三元组。该方法包括：收集多个书签; 将书签代表用户u的三维空间或矩阵，使用标签t来书签文件d; 测量相同类型的两个实体的相似度; 并使用相似度加权书签或实体。权重可用于提供用于描述用于检索目的的文档的书签的有用性的量度。书签空间的二维还可以用于预测第三维。

3. 发明授权

US07970739B2 Method and system for maintaining profiles of information channels 有权
标题翻译：维护信息通道的方法和系统
公开(公告)号：US07970739B2
公开(公告)日：2011-06-28
申请号：US12111972
申请日：2008-04-30
申请人： David Carmel , Haggai Roitman , Elad Yom-Tov
发明人： David Carmel , Haggai Roitman , Elad Yom-Tov
IPC分类号： G06F7/00
CPC分类号： G06F17/30867 , H04L69/14
摘要： A method and system are provided for maintaining profiles of information channels available on the Web, wherein the information channels are accessed via pull-only protocols. The method includes monitoring one or more channels by a channel pull action at a monitoring rate, wherein the monitoring rate is determined for the one or more channels based on the number of update events in a previous time period. The method may optimally include filtering the update events in the time period by a novelty measure, wherein the filtering disregards events that do not include significant novel information. The monitoring rate is adapted based on reinforcement learning applying iterative learning rules over time.
摘要翻译：提供了一种用于维护在Web上可用的信息信道的简档的方法和系统，其中通过仅拉协议访问信息信道。该方法包括以监视速率通过信道拉动操作监视一个或多个信道，其中基于前一时间段内的更新事件的数量来确定针对一个或多个信道的监视速率。该方法可以最佳地包括通过新颖度量来对该时间段内的更新事件进行过滤，其中过滤忽略不包括重要新颖信息的事件。基于强化学习，随着时间的推移应用迭代学习规则，对监测率进行了调整。

4. 发明申请

US20110219056A1 Method and System for Maintaining Profiles of Information Channels 失效
标题翻译：维护信息渠道的方法和系统
公开(公告)号：US20110219056A1
公开(公告)日：2011-09-08
申请号：US13105924
申请日：2011-05-12
申请人： David Carmel , Haggai Roitman , Elad Yom-Tov
发明人： David Carmel , Haggai Roitman , Elad Yom-Tov
IPC分类号： G06F15/16 , G06F15/18
CPC分类号： G06F17/30867 , H04L69/14
摘要： A method and system are provided for maintaining profiles of information channels available on the Web, wherein the information channels are accessed via pull-only protocols. The method includes monitoring one or more channels by a channel pull action at a monitoring rate, wherein the monitoring rate is determined for the one or more channels based on the number of update events in a previous time period. The method may optimally include filtering the update events in the time period by a novelty measure, wherein the filtering disregards events that do not include significant novel information. The monitoring rate is adapted based on reinforcement learning applying iterative learning rules over time.
摘要翻译：提供了一种用于维护在Web上可用的信息信道的简档的方法和系统，其中通过仅拉协议访问信息信道。该方法包括以监视速率通过信道拉动操作监视一个或多个信道，其中基于前一时间段内的更新事件的数量来确定针对一个或多个信道的监视速率。该方法可以最佳地包括通过新颖度量来对该时间段内的更新事件进行过滤，其中过滤忽略不包括重要新颖信息的事件。基于强化学习，随着时间的推移应用迭代学习规则，对监测率进行了调整。

5. 发明授权

US08176011B2 Method and system for maintaining profiles of information channels 失效
标题翻译：维护信息通道的方法和系统
公开(公告)号：US08176011B2
公开(公告)日：2012-05-08
申请号：US13105924
申请日：2011-05-12
申请人： David Carmel , Haggai Roitman , Elad Yom-Tov
发明人： David Carmel , Haggai Roitman , Elad Yom-Tov
IPC分类号： G06F7/00
CPC分类号： G06F17/30867 , H04L69/14
摘要： A method and system are provided for maintaining profiles of information channels available on the Web, wherein the information channels are accessed via pull-only protocols. The method includes monitoring one or more channels by a channel pull action at a monitoring rate, wherein the monitoring rate is determined for the one or more channels based on the number of update events in a previous time period. The method may optimally include filtering the update events in the time period by a novelty measure, wherein the filtering disregards events that do not include significant novel information. The monitoring rate is adapted based on reinforcement learning applying iterative learning rules over time.
摘要翻译：提供了一种用于维护在Web上可用的信息信道的简档的方法和系统，其中通过仅拉协议访问信息信道。该方法包括以监视速率通过信道拉动操作监视一个或多个信道，其中基于前一时间段内的更新事件的数量来确定针对一个或多个信道的监视速率。该方法可以最佳地包括通过新颖度量来对该时间段内的更新事件进行过滤，其中过滤忽略不包括重要新颖信息的事件。基于强化学习，随着时间的推移应用迭代学习规则，对监测率进行了调整。

6. 发明申请

US20110219011A1 METHOD AND SYSTEM FOR USING SOCIAL BOOKMARKS 有权
标题翻译：使用社会书签的方法和系统
公开(公告)号：US20110219011A1
公开(公告)日：2011-09-08
申请号：US12550376
申请日：2009-08-30
申请人： David Carmel , Haggai Roitman , Elad Yom-Tov
发明人： David Carmel , Haggai Roitman , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30
摘要： A method and system for using social bookmarks wherein a social bookmark is a triplet of the entities of user, document, and tag. The method including: collecting multiple bookmarks; representing the bookmarks as a three-dimensional space or matrix of the number of times a user u, used tag t to bookmark document d; measuring the similarity of two entities of the same type; and using the similarity to weight bookmarks or entities. The weightings may be used to provide a measure of a usefulness of a bookmark for describing a document for retrieval purposes. Two-dimensions of the bookmark space may also be used to predict the third-dimension.
摘要翻译：一种用于使用社交书签的方法和系统，其中社交书签是用户，文档和标签的实体的三元组。该方法包括：收集多个书签; 将书签代表用户u的三维空间或矩阵，使用标签t来书签文件d; 测量相同类型的两个实体的相似度; 并使用相似度加权书签或实体。权重可用于提供用于描述用于检索目的的文档的书签的有用性的量度。书签空间的二维还可以用于预测第三维。

7. 发明申请

US20090276457A1 Method and System for Maintaining Profiles of Information Channels 有权
标题翻译：维护信息渠道的方法和系统
公开(公告)号：US20090276457A1
公开(公告)日：2009-11-05
申请号：US12111972
申请日：2008-04-30
申请人： David Carmel , Haggai Roitman , Elad Yom-Tov
发明人： David Carmel , Haggai Roitman , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , H04L69/14
摘要： A method and system are provided for maintaining profiles of information channels available on the Web, wherein the information channels are accessed via pull-only protocols. The method includes monitoring one or more channels by a channel pull action at a monitoring rate, wherein the monitoring rate is determined for the one or more channels based on the number of update events in a previous time period. The method may optimally include filtering the update events in the time period by a novelty measure, wherein the filtering disregards events that do not include significant novel information. The monitoring rate is adapted based on reinforcement learning applying iterative learning rules over time.
摘要翻译：提供了一种用于维护在Web上可用的信息信道的简档的方法和系统，其中通过仅拉协议访问信息信道。该方法包括以监视速率通过信道拉动操作监视一个或多个信道，其中基于前一时间段内的更新事件的数量来确定针对一个或多个信道的监视速率。该方法可以最佳地包括通过新颖度量来对该时间段内的更新事件进行过滤，其中过滤忽略不包括重要新颖信息的事件。基于强化学习，随着时间的推移应用迭代学习规则，对监测率进行了调整。

8. 发明授权

US07406462B2 Prediction of query difficulty for a generic search engine 失效
标题翻译：通用搜索引擎查询难度的预测
公开(公告)号：US07406462B2
公开(公告)日：2008-07-29
申请号：US10968692
申请日：2004-10-19
申请人： David Carmel , Lawrence Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Lawrence Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/957 , Y10S707/99932 , Y10S707/99933
摘要： A query difficulty prediction unit includes a query difficulty predictor to determine the extent of overlap between query documents received from a search engine operating on an input query and sub-query documents received from the search engine operating on sub-queries of the input query. The unit generates a query difficulty prediction from the extent of overlap.
摘要翻译：查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。该单元从重叠的程度产生查询难度预测。

9. 发明申请

US20060085399A1 Prediction of query difficulty for a generic search engine 失效
标题翻译：通用搜索引擎查询难度的预测
公开(公告)号：US20060085399A1
公开(公告)日：2006-04-20
申请号：US10968692
申请日：2004-10-19
申请人： David Carmel , Lawrence Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Lawrence Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/957 , Y10S707/99932 , Y10S707/99933
摘要： A query difficulty prediction unit includes a query difficulty predictor to determine the extent of overlap between query documents received from a search engine operating on an input query and sub-query documents received from the search engine operating on sub-queries of the input query. The unit generates a query difficulty prediction from the extent of overlap.
摘要翻译：查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。该单元从重叠的程度产生查询难度预测。

10. 发明授权

US07792830B2 Analyzing the ability to find textual content 有权
标题翻译：分析查找文字内容的能力
公开(公告)号：US07792830B2
公开(公告)日：2010-09-07
申请号：US11461464
申请日：2006-08-01
申请人： David Carmel , Adam Darlow , Shai Fine , Dan Pelleg , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Dan Pelleg , Elad Yom-Tov
IPC分类号： G06F7/00 , G06F17/30 , G06F15/18 , G06F17/00 , G06N5/02
CPC分类号： G06F17/30675
摘要： A method and system for analyzing a document set (202, 420) are provided. The method includes determining a set of terms (312) from the terms of the document set that minimizes a distance measurement (405) from the given set of documents (420). The method includes using a greedy algorithm to build the set of terms incrementally, at each stage finding a single word that is closest to the document set (202, 420). The set of terms is evaluated to assess the ability to find the document set (202, 420). The set of terms are compared with expected terms to evaluate the ability to find the document set (202, 420). A measure of the ability to find a document set (202, 420) is provided by computing a distance measure (403) between a document set and an entire collection.
摘要翻译：提供了一种用于分析文档集（202,420）的方法和系统。该方法包括从文档集合的术语中确定一组术语（312），该文档集合的术语使距离给定文档集合（420）最小化距离测量（405）。该方法包括使用贪心算法逐渐建立术语集合，在每个阶段找到最靠近文档集（202,420）的单个单词。评估一组术语以评估查找文档集（202,420）的能力。将这组术语与预期术语进行比较，以评估查找文档集（202,420）的能力。通过计算文档集和整个集合之间的距离度量（403）来提供查找文档集（202,420）的能力的度量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式