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

1. 发明授权

US09171045B2 Recommending queries according to mapping of query communities 有权
标题翻译：根据查询社区的映射推荐查询
公开(公告)号：US09171045B2
公开(公告)日：2015-10-27
申请号：US12943951
申请日：2010-11-11
申请人： Nina Mishra , Sreenivas Gollapudi , Srikanth Jagabathula
发明人： Nina Mishra , Sreenivas Gollapudi , Srikanth Jagabathula
IPC分类号： G06F17/30
CPC分类号： G06F17/30528 , G06F17/3097
摘要： A set of queries, such as a search log, is divided into commercial queries and non-commercial queries. A first set of query communities is determined from the non-commercial queries and a second set is determined from the commercial queries. The query communities are correlated based on the users who submitted the queries and instances where a query from the first set of query communities was followed by a query from the second set to generate a mapping between the first set of query communities and the second set. Later, a non-commercial query is received from a user, and the mapping is used to predict one or more commercial queries that the user is likely to submit in the future based on the non-commercial query. One or more of the commercial queries are presented to the user according to the mapping with search results responsive to the non-commercial query.
摘要翻译：诸如搜索日志的一组查询被分为商业查询和非商业查询。从非商业查询确定第一组查询社区，并从商业查询中确定第二组。查询社区是基于提交查询的用户和来自第一组查询社区的查询后跟来自第二组的查询的用户相关联的，以生成第一组查询社区和第二组之间的映射。之后，从用户接收到非商业查询，并且映射用于基于非商业查询来预测用户将来可能提交的一个或多个商业查询。根据与响应于非商业查询的搜索结果的映射，向用户呈现一个或多个商业查询。

2. 发明申请

US20120124070A1 RECOMMENDING QUERIES ACCORDING TO MAPPING OF QUERY COMMUNITIES 有权
标题翻译：根据查询社区的映射建议的查询
公开(公告)号：US20120124070A1
公开(公告)日：2012-05-17
申请号：US12943951
申请日：2010-11-11
申请人： Nina Mishra , Sreenivas Gollapudi , Srikanth Jagabathula
发明人： Nina Mishra , Sreenivas Gollapudi , Srikanth Jagabathula
IPC分类号： G06F17/30
CPC分类号： G06F17/30528 , G06F17/3097
摘要： A set of queries, such as a search log, is divided into commercial queries and non-commercial queries. A first set of query communities is determined from the non-commercial queries and a second set is determined from the commercial queries. The query communities are correlated based on the users who submitted the queries and instances where a query from the first set of query communities was followed by a query from the second set to generate a mapping between the first set of query communities and the second set. Later, a non-commercial query is received from a user, and the mapping is used to predict one or more commercial queries that the user is likely to submit in the future based on the non-commercial query. One or more of the commercial queries are presented to the user according to the mapping with search results responsive to the non-commercial query.
摘要翻译：诸如搜索日志的一组查询被分为商业查询和非商业查询。从非商业查询确定第一组查询社区，并从商业查询中确定第二组。查询社区是基于提交查询的用户和来自第一组查询社区的查询后跟来自第二组的查询的用户相关联的，以生成第一组查询社区和第二组之间的映射。之后，从用户接收到非商业查询，并且映射用于基于非商业查询来预测用户将来可能提交的一个或多个商业查询。根据与响应于非商业查询的搜索结果的映射，向用户呈现一个或多个商业查询。

3. 发明申请

US20090313286A1 GENERATING TRAINING DATA FROM CLICK LOGS 审中-公开
标题翻译：从点击记录生成培训数据
公开(公告)号：US20090313286A1
公开(公告)日：2009-12-17
申请号：US12140272
申请日：2008-06-17
申请人： Nina Mishra , Rakesh Agrawal , Sreenivas Gollapudi , Alan Halverson , Krishnaram N. G. Kenthapadi , Rina Panigrahy , John C. Shafer , Panayiotis Tsaparas
发明人： Nina Mishra , Rakesh Agrawal , Sreenivas Gollapudi , Alan Halverson , Krishnaram N. G. Kenthapadi , Rina Panigrahy , John C. Shafer , Panayiotis Tsaparas
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F16/9535
摘要： Data from a click log may be used to generate training data for a search engine. The pages clicked as well as the pages skipped by a user may be used to assess the relevance of a page to a query. Labels for training data may be generated based on data from the click log. The labels may pertain to the relevance of a page to a query.
摘要翻译：来自点击日志的数据可用于生成搜索引擎的训练数据。可以使用点击的页面以及用户跳过的页面来评估页面与查询的相关性。可以根据点击日志的数据生成训练数据的标签。标签可能与页面与查询的相关性有关。

4. 发明申请

US20110119269A1 Concept Discovery in Search Logs 审中-公开
标题翻译：搜索日志中的概念发现
公开(公告)号：US20110119269A1
公开(公告)日：2011-05-19
申请号：US12620600
申请日：2009-11-18
申请人： Rakesh Agrawal , Sreenivas Gollapudi , Nina Mishra
发明人： Rakesh Agrawal , Sreenivas Gollapudi , Nina Mishra
IPC分类号： G06F17/30
CPC分类号： G06F16/338 , G06F16/954
摘要： Described is a search (e.g., web search) technology in which concepts are returned in response to a query in addition to (or instead of) search results in the form of traditional links. Each concept generally corresponds to a set of links to content that are more directed towards a possible user intention, or information need, with respect to that query. If a user selects a concept, that concept's links are exposed to facilitate selection of a document the user finds relevant. In this manner, much more than the top ten ranked links may be provided for a query, each set of other links arranged by the concepts. Also described is processing a query log or other data store to optionally find related queries and find the concepts, e.g., by clustering a relationship graph built from the query log to find dense subgraphs representative of the concepts.
摘要翻译：描述了除传统链接形式的（或代替）搜索结果之外还响应于查询返回概念的搜索（例如，网页搜索）技术。每个概念通常对应于一组到内容的链接，其更多地针对相对于该查询的可能的用户意图或信息需求。如果用户选择一个概念，则该概念的链接被暴露以便于选择用户发现相关的文档。以这种方式，可以为查询提供远远超过前十名的链接，每个由概念排列的其他链接集合。还描述了处理查询日志或其他数据存储以可选地查找相关查询并且通过聚类从查询日志生成的关系图来查找概念，以找到代表概念的密集子图。

5. 发明授权

US09176772B2 Suspending and resuming of sessions 有权
标题翻译：暂停和恢复会话
公开(公告)号：US09176772B2
公开(公告)日：2015-11-03
申请号：US11057043
申请日：2005-02-11
申请人： Sanjay Kaluskar , Sreenivas Gollapudi
发明人： Sanjay Kaluskar , Sreenivas Gollapudi
IPC分类号： G06F17/30 , G06F9/48
CPC分类号： G06F9/4856 , G06F17/30289
摘要： A session established for an application is suspended from an instance and later resumed on the server or a different server. When a session is suspended, its state is captured and persistently stored as a session image in a data repository, and the session is terminated. When the session is resumed, a new session is established on an instance, the session image of the session to resume is retrieved from the repository and restored to the newly established session. The suspension and resumption of a session may be initiated by an application, which may request the suspension and resumption of a session.
摘要翻译：为应用程序建立的会话从一个实例中暂停，然后在服务器或不同的服务器上恢复。当会话被暂停时，其状态被捕获并持久存储为数据存储库中的会话映像，并且会话终止。当会话恢复时，在一个实例上建立一个新的会话，从存储库中检索要恢复的会话的会话映像并恢复到新建立的会话。暂停和恢复会议可由申请人启动，申请可能要求暂停和恢复会议。

6. 发明授权

US09158813B2 Relaxation for structured queries 有权
标题翻译：结构化查询放松
公开(公告)号：US09158813B2
公开(公告)日：2015-10-13
申请号：US12796678
申请日：2010-06-09
申请人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
发明人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30861 , G06F17/30864
摘要： A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要翻译：结构化查询可以指定属性的属性值。确定将结构化查询与应用于结构化数据库时匹配的项目数量的估计。如果估计的项目数量低于阈值，则可以放宽结构化查询以形成新的候选结构化查询。可以基于期望的运行时间来确定候选查询的数量。可以通过改变结构化查询的属性的一个或多个属性值来确定每个候选结构化查询。确定每个候选结构化查询将匹配的项目的数量的估计，并且使用具有最高匹配估计的候选结构化查询来查询数据库。可以输出匹配结果。

7. 发明授权

US08099417B2 Semi-supervised part-of-speech tagging 有权
标题翻译：半监督的词性标签
公开(公告)号：US08099417B2
公开(公告)日：2012-01-17
申请号：US11954216
申请日：2007-12-12
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.
摘要翻译：给定查询的相关搜索结果可以使用查询的点击数据和查询发布到搜索引擎的次数来确定。结果为给定查询获得的点击次数可以向搜索引擎提供关于给定查询的结果的相关性的反馈机制。查询的频率以及相关的点击次数为搜索引擎提供了生成相关结果时查询的有效性。可以根据点击数据和提供给用户的搜索结果的效率来加权查询与结果图表中的边。

8. 发明授权

US08090729B2 Large graph measurement 有权
标题翻译：大图测量
公开(公告)号：US08090729B2
公开(公告)日：2012-01-03
申请号：US12396514
申请日：2009-03-03
申请人： Sreenivas Gollapudi
发明人： Sreenivas Gollapudi
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30876 , G06F17/30873
摘要： As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.
摘要翻译：如本文所提供的，可以有效地确定大图中的节点之间的成对距离。通过从相应节点提取标签，提供对节点之间的链接的引用，将标签聚集到各个节点的集合中，并将标签集合存储为URL草图，从而为索引中的相应节点生成URL草图。通过使用URL草图，通过确定节点的邻域并使用与各个相邻节点相关联的标签生成草图来为索引中的相应节点生成邻域草图。通过使用两个节点的邻域草图计算两个节点之间的近似路径数和两个节点之间的近似路径长度来确定两个节点之间的距离。

9. 发明授权

US08086631B2 Search result diversification 有权
标题翻译：搜索结果多样化
公开(公告)号：US08086631B2
公开(公告)日：2011-12-27
申请号：US12334257
申请日：2008-12-12
申请人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
发明人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/30864
摘要： Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.
摘要翻译：用于接收搜索查询，检索文档，计算给定查询呈现的类别数量的方法，装置和系统，计算在每个类别中显示的结果的数量，计算类别的顺序以及针对所有结果页面在第一页之外，使用用户界面元素，其可选地允许用户快速放大特定类别并获得属于该类别的更多结果。

10. 发明申请

US20090157643A1 SEMI-SUPERVISED PART-OF-SPEECH TAGGING 有权
标题翻译：半监督的部分话题标签
公开(公告)号：US20090157643A1
公开(公告)日：2009-06-18
申请号：US11954216
申请日：2007-12-12
申请人： Sreenivas Gollapudi , Rina Panigrahy
发明人： Sreenivas Gollapudi , Rina Panigrahy
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.
摘要翻译：给定查询的相关搜索结果可以使用查询的点击数据和查询发布到搜索引擎的次数来确定。结果为给定查询获得的点击次数可以向搜索引擎提供关于给定查询的结果的相关性的反馈机制。查询的频率以及相关的点击次数为搜索引擎提供了生成相关结果时查询的有效性。可以根据点击数据和提供给用户的搜索结果的效率来加权查询与结果图表中的边。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式