专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2016191626A1 OUTCOME ANALYSIS FOR GRAPH GENERATION 审中-公开
标题翻译：图形生成的成果分析
公开(公告)号：WO2016191626A1
公开(公告)日：2016-12-01
申请号：PCT/US2016/034496
申请日：2016-05-26
申请人： AYASDI, INC.
发明人： KLOKE, Jennifer , SEXTON, Harlan
IPC分类号： G06F3/048 , G06F17/30 , G06T11/20 , G09G5/02
CPC分类号： G06F17/30958
摘要： An example method includes determining a point from a data set closest to a particular data point using a particular metric and scoring a particular data point based on whether the closest point shares a similar characteristic, selecting a subset of metrics based on the metric score to generate a subset of metrics, evaluating a metric-lens combination by calculating a metric-lens score based on entropy of shared characteristics across subspaces of a reference map generated by the metric-lens combination, selecting a metric-lens combination based on the metric-lens score, generating topological representations using the received data set, associating each node with at least one shared characteristic based on member data points of that particular node sharing the shared characteristic, scoring groups within each topological representation based on entropy, scoring topological representation based on the group scores, and providing a visualization of at least one topological representation based on the graph scores.
摘要翻译：一个示例性方法包括使用特定度量从最近于特定数据点的数据集中确定点，并且基于最近点是否共享相似特征来评估特定数据点，基于度量得分选择度量的子集以产生度量的子集，通过基于由度量 - 透镜组合生成的参考图的子空间中的共享特征的熵计算度量透镜分数来评估度量 - 透镜组合，基于公制透镜选择度量 - 透镜组合使用所接收的数据集生成拓扑表示，基于共享共享特征的该特定节点的成员数据点将每个节点与至少一个共享特性相关联，基于熵，基于熵的评分拓扑表示，基于组分，并提供至少一个拓扑表示的可视化 n基于图表得分。

2. 发明申请

WO2015134814A1 SYSTEMS AND METHODS FOR CAPTURE OF RELATIONSHIPS WITHIN INFORMATION 审中-公开
标题翻译：在信息中获取关系的系统和方法
公开(公告)号：WO2015134814A1
公开(公告)日：2015-09-11
申请号：PCT/US2015/019066
申请日：2015-03-05
申请人： AYASDI, INC.
发明人： SEXTON, Harlan , KLOKE, Jennifer
IPC分类号： G06N5/00
CPC分类号： G06F17/30958 , G06F17/30241 , G06F17/30572 , G06F19/00 , G06T11/206 , G16H50/70
摘要： Exemplary systems and methods to improve capture of relationships within information are provided. In various embodiments, a system comprises a landmark module configured to choose a set of landmarks from data in a finite metric space, the set of landmarks being a subset of points in the finite metric space, a nearest neighbor module configured to compute, for each landmark, a predetermined number of nearest neighbor landmarks in the set of landmarks, a graph construction module configured to identify at least one pair of landmarks that are nearest neighbors to each other, an edge generator module configured to add an edge between the at least one pair of landmarks, and a non-landmark projection module configured to project nonlandmark points based on the landmarks and one or more edges thereby enabling at least one shape to indicate relationships in the data.
摘要翻译：提供了用于改善信息内关系捕获的示例性系统和方法。在各种实施例中，系统包括地标模块，其被配置为从有限度量空间中的数据中选择一组地标，所述地标集合是所述有限度量空间中的点的子集，最近邻模块被配置为针对每个地标，所述一组地标中的预定数量的最邻近地标;图形构造模块，被配置为识别彼此最近邻近的至少一对地标;边缘生成器模块，被配置为在所述至少一个一对地标和非地标投影模块，其被配置为基于所述地标和一个或多个边缘来投影非地标点，从而使至少一个形状能够指示所述数据中的关系。

3. 发明申请

WO2019006213A1 SYSTEMS AND METHODS FOR TOPOLOGICAL DATA ANALYSIS USING NEAREST NEIGHBORS 审中-公开
公开(公告)号：WO2019006213A1
公开(公告)日：2019-01-03
申请号：PCT/US2018/040151
申请日：2018-06-28
申请人： AYASDI, INC.
发明人： WARRIER, Ajithkumar , KLOKE, Jennifer , HSU, Ryan , JONNALAGADDA, Sudhakar
IPC分类号： G06F17/30 , G06F3/048 , G06K9/62
CPC分类号： G06F16/287 , G06F16/26 , G06F16/9024 , G06F17/18 , G06K9/6224 , G06K9/6276 , G06N20/00 , G16H50/20 , G16H50/70
摘要： A method comprises receiving a network of a plurality of nodes and a plurality of edges, each of the nodes of the plurality of nodes comprising members representative of at least one subset of initial data points, selecting a subset of the data points based on each node of the plurality of nodes, for each selected data point of the set of selected data points, determining a predetermined number of other data points that are closest in distance to that particular selected data point, grouping the selected data points into a plurality of groups based, at least in part, on the predetermined number of other data points of the set of selected data points that are closest in distance, each group of the plurality of groups including a different subset of data points, and providing a list of selected data points and the plurality of groups.

4. 发明申请

WO2015035401A1 AUTOMATED DISCOVERY USING TEXTUAL ANALYSIS 审中-公开
标题翻译：自动发现使用文本分析
公开(公告)号：WO2015035401A1
公开(公告)日：2015-03-12
申请号：PCT/US2014/054815
申请日：2014-09-09
申请人： AYASDI, INC.
发明人： SEXTON, Harlan , KLOKE, Jennifer
IPC分类号： G06F17/27 , G06F17/30
CPC分类号： G06F17/2765 , G06F17/2211 , G06F17/2229 , G06F17/30713
摘要： An example method includes receiving text from a plurality of documents, segmenting text received text of the plurality of documents, calculating a frequency statistic for each segment of each document, determining segments of potential interest of each document based on calculated frequency statistic, calculating distances between each document of the plurality of documents based on a text metric, and storing segments of potential interest of each document and the distances in a search database. The method may further include receiving a search query and performing a search of information contained in the search database, partitioning documents of search results using the distances, for each partition, determining labels of segments of potential interest for documents of that particular partition, the labels being determined based on a plurality of frequency statistics, and providing determined labels of segments of potential interest for documents of each partition.
摘要翻译：一种示例性方法包括从多个文档接收文本，分割多个文档的文本接收文本，计算每个文档的每个片段的频率统计量，基于计算的频率统计量来确定每个文档的潜在兴趣的段，基于文本度量的多个文档中的每个文档，以及将每个文档的潜在兴趣的段和距离存储在搜索数据库中。该方法还可以包括接收搜索查询并执行搜索包含在搜索数据库中的信息，使用距离分割搜索结果的文档，对于每个分区，确定该特定分区的文档的潜在兴趣段的标签，标签基于多个频率统计确定，并且为每个分区的文档提供确定的潜在兴趣段的标签。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式