Methods and apparatus for matching relevant content to user intention

    公开(公告)号:US10733250B2

    公开(公告)日:2020-08-04

    申请号:US15810773

    申请日:2017-11-13

    申请人: NETSEER, INC.

    发明人: Behnam A. Rezaei

    摘要: Methods and apparatus for a new approach to the problem of matching relevant content to user queries. Instead of looking for the exact keyword, the invention expands it into groupings of concepts and phrases, where each such group represents one possible user intention (as implied by the query phrase or keyword). Each such grouping is analyzed to provide relevant content, including but not limited to, unstructured data like world wide web, categorized data and paid listings. The provided method can better capture user intentions even for cases where there is no click-through information.

    Methods and apparatus for distributed community finding
    2.
    发明授权
    Methods and apparatus for distributed community finding 有权
    分布式社区发现的方法和设备

    公开(公告)号:US08301617B2

    公开(公告)日:2012-10-30

    申请号:US13098870

    申请日:2011-05-02

    IPC分类号: G06F17/30

    摘要: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

    摘要翻译: 披露了一种新的方法和方法,用于在与社区和渗透的社会定义相关的复杂网络中寻找社区的问题。 不必将图形从上到下分割为单独的子图,本地算法(每个顶点的社区)允许社区重叠。 使用合成,随机生成的图形和现实世界网络的算法的性能来对其他方法进行基准测试。 提供了一种启发式方法,用于使用本地社区查找算法生成网络社区列表。 与基于扩散的算法不同,所提供的算法找到重叠的社区,并提供了一种衡量社区结构信心的方法。 它具有局部性和低复杂性,用于探索网络节点子集的社区,而无需探索整个图形。

    IDENTIFYING RELATED CONCEPTS OF URLS AND DOMAIN NAMES
    3.
    发明申请
    IDENTIFYING RELATED CONCEPTS OF URLS AND DOMAIN NAMES 有权
    识别URL和域名的相关概念

    公开(公告)号:US20100114879A1

    公开(公告)日:2010-05-06

    申请号:US12610202

    申请日:2009-10-30

    IPC分类号: G06F17/30

    CPC分类号: G06F17/278

    摘要: A solution for identifying related concepts of URLs and domain names includes using structural parsing to extract information from user input comprising a URL or domain name. The information includes one or more of a protocol, a location, and a subdirectory. Semantic parsing of the information is used to identify a first one or more concepts represented by one or more tokens within the extracted information. A content association map is queried to retrieve a second one or more concepts related to the first one or more concepts. Each of the concepts represents a unit of thought, expressed by a term, letter, or symbol. The concept association map includes a representation of concepts, concept metadata, and relationships between the concepts. The first one or more concepts and the second one or more concepts are ranked, and the ranked concepts are stored for displaying to one or more users of the computer platform.

    摘要翻译: 用于识别URL和域名的相关概念的解决方案包括使用结构解析来从包括URL或域名的用户输入中提取信息。 信息包括协议,位置和子目录中的一个或多个。 信息的语义解析用于识别在所提取的信息内由一个或多个令牌表示的第一个或多个概念。 查询内容关联图以检索与第一个或多个概念相关的第二个或多个概念。 每个概念都代表一个思想单元,用一个术语,一个字母或符号表示。 概念关联图包括概念,概念元数据和概念之间的关系的表示。 第一个一个或多个概念和第二个一个或多个概念被排序,并且排列的概念被存储以显示给计算机平台的一个或多个用户。

    METHODS AND APPARATUS FOR DISTRIBUTED COMMUNITY FINDING

    公开(公告)号:US20130046842A1

    公开(公告)日:2013-02-21

    申请号:US13660955

    申请日:2012-10-25

    申请人: Netseer, Inc.

    IPC分类号: G06F15/16

    摘要: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

    System and method for context-based knowledge search, tagging, collaboration, management, and advertisement
    6.
    发明授权
    System and method for context-based knowledge search, tagging, collaboration, management, and advertisement 有权
    用于基于上下文的知识搜索,标记,协作,管理和广告的系统和方法

    公开(公告)号:US08380721B2

    公开(公告)日:2013-02-19

    申请号:US11624674

    申请日:2007-01-18

    IPC分类号: G06F17/00

    摘要: Comprehensive methods and systems are described for creating, managing, searching, personalizing, and monetizing a knowledge system defined over a corpus of digital content. Systems and methods are described in which a user can initiate in-depth searches of subject matter and can browse, navigate, pinpoint, and select relevant contexts, concepts, and documents to gain knowledge. Systems and methods are described in which knowledge can be personalized through tagged, personalized context, and personalized context can be shared within social and professional networks, securely and confidentially and with the desired access control. Systems and methods are described in which products and services can be advertised in context and advertising can be selected through a bidding process. Systems and methods are described by which a user can navigate contexts and concepts to obtain relevant information, products and services.

    摘要翻译: 描述了用于创建,管理,搜索,个性化和通过数字内容语料库定义的知识系统获利的综合方法和系统。 描述了系统和方法,其中用户可以发起对主题的深入搜索,并且可以浏览,导航,精确定位和选择相关的上下文,概念和文档以获得知识。 描述了系统和方法,其中知识可以通过标记的个性化上下文进行个性化,并且个性化环境可以在社会和专业网络内被安全地和保密地共享并且具有期望的访问控制。 描述了可以在上下文中宣传产品和服务的系统和方法,并且可以通过投标过程来选择广告。 描述系统和方法,用户可以通过该系统和方法来导航上下文和概念以获得相关信息,产品和服务。

    Behavioral Targeting For Tracking, Aggregating, And Predicting Online Behavior
    7.
    发明申请
    Behavioral Targeting For Tracking, Aggregating, And Predicting Online Behavior 审中-公开
    用于跟踪,聚合和预测在线行为的行为目标

    公开(公告)号:US20090300009A1

    公开(公告)日:2009-12-03

    申请号:US12476205

    申请日:2009-06-01

    IPC分类号: G06F17/30

    摘要: A pre-computed concept map represents concepts, concept metadata, and relationships between the plurality of concepts. Online user behavior may be predicted by correlating one or more online events of a user with one or more features of the concept map, aggregating a concept map history of the user to obtain online behavior over time, aggregating online behavior of the user and one or more other users to obtain aggregated online user behavior, and predicting future online behavior of the user based at least in part on the online behavior of the user and the aggregated online user behavior. The predicted behavior may be used to target ads that the user is likely to find relevant.

    摘要翻译: 预先计算的概念图表示概念,概念元数据以及多个概念之间的关系。 可以通过将用户的一个或多个在线事件与概念图的一个或多个特征相关联来预测在线用户行为,聚合用户的概念图历史以获得随时间的在线行为,聚合用户的在线行为以及一个或多个 更多其他用户获得聚合的在线用户行为,并至少部分地基于用户的在线行为和聚合的在线用户行为来预测用户的未来在线行为。 预测的行为可能用于定位用户可能会找到相关的广告。