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

1. 发明授权

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.
摘要翻译：查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。该单元从重叠的程度产生查询难度预测。

2. 发明授权

US07984039B2 Merging of results in distributed information retrieval 有权
标题翻译：结果在分布式信息检索中合并
公开(公告)号：US07984039B2
公开(公告)日：2011-07-19
申请号：US11183086
申请日：2005-07-14
申请人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： A method and system are provided of merging results in distributed information retrieval. A search manager is in communication with a plurality of components, wherein a component is a search engine working on a document collection and returning results in the form of a list of documents to a search query. The search manager submits a query to the plurality of components, receives results from each component in the form of a list of documents; estimates the success of a component in handling the query to generate a merit score for a component per query; applies the merit score to the results for the component; and merges results from the plurality of components by ranking in order of the applied merit score.
摘要翻译：提供了一种在分布式信息检索中合并结果的方法和系统。搜索管理器与多个组件进行通信，其中组件是对文档收集工作的搜索引擎，并以搜索查询的文档列表的形式返回结果。搜索管理器向多个组件提交查询，以文档列表的形式从每个组件接收结果; 估计组件处理查询的成功，以生成每个查询的组件的优点得分; 将优点分数应用于组件的结果; 并且通过按照所应用的优点得分的顺序来排列来自多个组分的结果。

3. 发明申请

US20080033971A1 Analyzing the Ability to Find Textual Content 有权
标题翻译：分析查找文本内容的能力
公开(公告)号：US20080033971A1
公开(公告)日：2008-02-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
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）的能力的度量。

4. 发明申请

US20070016574A1 Merging of results in distributed information retrieval 有权
标题翻译：结果在分布式信息检索中合并
公开(公告)号：US20070016574A1
公开(公告)日：2007-01-18
申请号：US11183086
申请日：2005-07-14
申请人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： A method and system are provided of merging results in distributed information retrieval. A search manager (104) is in communication with a plurality of components, wherein a component is a search engine (106-108) working on a document collection and returning results in the form of a list of documents to a search query. The search manager (104) submits a query (202) to the plurality of components, receives results (213) from each component in the form of a list of documents; estimates (208) the success of a component in handling the query to generate a merit score (210) for a component per query; applies (220) the merit score (210) to the results for the component; and merges (222) results from the plurality of components by ranking in order of the applied merit score.
摘要翻译：提供了一种在分布式信息检索中合并结果的方法和系统。搜索管理器（104）与多个组件通信，其中组件是在文档收集上工作的搜索引擎（106-108），并以搜索查询的文档列表的形式返回结果。搜索管理器（104）向多个组件提交查询（202），以文档列表的形式从每个组件接收结果（213）; 估计（208）组件在处理查询中的成功以生成每个查询的组件的优点得分（210）; 将优点得分（210）（220）应用于组件的结果; 并通过按照应用的优点得分的顺序来合并来自多个成分的结果（222）。

5. 发明授权

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）的能力的度量。

6. 发明申请

US20070016545A1 Detection of missing content in a searchable repository 审中-公开
标题翻译：检测可搜索存储库中缺少的内容
公开(公告)号：US20070016545A1
公开(公告)日：2007-01-18
申请号：US11181324
申请日：2005-07-14
申请人： Andrei Broder , David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： Andrei Broder , David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F16/28
摘要： A method and system for the detection of missing content in a searchable repository is provided. A system includes: a missing content query identifier (401) for identifying queries to a search engine (102) for which no or little relevant content is returned; a missing content detector (110) which clusters missing content queries by topic; and an output provider for providing details of a missing content topic.
摘要翻译：提供了一种用于检测可搜索存储库中缺少内容的方法和系统。一种系统包括：缺少的内容查询标识符（401），用于识别对没有返回或没有相关内容的搜索引擎（102）的查询; 一个丢失的内容检测器（110），其通过主题聚集丢失的内容查询; 以及用于提供缺少的内容主题的细节的输出提供者。

7. 发明申请

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.
摘要翻译：查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。该单元从重叠的程度产生查询难度预测。

8. 发明申请

US20110295649A1 AUTOMATIC CHURN PREDICTION 审中-公开
标题翻译：自动预测
公开(公告)号：US20110295649A1
公开(公告)日：2011-12-01
申请号：US12790850
申请日：2010-05-31
申请人： Shai Fine , Elad Yom-Tov , Yossi Richter
发明人： Shai Fine , Elad Yom-Tov , Yossi Richter
IPC分类号： G06Q10/00 , G06F15/18 , G06N5/02 , G06Q50/00
CPC分类号： G06Q30/0202 , G06Q30/0201
摘要： Churn prediction is performed by monitoring quality of service levels provided to customers. A time in which the customer is due to either churn or renew his agreement with the service provider may be monitored or computed. Machine learning methods may be utilized to determine a probability of churn based on historic data. Based upon the determination an output to retention personnel may be provided and an improved offer may be made to customers that are deemed in risk of churning.
摘要翻译：通过监控提供给客户的服务水平来进行流失预测。可能会监控或计算客户应该与服务提供商协商或更新协议的时间。可以利用机器学习方法来确定基于历史数据的流失概率。根据确定，可以提供保留人员的产出，并且可以对被认为有搅拌风险的客户进行改进的报价。

9. 发明申请

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.
摘要翻译：提供了一种用于用户生成内容的普及预测的方法，系统和计算机程序产品。该方法包括测量用户生成的内容的新颖性，并且基于所测量的新颖性来预测用户生成的内容的普及度。预测用户生成内容的普及性包括：提取用户生成的内容的基本特征; 测量用户生成内容的新奇特征; 并根据基本特征和新颖特征预测人气。测量用户产生的内容的新颖性包括以下一个或多个：在给定时间段内相对于同一用户的贡献历史测量用户生成的内容的相对新颖性; 测量在给定时间段内用户生成的内容相对于其他用户的用户生成内容的相对新颖性; 并且测量用户生成的内容相对于其他用户对用户生成的内容的引用的相对新颖性。

10. 发明授权

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; 测量相同类型的两个实体的相似度; 并使用相似度加权书签或实体。权重可用于提供用于描述用于检索目的的文档的书签的有用性的量度。书签空间的二维还可以用于预测第三维。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式