发明名称 Clustering signifiers in a semantics graph
摘要 Clustering signifiers in a semantics graph can comprise coarsening a semantics graph associated with an enterprise communication network containing a plurality of nodes into a number of sub-graphs containing supernodes; partitioning each of the number of sub-graphs into a number of clusters; and iteratively refining the number of clusters to reduce an edge-cut of the semantics graph, based on the number of clusters.
申请公布号 US9355166(B2) 申请公布日期 2016.05.31
申请号 US201313756221 申请日期 2013.01.31
申请人 Hewlett Packard Enterprise Development LP 发明人 Ozonat Mehmet Kivanc;Bartolini Claudio
分类号 G06F17/30 主分类号 G06F17/30
代理机构 Brooks, Cameron & Huebsch, PLLC 代理人 Brooks, Cameron & Huebsch, PLLC
主权项 1. A method comprising: generating a semantics graph that represents content extracted from an enterprise network in the form of signifiers, wherein nodes of the semantics graph represent the signifiers; coarsening the semantics graph of the signifiers into a number of sub-graphs, the number of sub-graphs including a particular sub-graph that comprises a first node and a second node of the semantics graph; after coarsening the semantics graph into the number of sub-graphs, splitting the particular sub-graph into multiple clusters comprising a first cluster that includes the first node and a second cluster that includes the second node; and after splitting the particular sub-graph into the multiple clusters, reducing an edge-cut of the multiple clusters by switching the first node from the first cluster to the second cluster and switching the second node from the second cluster to the first cluster.
地址 Houston TX US