公开(公告)号：US07822752B2

公开(公告)日：2010-10-26

申请号：US11804627

申请日：2007-05-18

申请人： Chenxi Lin ,  Lei Ji ,  Huajun Zeng ,  Benyu Zhang ,  Zheng Chen ,  Jian Wang

发明人： Chenxi Lin ,  Lei Ji ,  Huajun Zeng ,  Benyu Zhang ,  Zheng Chen ,  Jian Wang

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30675

摘要： Described is an efficient retrieval mechanism that quickly locates documents (e.g., corresponding to online advertisements) based on query term discrimination. A topmost subset (e.g., two) of search terms is selected according to their ranked importance, e.g., as ranked by inverted document frequency. The topmost terms are then used to narrow the number of rows of an inverted query index that are searched to find document identifiers and associated scores, such as computed offline by a BM25 algorithm. For example, for each document identifier of each important term, a fast search within each of the narrowed subset of rows (that also contain that document identifier) may be performed by comparing document identifiers to jump a pointer within each other row, followed by a binary search to locate a particular document. The scores of the set of particular documents may then be used to rank their relative importance for returning as results.

摘要翻译： 描述了一种有效的检索机制，其基于查询词辨别快速定位文档（例如，对应于在线广告）。 根据其排序的重要性来选择搜索项的最顶层子集（例如，两个），例如按照倒排的文档频率排序。 然后使用最上面的术语来缩小被搜索以查找文档标识符和相关分数的反向查询索引的行数，例如通过BM25算法离线计算。 例如，对于每个重要术语的每个文档标识符，可以通过比较文档标识符来跳过每个其他行中的指针，然后是一个指针，来执行每个狭窄的行子集（也包含该文档标识符）的快速搜索 二进制搜索查找特定文档。 然后可以使用该组特定文件的分数来排列其作为结果返回的相对重要性。

公开(公告)号：US20080288483A1

公开(公告)日：2008-11-20

申请号：US11804627

申请日：2007-05-18

申请人： Chenxi Lin ,  Lei Ji ,  Huajun Zeng ,  Benyu Zhang ,  Zheng Chen ,  Jian Wang

发明人： Chenxi Lin ,  Lei Ji ,  Huajun Zeng ,  Benyu Zhang ,  Zheng Chen ,  Jian Wang

IPC分类号： G06F17/30

CPC分类号： G06F17/30675

摘要： Described is an efficient retrieval mechanism that quickly locates documents (e.g., corresponding to online advertisements) based on query term discrimination. A topmost subset (e.g., two) of search terms is selected according to their ranked importance, e.g., as ranked by inverted document frequency. The topmost terms are then used to narrow the number of rows of an inverted query index that are searched to find document identifiers and associated scores, such as computed offline by a BM25 algorithm. For example, for each document identifier of each important term, a fast search within each of the narrowed subset of rows (that also contain that document identifier) may be performed by comparing document identifiers to jump a pointer within each other row, followed by a binary search to locate a particular document. The scores of the set of particular documents may then be used to rank their relative importance for returning as results.

摘要翻译： 描述了一种有效的检索机制，其基于查询词辨别快速定位文档（例如，对应于在线广告）。 根据其排序的重要性来选择搜索项的最顶层子集（例如，两个），例如按照倒排的文档频率排序。 然后使用最上面的术语来缩小被搜索以查找文档标识符和相关分数的反向查询索引的行数，例如通过BM25算法离线计算。 例如，对于每个重要术语的每个文档标识符，可以通过比较文档标识符来跳过每个其他行中的指针，然后是一个指针，来执行每个狭窄的行子集（也包含该文档标识符）的快速搜索 二进制搜索查找特定文档。 然后可以使用该组特定文件的分数来排列其作为结果返回的相对重要性。

公开(公告)号：US20080281834A1

公开(公告)日：2008-11-13

申请号：US11801404

申请日：2007-05-09

申请人： Min Wu ,  Chenxi Lin ,  Benyu Zhang ,  Huajun Zeng ,  Zheng Chen ,  Jian Wang

发明人： Min Wu ,  Chenxi Lin ,  Benyu Zhang ,  Huajun Zeng ,  Zheng Chen ,  Jian Wang

IPC分类号： G06F17/30

CPC分类号： G06F17/30861

摘要： Described is a technology by which blocks of web pages may be selected, such as for building a user-personalized web page containing selected blocks. A selection mechanism, such as a browser toolbar add-on, provides a user interface for selecting blocks, and records information about selected blocks. A block tracking mechanism (e.g., a daemon program) uses the information to locate selected blocks of the web pages, including when the web page containing the block is updated with respect to content and/or layout. The block tracking mechanism may update a local gadget that when invoked, such as by browsing to a particular web page, which shows updated versions of the block on a personalized web page. Blocks may be efficiently located by processing trees representing web pages into reduced trees, and then by performing a minimum distance mapping algorithm on the reduced trees.

摘要翻译： 描述了可以选择网页块的技术，诸如用于构建包含所选块的用户个性化网页。 诸如浏览器工具栏附件的选择机制提供用于选择块的用户界面，并且记录关于所选块的信息。 块跟踪机制（例如，守护程序）使用该信息来定位网页的所选块，包括当包含块的网页相对于内容和/或布局被更新时。 块跟踪机制可以更新当调用时​​的本地小工具，诸如通过浏览到特定网页，其显示个性化网页上块的更新版本。 可以通过将表示网页的树处理成缩小的树，然后通过在缩小的树上执行最小距离映射算法来有效地定位块。

公开(公告)号：US07818330B2

公开(公告)日：2010-10-19

申请号：US11801404

申请日：2007-05-09

申请人： Min Wu ,  Chenxi Lin ,  Benyu Zhang ,  Huajun Zeng ,  Zheng Chen ,  Jian Wang

发明人： Min Wu ,  Chenxi Lin ,  Benyu Zhang ,  Huajun Zeng ,  Zheng Chen ,  Jian Wang

IPC分类号： G06F7/00

CPC分类号： G06F17/30861

摘要： Described is a technology by which blocks of web pages may be selected, such as for building a user-personalized web page containing selected blocks. A selection mechanism, such as a browser toolbar add-on, provides a user interface for selecting blocks, and records information about selected blocks. A block tracking mechanism (e.g., a daemon program) uses the information to locate selected blocks of the web pages, including when the web page containing the block is updated with respect to content and/or layout. The block tracking mechanism may update a local gadget that when invoked, such as by browsing to a particular web page, which shows updated versions of the block on a personalized web page. Blocks may be efficiently located by processing trees representing web pages into reduced trees, and then by performing a minimum distance mapping algorithm on the reduced trees.

摘要翻译： 描述了可以选择网页块的技术，诸如用于构建包含所选块的用户个性化网页。 诸如浏览器工具栏附件的选择机制提供用于选择块的用户界面，并且记录关于所选块的信息。 块跟踪机制（例如，守护程序）使用该信息来定位网页的所选块，包括当包含块的网页相对于内容和/或布局被更新时。 块跟踪机制可以更新当调用时​​的本地小工具，诸如通过浏览到特定网页，其显示个性化网页上块的更新版本。 可以通过将表示网页的树处理成缩小的树，然后通过在缩小的树上执行最小距离映射算法来有效地定位块。

公开(公告)号：US20080288348A1

公开(公告)日：2008-11-20

申请号：US11803461

申请日：2007-05-15

申请人： Huajun Zeng ,  Chenxi Lin ,  Dingyi Han ,  Benyu Zhang ,  Zheng Chen ,  Jian Wang

发明人： Huajun Zeng ,  Chenxi Lin ,  Dingyi Han ,  Benyu Zhang ,  Zheng Chen ,  Jian Wang

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0254 ,  G06Q30/0256 ,  G06Q30/0263 ,  G06Q30/0277

摘要： A method for ranking online advertisements using retailer reputation and product reputation. In one implementation, a query may be received. Advertisements may be selected by determining a level of relevance between the query and each advertisement and selecting the advertisements with a level of relevance above a pre-determined level of relevance. A predicted reputation for a retailer and a predicted reputation for a product may be retrieved for each of the selected advertisements. The selected advertisements may then be ranked based on the predicted reputation for the retailer and the predicted reputation of the product. The ranking of the selected advertisements may be accomplished by calculating a ranking score for each selected advertisement based on the retailer predicted reputation and the product predicted reputation. The selected advertisements may then be displayed according to the ranking.

摘要翻译： 使用零售商信誉和产品信誉对在线广告进行排名的方法。 在一个实现中，可以接收查询。 可以通过确定查询和每个广告之间的相关性级别并且选择具有相关性水平高于预定相关性水平的广告来选择广告。 可以为每个选定的广告检索零售商的预测声誉和产品的预测声誉。 所选择的广告然后可以基于零售商的预测信誉和产品的预测声誉进行排名。 所选择的广告的排名可以通过基于零售商预测的声誉和产品预测的声誉来计算每个所选广告的排名得分来实现。 然后可以根据排名显示所选择的广告。

公开(公告)号：US20080288481A1

公开(公告)日：2008-11-20

申请号：US11803462

申请日：2007-05-15

申请人： Huajun Zeng ,  Chenxi Lin ,  Dingyi Han ,  Benyu Zhang ,  Zheng Chen ,  Jian Wang

发明人： Huajun Zeng ,  Chenxi Lin ,  Dingyi Han ,  Benyu Zhang ,  Zheng Chen ,  Jian Wang

IPC分类号： G06F17/30

CPC分类号： G06Q30/02

摘要： Described is a technology by which online advertisements for returning with a query response are ranked according to reputation. The reputation may correspond to a product or service and/or seller reputation. In one example, a set of relevant advertisement items are located and ranked using reputation data as a factor. For example, for each item, a ranking value is based on a mathematical combination of a product reputation score, a seller reputation score and a relevance score, with the items ranked by their computed values. The scores may be weighted differently. The reputation data may be mined from a review source, such as customer reviews available on the web. In one example implementation, a 3-gram model that considers terms in the review along with the two terms proceeding each term is used to analyze the reviews to determine whether each review is positive or negative with respect to the reputation.

摘要翻译： 描述了一种技术，通过这种技术，根据信誉对用于返回查询响应的在线广告进行排名。 声誉可能对应于产品或服务和/或卖方声誉。 在一个示例中，使用信誉数据作为因素来定位和排列一组相关广告项目。 例如，对于每个项目，排序值基于产品信誉评分，卖方信誉评分和相关性分数的数学组合，其中项目按其计算值排列。 得分的加权方式可能不同。 信誉数据可以从审查来源开采，例如网络上可用的客户评价。 在一个示例实施中，使用考虑审查中的术语的3克模型以及每个术语进行的两个术语进行分析，以确定每个评论对于声誉是否为正或负。

公开(公告)号：US20080208841A1

公开(公告)日：2008-08-28

申请号：US11870359

申请日：2007-10-10

申请人： Huajun Zeng ,  Jian Hu ,  Hua Li ,  Zheng Chen ,  Jian Wang

发明人： Huajun Zeng ,  Jian Hu ,  Hua Li ,  Zheng Chen ,  Jian Wang

IPC分类号： G06F17/30

CPC分类号： G06F17/30648 ,  G06F17/30672 ,  G06F17/30864

摘要： Click-through log mining is described. Raw search click-through log data is processed to generate ordered query keywords, utilizing an algorithm to expand user-submitted keywords to include high frequency user queries, managing the keywords for a keyword expansion file, analyzing the algorithm performance on a bidding criteria, and identifying related phrases with similar page-click behaviors for advertisements.

摘要翻译： 描述了点击式日志挖掘。 处理原始搜索点击后日志数据以生成有序查询关键字，利用算法来扩展用户提交的关键字以包括高频用户查询，管理关键字扩展文件的关键字，以出价标准分析算法性能;以及 识别与广告相似的页面点击行为的相关短语。