-
公开(公告)号：US10387892B2
公开(公告)日：2019-08-20
申请号：US12436748
申请日：2009-05-06
摘要： Discovering relevant concepts and context for content nodes to determine a user's intent includes identifying one or more concept candidates in a content node based at least in part on one or more statistical measures, and matching concepts in a concept association map against text in the content node. The concept association map represents concepts, concept metadata, and relationships between the concepts. The one or more concept candidates are ranked to create a ranked one or more concept candidates based at least in part on a measure of relevance. The ranked one or more concept candidates is expanded according to one or more cost functions. The expanded set of concepts is stored in association with the content node.
-
22.发明授权Systems and methods for creating, navigating, and searching informational web neighborhoods 有权用于创建，导航和搜索信息网络社区的系统和方法公开(公告)号：US09443018B2
公开(公告)日：2016-09-13
申请号：US14457693
申请日：2014-08-12
申请人： NetSeer, Inc.
CPC分类号： G06F17/30864 , G06F17/30589 , G06F17/3089 , G06F17/30958 , G06F17/30985 , G06N7/00
摘要： Systems and methods for the creation of hierarchical networks of overlapping informational web neighborhoods using percolation crawling. Each neighborhood comprises a set of closely linked pages that share a common set of concepts and intent and purpose. The neighborhoods represent web pages that share a common set of underlying concepts and semantic associations. Each such neighborhood can be semantically tagged.
摘要翻译： 使用渗透爬行创建重叠信息网络邻域的分层网络的系统和方法。 每个社区包括一组紧密联系的页面，共享一组共同的概念和意图和目的。 邻域表示共享一组基本概念和语义关联的网页。 每个这样的邻域可以被语义地标记。
-
公开(公告)号：US08825654B2
公开(公告)日：2014-09-02
申请号：US13660955
申请日：2012-10-25
申请人： Netseer, Inc.
CPC分类号： G06Q10/00 , Y10S707/93 , Y10S707/937 , Y10S707/959
摘要： 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.
-
公开(公告)号：US20090281900A1
公开(公告)日：2009-11-12
申请号：US12436748
申请日：2009-05-06
CPC分类号： G06Q30/02 , G06Q10/10 , G06Q30/0257
摘要： Discovering relevant concepts and context for content nodes to determine a user's intent includes identifying one or more concept candidates in a content node based at least in part on one or more statistical measures, and matching concepts in a concept association map against text in the content node. The concept association map represents concepts, concept metadata, and relationships between the concepts. The one or more concept candidates are ranked to create a ranked one or more concept candidates based at least in part on a measure of relevance. The ranked one or more concept candidates is expanded according to one or more cost functions. The expanded set of concepts is stored in association with the content node.
摘要翻译： 发现用于内容节点的相关概念和上下文以确定用户的意图包括至少部分地基于一个或多个统计度量来标识内容节点中的一个或多个概念候选，以及将概念关联映射中的概念与内容节点中的文本进行匹配 。 概念关联图表示概念，概念元数据以及概念之间的关系。 一个或多个概念候选者被排名以至少部分地基于相关性的度量来创建排名一个或多个概念候选。 根据一个或多个成本函数扩展排名的一个或多个概念候选者。 扩展的概念集合与内容节点相关联地存储。
-
25.发明申请公开(公告)号：US20080301033A1
公开(公告)日：2008-12-04
申请号：US12130171
申请日：2008-05-30
IPC分类号： G06Q30/00
摘要： A method and apparatus for optimizing long-term revenues in online auctions of distinguishable units of an item. For example, the item might be a specific keyword in sponsored search where the distinguishable units could be different slots for putting ads. The system can estimate parameters such as relevance and value by using a notion of fairness and can optimize the revenue by effecting the users' incentives and by improving the bidding language. In general, the method and the system can also be used for equivalent offline auctions.
摘要翻译： 一种用于优化项目可区分单元的在线拍卖的长期收入的方法和装置。 例如，该项目可能是赞助搜索中的特定关键字，其中可区分单元可能是放置广告的不同插槽。 系统可以通过使用公平性概念来估计相关性和价值等参数，并可以通过实现用户的激励措施来优化收益，并通过提高投标语言。 通常，该方法和系统也可用于等效的离线拍卖。
-
-
-
-
搜索结果
25 条记录 (耗时 0.021 秒)
