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

1. 发明申请

US20130151536A1 Vertex-Proximity Query Processing 有权
标题翻译：顶点近似查询处理
公开(公告)号：US20130151536A1
公开(公告)日：2013-06-13
申请号：US13315415
申请日：2011-12-09
申请人： Leman Akoglu , Rohit M. Khandekar , Vibhore Kumar , Srinivasan Parthasarathy , Deepak Rajan , Kun-Lung Wu
发明人： Leman Akoglu , Rohit M. Khandekar , Vibhore Kumar , Srinivasan Parthasarathy , Deepak Rajan , Kun-Lung Wu
IPC分类号： G06F17/30
CPC分类号： G06F17/30327
摘要： A method, an apparatus and an article of manufacture for processing a random-walk based vertex-proximity query on a graph. The method includes computing at least one vertex cluster and corresponding meta-information from a graph, dynamically updating the clustering and corresponding meta-information upon modification of the graph, and identifying a vertex cluster relevant to at least one query vertex and aggregating corresponding meta-information of the cluster to process the query.
摘要翻译：一种用于在图上处理随机走路的顶点 - 邻近度查询的方法，装置和制品。该方法包括：从图中计算至少一个顶点簇和对应的元信息，在修改图形时动态地更新聚类和对应的元信息，以及识别与至少一个查询顶点相关的顶点簇，集群的信息来处理查询。

2. 发明授权

US08903824B2 Vertex-proximity query processing 有权
标题翻译：顶点邻近查询处理
公开(公告)号：US08903824B2
公开(公告)日：2014-12-02
申请号：US13315415
申请日：2011-12-09
申请人： Leman Akoglu , Rohit M. Khandekar , Vibhore Kumar , Srinivasan Parthasarathy , Deepak Rajan , Kun-Lung Wu
发明人： Leman Akoglu , Rohit M. Khandekar , Vibhore Kumar , Srinivasan Parthasarathy , Deepak Rajan , Kun-Lung Wu
IPC分类号： G06F17/30
CPC分类号： G06F17/30327
摘要： A method, an apparatus and an article of manufacture for processing a random-walk based vertex-proximity query on a graph. The method includes computing at least one vertex cluster and corresponding meta-information from a graph, dynamically updating the clustering and corresponding meta-information upon modification of the graph, and identifying a vertex cluster relevant to at least one query vertex and aggregating corresponding meta-information of the cluster to process the query.
摘要翻译：一种用于在图上处理随机走路的顶点 - 邻近度查询的方法，装置和制品。该方法包括：从图中计算至少一个顶点簇和对应的元信息，在修改图形时动态地更新聚类和对应的元信息，以及识别与至少一个查询顶点相关的顶点簇，集群的信息来处理查询。

3. 发明申请

US20140074838A1 ANOMALY, ASSOCIATION AND CLUSTERING DETECTION 有权
标题翻译：异常，协会和集群检测
公开(公告)号：US20140074838A1
公开(公告)日：2014-03-13
申请号：US13524773
申请日：2012-06-15
申请人： Leman Akoglu , Hanghang Tong
发明人： Leman Akoglu , Hanghang Tong
IPC分类号： G06F17/30
CPC分类号： G06F17/30598 , G06F17/30303 , G06F17/30371 , G06F17/30501 , G06F17/30569 , G06F21/564 , G06F21/566 , G06F2221/2101 , G06F2221/2117 , H04L63/1425
摘要： Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.
摘要翻译：提供了异常，关联和聚类检测的技术。为一组数据中的每个属性构建至少一个代码表。选择与第一属性对应的第一代码表和对应于第二属性的第二代码表。第一代码表和第二代码表被合并到合并代码表中，并且确定接受或拒绝合并的代码表。当数据点的总压缩成本大于从一个或多个代码表推断出的阈值压缩成本时，检测到异常。通过合并属性组，分割数据组以及将数据点分配给数据组来检测数据表中的关联。从一个或多个代码表中的每一个的数据矩阵和代码字推断出一个集群。

4. 发明授权

US09171158B2 Dynamic anomaly, association and clustering detection 有权
标题翻译：动态异常，关联和聚类检测
公开(公告)号：US09171158B2
公开(公告)日：2015-10-27
申请号：US13524729
申请日：2012-06-15
申请人： Leman Akoglu , Hanghang Tong
发明人： Leman Akoglu , Hanghang Tong
IPC分类号： G06F15/18 , G06F21/56 , G06F17/30 , H04L29/06
CPC分类号： G06F17/30598 , G06F17/30303 , G06F17/30371 , G06F17/30501 , G06F17/30569 , G06F21/564 , G06F21/566 , G06F2221/2101 , G06F2221/2117 , H04L63/1425
摘要： Techniques are provided for dynamic anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data containing one or more attributes. One or more clusters associated with one or more of the code tables are established. One or more new data points are received. A determination is made if a given one of the new data points is an anomaly. At least one of the one or more code tables is updated responsive to the determination. When a compression cost of a given one of the new data points is greater than a threshold compression cost for each of the one or more clusters, the given one of the new data points is an anomaly.
摘要翻译：为动态异常，关联和聚类检测提供了技术。在包含一个或多个属性的一组数据中为每个属性构建至少一个代码表。建立与一个或多个代码表相关联的一个或多个集群。接收一个或多个新的数据点。如果给定的一个新数据点是异常，则确定。所述一个或多个代码表中的至少一个响应于所述确定被更新。当给定的一个新数据点的压缩成本大于一个或多个集群中的每一个的阈值压缩成本时，给定的新数据点之一是异常的。

5. 发明申请

US20140074796A1 DYNAMIC ANOMALY, ASSOCIATION AND CLUSTERING DETECTION 有权
标题翻译：动态异常，协会和集群检测
公开(公告)号：US20140074796A1
公开(公告)日：2014-03-13
申请号：US13524729
申请日：2012-06-15
申请人： Leman Akoglu , Hanghang Tong
发明人： Leman Akoglu , Hanghang Tong
IPC分类号： G06F21/56 , G06F17/30
CPC分类号： G06F17/30598 , G06F17/30303 , G06F17/30371 , G06F17/30501 , G06F17/30569 , G06F21/564 , G06F21/566 , G06F2221/2101 , G06F2221/2117 , H04L63/1425
摘要： Techniques are provided for dynamic anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data containing one or more attributes. One or more clusters associated with one or more of the code tables are established. One or more new data points are received. A determination is made if a given one of the new data points is an anomaly. At least one of the one or more code tables is updated responsive to the determination. When a compression cost of a given one of the new data points is greater than a threshold compression cost for each of the one or more clusters, the given one of the new data points is an anomaly.
摘要翻译：为动态异常，关联和聚类检测提供了技术。在包含一个或多个属性的一组数据中为每个属性构建至少一个代码表。建立与一个或多个代码表相关联的一个或多个集群。接收一个或多个新的数据点。如果给定的一个新数据点是异常，则确定。所述一个或多个代码表中的至少一个响应于所述确定被更新。当给定的一个新数据点的压缩成本大于一个或多个集群中的每一个的阈值压缩成本时，给定的新数据点之一是异常的。

6. 发明授权

US09292690B2 Anomaly, association and clustering detection 有权
标题翻译：异常，关联和聚类检测
公开(公告)号：US09292690B2
公开(公告)日：2016-03-22
申请号：US13524773
申请日：2012-06-15
申请人： Leman Akoglu , Hanghang Tong
发明人： Leman Akoglu , Hanghang Tong
IPC分类号： G06F7/00 , G06F17/30 , G06F21/56 , H04L29/06
CPC分类号： G06F17/30598 , G06F17/30303 , G06F17/30371 , G06F17/30501 , G06F17/30569 , G06F21/564 , G06F21/566 , G06F2221/2101 , G06F2221/2117 , H04L63/1425
摘要： Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.
摘要翻译：提供了异常，关联和聚类检测的技术。为一组数据中的每个属性构建至少一个代码表。选择与第一属性对应的第一代码表和对应于第二属性的第二代码表。第一代码表和第二代码表被合并到合并代码表中，并且确定接受或拒绝合并的代码表。当数据点的总压缩成本大于从一个或多个代码表推断出的阈值压缩成本时，检测到异常。通过合并属性组，分割数据组以及将数据点分配给数据组来检测数据表中的关联。从一个或多个代码表中的每一个的数据矩阵和代码字推断出一个集群。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式