公开(公告)号：US07836044B2

公开(公告)日：2010-11-16

申请号：US10875143

申请日：2004-06-22

申请人： Sepandar D. Kamvar ,  Taher H. Haveliwala ,  Glen M. Jeh

发明人： Sepandar D. Kamvar ,  Taher H. Haveliwala ,  Glen M. Jeh

IPC分类号： G06F7/00

CPC分类号： G06F17/30646 ,  G06F17/3064

摘要： A search system monitors the input of a search query by a user. Before the user finishes entering the search query, the search system identifies and sends a portion of the query as a partial query to the search engine. Based on the partial query, the search engine creates a set of predicted queries. This process may take into account prior queries submitted by a community of users, and may take into account a user profile. The predicted queries are be sent back to the user for possible selection. The search system may also cache search results corresponding to one or more of the predicted queries in anticipation of the user selecting one of the predicted queries. The search engine may also return at least a portion of the search results corresponding to one or more of the predicted queries.

摘要翻译： 搜索系统监视用户对搜索查询的输入。 在用户完成输入搜索查询之前，搜索系统将查询的一部分作为部分查询识别并发送到搜索引擎。 基于部分查询，搜索引擎创建一组预测查询。 此过程可能会考虑用户社区提交的先前查询，并可能会考虑用户个人资料。 预测的查询将被发送回用户以进行可能的选择。 搜索系统还可以缓存对应于一个或多个预测查询的搜索结果，预期用户选择预测查询之一。 搜索引擎还可以返回对应于一个或多个预测查询的搜索结果的至少一部分。

公开(公告)号：US20090282081A1

公开(公告)日：2009-11-12

申请号：US12410381

申请日：2009-03-24

申请人： Sepandar D. Kamvar ,  Taher H. Haveliwala ,  Glen M. Jeh

发明人： Sepandar D. Kamvar ,  Taher H. Haveliwala ,  Glen M. Jeh

IPC分类号： G06F17/30

CPC分类号： G06F17/30864 ,  G06F17/30613 ,  G06F17/30887 ,  Y10S707/99936 ,  Y10S707/99945 ,  Y10S707/99948

摘要： Methods for facilitating the identification of link spamming in a linked database include calculating a spam likelihood value for nodes in a directed graph of linked nodes are disclosed. The spam likelihood value is computed from an importance of the node and a derivative value of the importance function with respect to a coupling factor. The likelihood that the node's importance is inflated by link spam is estimated by calculating the ratio of the magnitude of the derivative value for the node to the rank for the node. Alternatively, the spam likelihood may be computed directly from a component of the principal eigenvector of A evaluated at two values of the parameter c. The normalized derivative value can also be used to provide an order of importance in a list of nodes.

摘要翻译： 用于促进链接数据库中的链接垃圾邮件识别的方法包括计算链接节点的有向图中的节点的垃圾邮件似然值。 垃圾邮件似然值根据节点的重要性和重要性函数相对于耦合因子的导数值计算。 通过计算节点的导数值的大小与节点的等级之间的比率来估计节点的重要性由链接垃圾邮件充值的可能性。 或者，可以直接从参数c的两个值处评估的A的主要特征向量的分量来计算垃圾邮件似然性。 归一化导数值也可以用于在节点列表中提供重要性的顺序。