会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Supervised ranking of vertices of a directed graph
    • 有向图顶点的受监督排名
    • US07617194B2
    • 2009-11-10
    • US11618380
    • 2006-12-29
    • Tie-Yan LiuTao QinWei-Ying Ma
    • Tie-Yan LiuTao QinWei-Ying Ma
    • G06F17/30
    • G06F17/30864Y10S707/99933
    • A method and system for ranking importance of vertices of a directed graph based on links between the vertices and some prior knowledge of importance of the vertices is provided. A ranking system inputs an indication of the vertices along with an indication of the links between the vertices as the directed graph. The ranking system generates a transition-probability matrix that represents the probability of transitioning from vertex to vertex. The ranking system then generates a ranking of the vertices based on the links between the vertices represented by the stationary distribution of the transition-probability matrix that is minimally perturbed to satisfy the prior knowledge, which may be a partial ranking of the vertices.
    • 提供了一种基于顶点之间的链接和某些顶点的重要性的先前知识来对有向图的顶点的重要性进行排序的方法和系统。 排序系统输入顶点的指示以及顶点之间的链接的指示作为有向图。 排名系统产生一个转移概率矩阵,表示从顶点到顶点的过渡概率。 然后,排名系统基于由最小程度扰动的过渡概率矩阵的固定分布表示的顶点之间的链接来生成顶点的等级,以满足可能是顶点的部分排序的先验知识。
    • 2. 发明授权
    • Topic distillation via subsite retrieval
    • 主题蒸馏通过子网检索
    • US07580931B2
    • 2009-08-25
    • US11375612
    • 2006-03-13
    • Tie-Yan LiuTao QinWei-Ying Ma
    • Tie-Yan LiuTao QinWei-Ying Ma
    • G06F17/30
    • G06F17/30864Y10S707/99935Y10S707/99936
    • A method and system for generating a search result for a query of hierarchically organized documents based on retrieval of subtrees that are key resources for topic distillation is provided. The retrieval system may identify documents relevant to a query using conventional searching techniques. The retrieval system then calculates a subtree feature for subtrees that have an identified document as their root. After the retrieval system calculates the subtree feature for the subtrees, the retrieval system may generate a subtree relevance score for each subtree based on its subtree feature. The retrieval system may then order the identified documents based on their corresponding subtree relevances.
    • 提供了一种用于基于检索作为主题蒸馏的关键资源的子树来生成用于分层组织的文档的查询的搜索结果的方法和系统。 检索系统可以使用传统的搜索技术来识别与查询相关的文档。 检索系统然后计算具有识别的文档作为其根的子树的子树特征。 在检索系统计算子树的子树特征之后,检索系统可以基于其子树特征为每个子树生成子树相关性分数。 然后,检索系统可以基于它们相应的子树相关性来排序所识别的文档。
    • 3. 发明申请
    • TOPIC DISTILLATION VIA SUBSITE RETRIEVAL
    • 通过网站检索进行主题调查
    • US20090282032A1
    • 2009-11-12
    • US12505436
    • 2009-07-17
    • Tie-Yan LiuTao QinWei-Ying Ma
    • Tie-Yan LiuTao QinWei-Ying Ma
    • G06F17/30
    • G06F17/30864Y10S707/99935Y10S707/99936
    • A method and system for generating a search result for a query of hierarchically organized documents based on retrieval of subtrees that are key resources for topic distillation is provided. The retrieval system may identify documents relevant to a query using conventional searching techniques. The retrieval system then calculates a subtree feature for subtrees that have an identified document as their root. After the retrieval system calculates the subtree feature for the subtrees, the retrieval system may generate a subtree relevance score for each subtree based on its subtree feature. The retrieval system may then order the identified documents based on their corresponding subtree relevances.
    • 提供了一种用于基于检索作为主题蒸馏的关键资源的子树来生成用于分层组织的文档的查询的搜索结果的方法和系统。 检索系统可以使用传统的搜索技术来识别与查询相关的文档。 检索系统然后计算具有识别的文档作为其根的子树的子树特征。 在检索系统计算子树的子树特征之后,检索系统可以基于其子树特征为每个子树生成子树相关性分数。 然后,检索系统可以基于它们相应的子树相关性来排序所识别的文档。
    • 4. 发明申请
    • Projecting queries and images into a similarity space
    • 将查询和图像投影到相似性空间中
    • US20070214114A1
    • 2007-09-13
    • US11375528
    • 2006-03-13
    • Tie-Yan LiuTao QinWei-Ying Ma
    • Tie-Yan LiuTao QinWei-Ying Ma
    • G06F17/30
    • G06F17/30265Y10S707/99933
    • A method and system for projecting queries and images into a similarity space where queries are close to their relevant images is provided. A similarity space projection (“SSP”) system learns a query projection function and an image projection function based on training data. The query projection function projects the relevance of the most relevant words of a query into a similarity space and the image projection function projects the relevance to an image of the most relevant words of a query into the same similarity space so that queries and their relevant images are close in the similarity space. The SSP system can then identify images that are relevant to a target query and queries that are relevant to a target image using the projection functions.
    • 提供了一种用于将查询和图像投影到查询接近其相关图像的相似空间中的方法和系统。 相似度空间投影(“SSP”)系统基于训练数据学习查询投影函数和图像投影函数。 查询投影函数将查询中最相关的词的相关性投射到相似度空间中,并且图像投影函数将与查询中最相关的词的图像的相关性投射到相同的相似度空间中,使得查询及其相关图像 在相似性空间中很近。 然后,SSP系统可以使用投影函数来识别与目标查询相关的图像和与目标图像相关的查询。
    • 5. 发明申请
    • Allocating Deals to Visitors in a Group-Buying Service
    • 在集团购买服务中分配交易给访问者
    • US20130226693A1
    • 2013-08-29
    • US13407762
    • 2012-02-29
    • Tao QinTie-Yan LiuWei-Ying Ma
    • Tao QinTie-Yan LiuWei-Ying Ma
    • G06Q10/04G06Q30/02
    • G06Q10/04G06Q30/02
    • Functionality is described herein for allocating group-buying deals in a group-buying service. In certain implementations, the functionality operates by receiving deal information from deal-providing entities (such as merchants). The deal information describes plural deals. The functionality then assigns a number of impressions to each deal so as to maximize revenue provided to an entity which administers the group-buying service. This yields allocation information. The functionality then presents deals to users in accordance with the allocation information. For example, if the allocated number of impressions for a certain deal is x, then the functionality will provide x opportunities for users to select this deal.
    • 本文描述了功能性,用于在集体购买服务中分配组购买交易。 在某些实现中,功能通过从交易提供实体(诸如商家)接收交易信息来进行操作。 交易信息描述多个交易。 然后,功能会为每个交易分配多个展示次数,以便最大限度地提供给管理群购服务的实体的收入。 这产生分配信息。 然后,该功能根据分配信息向用户呈现交易。 例如,如果某个交易的分配的展示次数为x,则功能将为用户提供选择此交易的机会。
    • 6. 发明申请
    • Topic distillation via subsite retrieval
    • 主题蒸馏通过子网检索
    • US20070214116A1
    • 2007-09-13
    • US11375612
    • 2006-03-13
    • Tie-Yan LiuTao QinWei-Ying Ma
    • Tie-Yan LiuTao QinWei-Ying Ma
    • G06F17/30
    • G06F17/30864Y10S707/99935Y10S707/99936
    • A method and system for generating a search result for a query of hierarchically organized documents based on retrieval of subtrees that are key resources for topic distillation is provided. The retrieval system may identify documents relevant to a query using conventional searching techniques. The retrieval system then calculates a subtree feature for subtrees that have an identified document as their root. After the retrieval system calculates the subtree feature for the subtrees, the retrieval system may generate a subtree relevance score for each subtree based on its subtree feature. The retrieval system may then order the identified documents based on their corresponding subtree relevances.
    • 提供了一种用于基于检索作为主题蒸馏的关键资源的子树来生成用于分层组织的文档的查询的搜索结果的方法和系统。 检索系统可以使用传统的搜索技术来识别与查询相关的文档。 检索系统然后计算具有识别的文档作为其根的子树的子树特征。 在检索系统计算子树的子树特征之后,检索系统可以基于其子树特征为每个子树生成子树相关性分数。 然后,检索系统可以基于它们相应的子树相关性来排序所识别的文档。
    • 7. 发明申请
    • Cost-Per-Action Model Based on Advertiser-Reported Actions
    • 基于广告商报告的动作的每次操作费用模型
    • US20130246167A1
    • 2013-09-19
    • US13421626
    • 2012-03-15
    • Tao QinTie-Yan LiuWenkui DingWei-Ying MaHsiao-Wuen Hon
    • Tao QinTie-Yan LiuWenkui DingWei-Ying MaHsiao-Wuen Hon
    • G06Q30/02
    • G06Q30/0256
    • According to a cost-per-action advertising model, advertisers submit ads with cost-per-action bids. Ad auctions are conducted and winning ads are returned with contextually relevant search results. Each time a winning ad is selected by a user, resulting in the user being redirected to a website associated with the advertiser, a selected impression and a price is recorded for the winning ad. Periodically, an advertiser submits a report indicating a number of actions attributed to the ads that have occurred through the advertiser website. The advertiser is then charged a fee for each reported action based on the recorded prices for the winning ads and based on the number of selected impressions recorded for the winning ads.
    • 根据每次操作费用广告模式,广告客户会按照每次操作费用出价提交广告。 进行广告拍卖,并返回具有内容相关搜索结果的获胜广告。 每当用户选择获胜广告时,导致用户被重定向到与广告商相关联的网站,则为获胜广告记录所选择的展示和价格。 定期地,广告客户会提交一份报告,指示通过广告客户网站发生的广告归因的一些操作。 然后,根据获胜广告的记录价格并根据为获胜广告记录的所选曝光次数,为每个报告的动作收取费用。
    • 9. 发明申请
    • LEARNING A DOCUMENT RANKING FUNCTION USING QUERY-LEVEL ERROR MEASUREMENTS
    • 使用查询级错误测量学习文档排名功能
    • US20070233679A1
    • 2007-10-04
    • US11278508
    • 2006-04-03
    • Tie-Yan LiuTao QinWei-Ying Ma
    • Tie-Yan LiuTao QinWei-Ying Ma
    • G06F7/00
    • G06F16/337G06F16/9535
    • A method and system for learning a ranking function that uses a normalized, query-level error function is provided. A ranking system learns a ranking function using training data that includes, for each query, the corresponding documents and, for each document, its relevance to the corresponding query. The ranking system uses an error calculation algorithm that calculates an error between the actual relevances and the calculated relevances for the documents of each query. The ranking system normalizes the errors so that the total errors for each query will be weighted equally. The ranking system then uses the normalized error to learn a ranking function that works well for both queries with many documents in their search results and queries with few documents in their search results.
    • 提供了一种用于学习使用归一化查询级错误函数的排序函数的方法和系统。 排名系统使用培训数据来学习排名功能,训练数据包括每个查询对应的文档,并为每个文档包含与相应查询的相关性。 排名系统使用错误计算算法来计算每个查询的文档的实际相关性和计算的相关性之间的误差。 排序系统对错误进行归一化,使每个查询的总错误平均加权。 排名系统然后使用归一化误差来学习排序函数,对于在其搜索结果中具有许多文档的查询以及在其搜索结果中具有少量文档的查询而言,该排序函数工作良好。