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

1. 发明授权

US09519722B1 Method and system for providing dynamic personalized recommendations for a destination 有权
标题翻译：为目的地提供动态个性化建议的方法和系统
公开(公告)号：US09519722B1
公开(公告)日：2016-12-13
申请号：US13295477
申请日：2011-11-14
申请人： Jignashu Parikh , Subhadip Sarkar
发明人： Jignashu Parikh , Subhadip Sarkar
IPC分类号： G06F17/30
CPC分类号： G06F17/3087
摘要： Methods and systems for providing a user with content relevant to a location of interest to the user, when the user is determined to be at or near the location, are presented. The user's interest in the location may be determined based on queries about the location received from the user prior to the user arriving at the location. The queries received from the user about the location are used to build a location recommendation model, which generates personalized content relevant to the location and to one or more interest verticals identified for the user. The location recommendation model is built using a location recommendation engine that collects data about the user, the queried location, one or more associations between the user, the queried location, and/or one or more other users, as well as various other information related to the user's interests and the queried location.
摘要翻译：提供了当用户被确定处于或接近该位置时向用户提供与用户感兴趣的位置相关的内容的方法和系统。可以基于在用户到达该位置之前关于从用户接收的位置的查询来确定用户对该位置的兴趣。从用户接收的关于位置的查询用于构建位置推荐模型，该模型生成与该位置相关的个性化内容以及针对用户识别的一个或多个兴趣垂直。位置推荐模型使用收集关于用户的数据，查询位置，用户，查询位置和/或一个或多个其他用户之间的一个或多个关联以及各种其他信息相关的位置推荐引擎来构建对用户的兴趣和查询的位置。

2. 发明授权

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.
摘要翻译：实施例旨在基于对朋友的联系人列表的分析来向用户提供潜在朋友的列表。用户可以提供联系人列表中的朋友的一部分用于分析，以及执行分析的分离程度和/或用于识别候选朋友的最小阈值数量。然后可以递归地遍历和合并朋友的联系人列表的子集，其中可以将常见的朋友标识为用于向用户建议朋友的候选集的成员。在一个实施例中，如果在朋友和候选者之间存在超过最小阈值的共同性，候选成员可以被保留在候选集中。候选列表也可以是使用各种方法的排序顺序，包括部分基于候选者之间的通信数量的加权能量扩散模型。

3. 发明申请

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.
摘要翻译：描述了可以识别表示基本概念的“种子短语”的“超级短语”的方法和装置，而不必比较所有可能的种子和候选短语对。根据一类实施例，类似于反向索引的数据结构被用于索引短语。通过以特定方式构建和遍历索引来实现消除种子和候选短语对。

4. 发明申请

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.
摘要翻译：在计算机化搜索系统中，根据查询搜索文档语料库，并且搜索结果作为包括一个或多个搜索匹配的有序搜索结果集可以呈现，搜索命中是文档语料库的文档或其引用。基于搜索结果集的内容，将许多建议的查询和/或参数选项呈现给查询器，从而允许查询器选择建议的查询和/或提供参数的值，并且这些选择可以用于重新排序搜索结果集的命中。所提出的特定建议的查询和/或参数取决于搜索结果集的文档的页面元素及其分类。分类可以使用概念网络完成。

5. 发明授权

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.
摘要翻译：一种促进网络中事件的自动分类的系统和方法，其中从关键字数据库检索一个或多个关键字，每个检索到的关键字匹配用户通过网络输入的事件的相应事件单元。然后选择对应于针对每个检索到的关键字计算的最高参数值的主要关键字。最后，事件根据与主要关键字相关联的一个或多个类别进行分类。可以基于与每个检索到的关键字相关联的一个或多个关键字类别和为每个关键字计算的模糊度参数值来选择主要关键字。或者，可以基于针对每个检索到的关键字计算的排名最高的输出值来选择主要关键字。随后从关键字数据库中检索与该主要关键词相关联的一个或多个类别，并且基于与主要关键字相关联的类别对事件进行分类。

6. 发明申请

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.
摘要翻译：描述各种技术，参考关键字，简档和底层用户群体的数据之间的关系，哪些关键词集和目标受众简档可以以系统和有效的方式被概括。

7. 发明申请

US20060206476A1 Reranking and increasing the relevance of the results of Internet searches 有权
公开(公告)号：US20060206476A1
公开(公告)日：2006-09-14
申请号：US11078685
申请日：2005-03-10
申请人： Shyam Kapur , Jignashu Parikh
发明人： Shyam Kapur , Jignashu Parikh
IPC分类号： G06F17/30
CPC分类号： G06F17/3061 , Y10S707/99935
摘要： Techniques are provided for reranking and increasing the relevance of the results Internet searches. A search query is initially parsed into individual units. Each unit corresponds to one or more words that represents a natural concept. A concept network is analyzed to locate concepts that are related to the units in the search query. Particular concepts are selected from the concept network. Independent Internet searches are performed for each of the selected concepts. The search results from these searches are then compared to units in the original search query and ranked according to their relevance to the original search query.

8. 发明申请

US20050080795A1 Systems and methods for search processing using superunits 有权
标题翻译：使用超级单元进行搜索处理的系统和方法
公开(公告)号：US20050080795A1
公开(公告)日：2005-04-14
申请号：US10797614
申请日：2004-03-09
申请人： Shyam Kapur , Jignashu Parikh , Deepa Joshi
发明人： Shyam Kapur , Jignashu Parikh , Deepa Joshi
IPC分类号： G06F20060101 , G06F17/00 , G06F17/30
CPC分类号： G06F17/30864 , G06F17/30705 , Y10S707/99933 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942 , Y10S707/99945 , Y10S707/99948
摘要： In a search processing system, a concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units based in part on patterns of units that appear together in queries. Units in the concept network that have some similar characteristic(s) are grouped into superunits. For each superunit, there is a corresponding signature that defines the similar characteristic of the group. A query is processed by identifying constituent units, determining the superunit membership of some or all of the constituent units, and using that information to formulate a response to the query.
摘要翻译：在搜索处理系统中，通过将查询解析为单位并且基于部分地出现在查询中一起显示的单元的模式来定义各单元之间的各种关系，从一组查询生成概念网络。具有一些相似特征的概念网络中的单元被分组成超级单元。对于每个超级单元，存在定义组的类似特征的相应签名。通过识别组成单元，确定部分或全部组成单位的超级成员资格，并使用该信息来制定对查询的响应来处理查询。

9. 发明授权

US08775409B1 Query ranking based on query clustering and categorization 有权
标题翻译：基于查询群集和分类的查询排名
公开(公告)号：US08775409B1
公开(公告)日：2014-07-08
申请号：US13314652
申请日：2011-12-08
申请人： Dhruvkaran Mehta , Jignashu Parikh
发明人： Dhruvkaran Mehta , Jignashu Parikh
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/3064 , G06F17/3071
摘要： Methods, systems, and apparatus, including computer program products, for query ranking based on query clustering and categorization, are disclosed. In one aspect, search queries are selected and grouped into one or more clusters. A representative query is selected for each cluster. Each cluster is associated with a respective representative category. A rank is assigned to each cluster based on a cluster popularity score of the cluster and a category popularity score of the cluster's representative category. The selected representative queries are presented in order according to the ranks of their respective clusters.
摘要翻译：公开了用于基于查询聚类和分类的查询排序的方法，系统和装置，包括计算机程序产品。在一个方面，搜索查询被选择并分组成一个或多个集群。为每个集群选择代表性查询。每个群集与相应的代表类别相关联。根据群集的群集流行度得分和群集代表类别的类别流行度得分，为每个群集分配等级。所选择的代表性查询根据其各自的簇的排列顺序呈现。

10. 发明授权

US08145623B1 Query ranking based on query clustering and categorization 有权
标题翻译：基于查询群集和分类的查询排名
公开(公告)号：US08145623B1
公开(公告)日：2012-03-27
申请号：US12434517
申请日：2009-05-01
申请人： Dhruvkaran Mehta , Jignashu Parikh
发明人： Dhruvkaran Mehta , Jignashu Parikh
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/3064 , G06F17/3071
摘要： Methods, systems, and apparatus, including computer program products, for query ranking based on query clustering and categorization, are disclosed. In one aspect, search queries are selected and grouped into one or more clusters. A representative query is selected for each cluster. Each cluster is associated with a respective representative category. A rank is assigned to each cluster based on a cluster popularity score of the cluster and a category popularity score of the cluster's representative category. The selected representative queries are presented in order according to the ranks of their respective clusters.
摘要翻译：公开了用于基于查询聚类和分类的查询排序的方法，系统和装置，包括计算机程序产品。在一个方面，搜索查询被选择并分组成一个或多个集群。为每个集群选择代表性查询。每个群集与相应的代表类别相关联。根据群集的群集流行度得分和群集代表类别的类别流行度得分，为每个群集分配等级。所选择的代表性查询根据其各自的簇的排列顺序呈现。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式