会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • PROFILE RECOMMENDATIONS FOR ADVERTISEMENT CAMPAIGN PERFORMANCE IMPROVEMENT
    • 简介关于广告推广绩效改进的建议
    • US20110035273A1
    • 2011-02-10
    • US12536334
    • 2009-08-05
    • Jignashu ParikhVijay Krishna NarayananRushi P. BhattXia WanRajesh Parekh
    • Jignashu ParikhVijay Krishna NarayananRushi P. BhattXia WanRajesh Parekh
    • G06Q30/00G06Q10/00
    • G06Q30/02G06Q30/0243
    • A method for recommending improvements to advertisement campaign performance includes receiving a seed campaign insertion order (IO) having one or more campaign IO lines; computing a plurality of neighbor ad campaigns based on comparison of the seed campaign IO with a dataset of advertiser ad campaign IO lines; generating campaign IO recommendations by executing an algorithm to recommend profiles to add to the seed campaign IO from booking lines corresponding to the profiles based on performance of such use by the neighbor ad campaigns being generally above average when compared with campaigns that did not use the recommended profiles; filtering the profile recommendations based on a plurality of performance-enhancing criteria of the seed campaign IO and the neighbor ad campaigns with respect to each potential profile recommendation; ranking the profile recommendations based on at least one performance metric; and displaying the ranked profile recommendations to the advertiser for selection.
    • 一种用于推荐改进广告活动性能的方法包括:接收具有一个或多个活动IO线的种子活动插入订单(IO); 基于种子活动IO与广告主广告活动IO行的数据集的比较来计算多个邻居广告活动; 通过执行一种算法,通过执行一种算法来推荐配置文件,以推荐配置文件,以根据与配置文件相对应的预定行添加种子广告系列IO,这些配置文件基于相邻广告系列的使用效果,通常高于平均水平,与未使用推荐的广告系列相比 档案; 基于关于每个潜在简档建议的种子活动IO和邻居广告活动的多个绩效增强标准来过滤简档建议; 根据至少一个绩效指标对简档建议进行排名; 并向广告商显示排名的配置文件推荐以进行选择。
    • 7. 发明授权
    • Discovery of friends using social network graph properties
    • 发现朋友使用社交网络图属性
    • US08744976B2
    • 2014-06-03
    • US12111050
    • 2008-04-28
    • Sunil JagadishJignashu Parikh
    • Sunil JagadishJignashu Parikh
    • G06Q99/00G06F17/30
    • G06Q10/10H04L51/02H04L51/16H04L51/28H04L51/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.
    • 实施例旨在基于对朋友的联系人列表的分析来向用户提供潜在朋友的列表。 用户可以提供联系人列表中的朋友的一部分用于分析,以及执行分析的分离程度和/或用于识别候选朋友的最小阈值数量。 然后可以递归地遍历和合并朋友的联系人列表的子集,其中可以将常见的朋友标识为用于向用户建议朋友的候选集的成员。 在一个实施例中,如果在朋友和候选者之间存在超过最小阈值的共同性,候选成员可以被保留在候选集中。 候选列表也可以是使用各种方法的排序顺序,包括部分基于候选者之间的通信数量的加权能量扩散模型。
    • 8. 发明申请
    • CUSTOMIZABLE ORDERING OF SEARCH RESULTS AND PREDICTIVE QUERY GENERATION
    • 搜索结果的可定制订单和预测查询生成
    • US20110145225A1
    • 2011-06-16
    • US13034982
    • 2011-02-25
    • Jignashu ParikhJ.P. HarishShyam Kapur
    • Jignashu ParikhJ.P. HarishShyam Kapur
    • G06F17/30
    • 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.
    • 在计算机化搜索系统中,根据查询搜索文档语料库,并且搜索结果作为包括一个或多个搜索匹配的有序搜索结果集可以呈现,搜索命中是文档语料库的文档或其引用。 基于搜索结果集的内容,将许多建议的查询和/或参数选项呈现给查询器,从而允许查询器选择建议的查询和/或提供参数的值,并且这些选择可以用于重新排序 搜索结果集的命中。 所提出的特定建议的查询和/或参数取决于搜索结果集的文档的页面元素及其分类。 分类可以使用概念网络完成。
    • 9. 发明授权
    • Automatic categorization of network events
    • 自动分类网络事件
    • US07814109B2
    • 2010-10-12
    • US11394342
    • 2006-03-29
    • Chad BrowerShyam KapurBrian CoppolaJoshua M. KoranJignashu Parikh
    • Chad BrowerShyam KapurBrian CoppolaJoshua M. KoranJignashu Parikh
    • G06F17/30
    • 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.
    • 一种促进网络中事件的自动分类的系统和方法,其中从关键字数据库检索一个或多个关键字,每个检索到的关键字匹配用户通过网络输入的事件的相应事件单元。 然后选择对应于针对每个检索到的关键字计算的最高参数值的主要关键字。 最后,事件根据与主要关键字相关联的一个或多个类别进行分类。 可以基于与每个检索到的关键字相关联的一个或多个关键字类别和为每个关键字计算的模糊度参数值来选择主要关键字。 或者,可以基于针对每个检索到的关键字计算的排名最高的输出值来选择主要关键字。 随后从关键字数据库中检索与该主要关键词相关联的一个或多个类别,并且基于与主要关键字相关联的类别对事件进行分类。