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

1. 发明申请

US20120078935A1 IDENTIFYING SUPERPHRASES OF TEXT STRINGS 有权
标题翻译：识别文字的超文本
公开(公告)号：US20120078935A1
公开(公告)日：2012-03-29
申请号：US13313852
申请日：2011-12-07
申请人： Jignashu Parikh , Narayan L. Bhamidipati , Rajesh Parekh
发明人： Jignashu Parikh , Narayan L. Bhamidipati , Rajesh Parekh
IPC分类号： G06F17/30
CPC分类号： G06F17/30672
摘要： Methods and apparatus are described by which “superphrases” of “seed phrases” representing basic concepts may be identified without having to compare all possible pairs of seed and candidate phrases. According to one class of embodiments, a data structure similar to an inverted index is used for indexing phrases. The elimination of seed and candidate phrase pairs is enabled by building and traversing the index in a particular manner.
摘要翻译：描述了可以识别表示基本概念的“种子短语”的“超级短语”的方法和装置，而不必比较所有可能的种子和候选短语对。根据一类实施例，类似于反向索引的数据结构被用于索引短语。通过以特定方式构建和遍历索引来实现消除种子和候选短语对。

2. 发明申请

US20090265303A1 IDENTIFYING SUPERPHRASES OF TEXT STRINGS 有权
标题翻译：识别文字的超文本
公开(公告)号：US20090265303A1
公开(公告)日：2009-10-22
申请号：US12104168
申请日：2008-04-16
申请人： Jignashu Parikh , Narayan L. Bhamidipati , Rajesh Parekh
发明人： Jignashu Parikh , Narayan L. Bhamidipati , Rajesh Parekh
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30672
摘要： Methods and apparatus are described by which “superphrases” of “seed phrases” representing basic concepts may be identified without having to compare all possible pairs of seed and candidate phrases. According to one class of embodiments, a data structure similar to an inverted index is used for indexing phrases. The elimination of seed and candidate phrase pairs is enabled by building and traversing the index in a particular manner.
摘要翻译：描述了可以识别表示基本概念的“种子短语”的“超级短语”的方法和装置，而不必比较所有可能的种子和候选短语对。根据一类实施例，类似于反向索引的数据结构被用于索引短语。通过以特定方式构建和遍历索引来实现消除种子和候选短语对。

3. 发明授权

US08095540B2 Identifying superphrases of text strings 有权
标题翻译：识别文本字符串的超文本
公开(公告)号：US08095540B2
公开(公告)日：2012-01-10
申请号：US12104168
申请日：2008-04-16
申请人： Jignashu Parikh , Narayan L. Bhamidipati , Rajesh Parekh
发明人： Jignashu Parikh , Narayan L. Bhamidipati , Rajesh Parekh
IPC分类号： G06F17/30
CPC分类号： G06F17/30672
摘要： Methods and apparatus are described by which “superphrases” of “seed phrases” representing basic concepts may be identified without having to compare all possible pairs of seed and candidate phrases. According to one class of embodiments, a data structure similar to an inverted index is used for indexing phrases. The elimination of seed and candidate phrase pairs is enabled by building and traversing the index in a particular manner.
摘要翻译：描述了可以识别表示基本概念的“种子短语”的“超级短语”的方法和装置，而不必比较所有可能的种子和候选短语对。根据一类实施例，类似于反向索引的数据结构被用于索引短语。通过以特定方式构建和遍历索引来实现消除种子和候选短语对。

4. 发明申请

US20090265328A1 PREDICTING NEWSWORTHY QUERIES USING COMBINED ONLINE AND OFFLINE MODELS 审中-公开
标题翻译：使用组合的在线和离线模型预测新闻的疑问
公开(公告)号：US20090265328A1
公开(公告)日：2009-10-22
申请号：US12104111
申请日：2008-04-16
申请人： Rajesh Parekh , Jignashu Parikh , Pavel Berkhin
发明人： Rajesh Parekh , Jignashu Parikh , Pavel Berkhin
IPC分类号： G06F17/30
CPC分类号： G06F16/951 , G06F16/334
摘要： Methods and apparatus are described for identifying newsworthy search queries employing a machine learning approach which combines offline and online modeling to achieve a high level of accuracy as well as timeliness and scalability.
摘要翻译：描述了使用机器学习方法来识别具有新闻价值的搜索查询的方法和装置，其结合了离线和在线建模以实现高水平的准确性以及及时性和可扩展性。

5. 发明申请

US20110035273A1 PROFILE RECOMMENDATIONS FOR ADVERTISEMENT CAMPAIGN PERFORMANCE IMPROVEMENT 审中-公开
标题翻译：简介关于广告推广绩效改进的建议
公开(公告)号：US20110035273A1
公开(公告)日：2011-02-10
申请号：US12536334
申请日：2009-08-05
申请人： Jignashu Parikh , Vijay Krishna Narayanan , Rushi P. Bhatt , Xia Wan , Rajesh Parekh
发明人： Jignashu Parikh , Vijay Krishna Narayanan , Rushi P. Bhatt , Xia Wan , Rajesh Parekh
IPC分类号： G06Q30/00 , G06Q10/00
CPC分类号： G06Q30/02 , G06Q30/0243
摘要： A method for recommending improvements to advertisement campaign performance includes receiving a seed campaign insertion order (IO) having one or more campaign IO lines; computing a plurality of neighbor ad campaigns based on comparison of the seed campaign IO with a dataset of advertiser ad campaign IO lines; generating campaign IO recommendations by executing an algorithm to recommend profiles to add to the seed campaign IO from booking lines corresponding to the profiles based on performance of such use by the neighbor ad campaigns being generally above average when compared with campaigns that did not use the recommended profiles; filtering the profile recommendations based on a plurality of performance-enhancing criteria of the seed campaign IO and the neighbor ad campaigns with respect to each potential profile recommendation; ranking the profile recommendations based on at least one performance metric; and displaying the ranked profile recommendations to the advertiser for selection.
摘要翻译：一种用于推荐改进广告活动性能的方法包括：接收具有一个或多个活动IO线的种子活动插入订单（IO）; 基于种子活动IO与广告主广告活动IO行的数据集的比较来计算多个邻居广告活动; 通过执行一种算法，通过执行一种算法来推荐配置文件，以推荐配置文件，以根据与配置文件相对应的预定行添加种子广告系列IO，这些配置文件基于相邻广告系列的使用效果，通常高于平均水平，与未使用推荐的广告系列相比档案; 基于关于每个潜在简档建议的种子活动IO和邻居广告活动的多个绩效增强标准来过滤简档建议; 根据至少一个绩效指标对简档建议进行排名; 并向广告商显示排名的配置文件推荐以进行选择。

6. 发明授权

US08655902B2 Identifying superphrases of text strings 有权
标题翻译：识别文本字符串的超文本
公开(公告)号：US08655902B2
公开(公告)日：2014-02-18
申请号：US13313852
申请日：2011-12-07
申请人： Jignashu Parikh , Narayan Bhamidipati , Rajesh Parekh
发明人： Jignashu Parikh , Narayan Bhamidipati , Rajesh Parekh
IPC分类号： G06F17/30
CPC分类号： G06F17/30672
摘要： Methods and apparatus are described by which “superphrases” of “seed phrases” representing basic concepts may be identified without having to compare all possible pairs of seed and candidate phrases. According to one class of embodiments, a data structure similar to an inverted index is used for indexing phrases. The elimination of seed and candidate phrase pairs is enabled by building and traversing the index in a particular manner.
摘要翻译：描述了可以识别表示基本概念的“种子短语”的“超级短语”的方法和装置，而不必比较所有可能的种子和候选短语对。根据一类实施例，类似于反向索引的数据结构被用于索引短语。通过以特定方式构建和遍历索引来实现消除种子和候选短语对。

7. 发明授权

US08744976B2 Discovery of friends using social network graph properties 有权
标题翻译：发现朋友使用社交网络图属性
公开(公告)号：US08744976B2
公开(公告)日：2014-06-03
申请号：US12111050
申请日：2008-04-28
申请人： Sunil Jagadish , Jignashu Parikh
发明人： Sunil Jagadish , Jignashu Parikh
IPC分类号： G06Q99/00 , G06F17/30
CPC分类号： G06Q10/10 , H04L51/02 , H04L51/16 , H04L51/28 , H04L51/32
摘要： Embodiments are directed towards providing a list of potential friends to a user based on an analysis of friends' contact lists. The user may provide a subset of friends within a contact list for analysis, along with a degree of separation over which to perform the analysis, and/or a minimum threshold number of occurrences for identifying a candidate friend. The subset of friends' contact lists may then be recursively traversed and merged, where common friends may be identified as members of a candidate set for suggesting friends to the user. In one embodiment, the candidate members may be retained within the candidate set if there is a commonality between the friends and the candidate that exceeds the minimum threshold. The candidate list may also be rank order using various approaches, including a weighted energy diffusion model based in part on a number of communications between the candidates.
摘要翻译：实施例旨在基于对朋友的联系人列表的分析来向用户提供潜在朋友的列表。用户可以提供联系人列表中的朋友的一部分用于分析，以及执行分析的分离程度和/或用于识别候选朋友的最小阈值数量。然后可以递归地遍历和合并朋友的联系人列表的子集，其中可以将常见的朋友标识为用于向用户建议朋友的候选集的成员。在一个实施例中，如果在朋友和候选者之间存在超过最小阈值的共同性，候选成员可以被保留在候选集中。候选列表也可以是使用各种方法的排序顺序，包括部分基于候选者之间的通信数量的加权能量扩散模型。

8. 发明申请

US20110145225A1 CUSTOMIZABLE ORDERING OF SEARCH RESULTS AND PREDICTIVE QUERY GENERATION 审中-公开
标题翻译：搜索结果的可定制订单和预测查询生成
公开(公告)号：US20110145225A1
公开(公告)日：2011-06-16
申请号：US13034982
申请日：2011-02-25
申请人： Jignashu Parikh , J.P. Harish , Shyam Kapur
发明人： Jignashu Parikh , J.P. Harish , Shyam Kapur
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： In a computerized search system, a document corpus is searched according to a query and results of the search are presentable as an ordered search result set comprising one or more search hits, a search hit being a document of the document corpus or reference thereto. Based on content of the search result set, a number of suggested queries and/or parameter options are presented to a querier, thereby allowing the querier to select a suggested query and/or provide values for the parameters and those selections can be used to reorder the hits of the search result set. The particular suggested queries and/or parameters presented depend on the page elements of the search result set's documents and their categorization. The categorization might be done using concept networks.
摘要翻译：在计算机化搜索系统中，根据查询搜索文档语料库，并且搜索结果作为包括一个或多个搜索匹配的有序搜索结果集可以呈现，搜索命中是文档语料库的文档或其引用。基于搜索结果集的内容，将许多建议的查询和/或参数选项呈现给查询器，从而允许查询器选择建议的查询和/或提供参数的值，并且这些选择可以用于重新排序搜索结果集的命中。所提出的特定建议的查询和/或参数取决于搜索结果集的文档的页面元素及其分类。分类可以使用概念网络完成。

9. 发明授权

US07814109B2 Automatic categorization of network events 有权
标题翻译：自动分类网络事件
公开(公告)号：US07814109B2
公开(公告)日：2010-10-12
申请号：US11394342
申请日：2006-03-29
申请人： Chad Brower , Shyam Kapur , Brian Coppola , Joshua M. Koran , Jignashu Parikh
发明人： Chad Brower , Shyam Kapur , Brian Coppola , Joshua M. Koran , Jignashu Parikh
IPC分类号： G06F17/30
CPC分类号： G06Q30/02
摘要： A system and method to facilitate automatic categorization of events in a network, wherein one or more keywords are retrieved from a keyword database, each retrieved keyword matching a corresponding event unit of an event input by a user over a network. A dominant keyword corresponding to a highest parameter value calculated for each retrieved keyword is then selected. Finally, the event is categorized based on one or more categories associated with the dominant keyword. The dominant keyword may be selected based on one or more keyword categories associated with each retrieved keyword and an ambiguity parameter value calculated for each keyword. Alternatively, the dominant keyword may be selected based on a highest-ranked output value calculated for each retrieved keyword. One or more categories associated with the dominant keyword are subsequently retrieved from the keyword database and the event is categorized based on the category associated with the dominant keyword.
摘要翻译：一种促进网络中事件的自动分类的系统和方法，其中从关键字数据库检索一个或多个关键字，每个检索到的关键字匹配用户通过网络输入的事件的相应事件单元。然后选择对应于针对每个检索到的关键字计算的最高参数值的主要关键字。最后，事件根据与主要关键字相关联的一个或多个类别进行分类。可以基于与每个检索到的关键字相关联的一个或多个关键字类别和为每个关键字计算的模糊度参数值来选择主要关键字。或者，可以基于针对每个检索到的关键字计算的排名最高的输出值来选择主要关键字。随后从关键字数据库中检索与该主要关键词相关联的一个或多个类别，并且基于与主要关键字相关联的类别对事件进行分类。

10. 发明申请

US20070282785A1 Keyword set and target audience profile generalization techniques 有权
标题翻译：关键字集和目标受众概况泛化技术
公开(公告)号：US20070282785A1
公开(公告)日：2007-12-06
申请号：US11444996
申请日：2006-05-31
申请人： Usama M. Fayyad , Pavel Berkhin , Andrew Tomkins , Rajesh Girish Parekh , Jignashu Parikh , David Wellspring Sculley
发明人： Usama M. Fayyad , Pavel Berkhin , Andrew Tomkins , Rajesh Girish Parekh , Jignashu Parikh , David Wellspring Sculley
IPC分类号： G06F17/30
CPC分类号： G06F17/30699 , G06Q30/0207 , G06Q30/0244
摘要： A variety of techniques are described by which keyword sets and target audience profiles may be generalized in a systematic and effective way with reference to relationships between keywords, profiles, and the data of an underlying user population.
摘要翻译：描述各种技术，参考关键字，简档和底层用户群体的数据之间的关系，哪些关键词集和目标受众简档可以以系统和有效的方式被概括。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式